Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 580397, 14 pages
http://dx.doi.org/10.1155/2013/580397
Research Article

Incremental Optimization Mechanism for Constructing a Decision Tree in Data Stream Mining

Department of Computer and Information Science, Faculty of Science and Technology, University of Macau, Taipa, Macau

Received 21 September 2012; Revised 21 January 2013; Accepted 29 January 2013

Academic Editor: Sabrina Senatore

Copyright © 2013 Hang Yang and Simon Fong. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. P. Domingos and G. Hulten, “Mining high-speed data streams,” in Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '01), pp. 71–80, ACM, August 2000. View at Scopus
  2. S. Fong, H. Yang, S. Mohammed, and J. Fiaidhi, “Stream-based biomedical classification algorithms for analyzing biosignals,” Journal of Information Processing Systems, vol. 7, no. 4, pp. 717–732, 2011. View at Publisher · View at Google Scholar
  3. N. Chawla, N. Japkowicz, and A. Kolcz, “Special issue on learning from imbalanced data sets,” ACM SIGKDD Explorations, vol. 6, no. 1, 2004. View at Google Scholar
  4. D. Mladenic and M. Grobelnik, “Feature selection for unbalanced class distribution and naive bayes,” in Proceedings of the 16th International Conference on Machine Learning, pp. 258–267, Morgan Kaufmann, Boston, Mass, USA, 1999. View at Google Scholar
  5. T. Elomaa, “The biases of decision tree pruning strategies,” in Advances in Intelligent Data Analysis, vol. 1642 of Lecture Notes in Computer Science, pp. 63–74, 1999. View at Publisher · View at Google Scholar
  6. B. Pfahringer, G. Holmes, and R. Kirkby, “New options for hoeffding trees,” in Proceedings of the Australian Conference on Artificial Intelligence, pp. 90–99, 2007.
  7. J. Gama, R. Rocha, and P. Medas, “Accurate decision trees for mining high-speed data streams,” in Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '03), pp. 523–528, ACM, Washington, DC, USA, August 2003. View at Publisher · View at Google Scholar · View at Scopus
  8. S. Hashemi and Y. Yang, “Flexible decision tree for data stream classification in the presence of concept change, noise and missing values,” Data Mining and Knowledge Discovery, vol. 19, no. 1, pp. 95–131, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  9. H. Stefan, P. Russel, and S. K. Yun, “CBDT: a concept based approach to data stream mining,” in Advances in Knowledge Discovery and Data Mining, vol. 5476 of Lecture Notes in Computer Science, pp. 1006–1012, 2009. View at Publisher · View at Google Scholar
  10. J. Gama and P. Kosina, “Learning decision rules from data streams,” in Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI '11), T. Walsh, Ed., vol. 2, pp. 1255–1260, AAAI Press, 2011.
  11. H. Yang and S. Fong, “Moderated VFDT in stream mining using adaptive tie threshold and incremental pruning,” in Proceedings of the 13th International Conference on Data Warehousing and Knowledge Discovery (DaWaK '11), pp. 471–483, Springer, Toulouse, France, 2011.
  12. G. Hulten P Domingos, “VFML—a toolkit for mining high-speed time-changing data streams,” 2003, http://www.cs.washington.edu/dm/vfml/.
  13. B. Albert, H. Geoff, P. Bernhard et al., “MOA: a real-time analytics open source framework,” vol. 6913 of Lecture Notes in Computer Science, pp. 617–620. View at Google Scholar
  14. N. Oza and S. Russell, “Online bagging and boosting,” in Artificial Intelligence and Statistics, pp. 105–112, Morgan Kaufmann, Boston, Mass, USA, 2001. View at Google Scholar
  15. A. Bifet, G. Holmes, B. Pfahringer, R. Kirkby, and R. Gavaldà, “New ensemble methods for evolving data streams,” in Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '09), pp. 139–147, ACM, Paris, France, July 2009. View at Publisher · View at Google Scholar · View at Scopus
  16. A. Bifet and R. Gavalda, “Learning from time-changing data with adaptive windowing,” in Proceedings of the of SIAM International Conference on Data Mining, pp. 443–448, 2007.
  17. G. Hulten, L. Spencer, and P. Domingos, “Mining time-changing data streams,” in Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '01), pp. 97–106, ACM, August 2001. View at Scopus
  18. H. Geoffrey, K. Richard, and P. Bernhard, “Tie breaking in hoeffding trees,” in Proceedings of the 2nd International Workshop on Knowledge Discovery from Data Streams, pp. 107–116, Porto, Portugal, 2005.
  19. A. Frank and A. Asuncion, UCI Machine Learning Repository, University of California, School of Information and Computer Science, Irvine, Calif, USA, 2010, http://archive.ics.uci.edu/ml/.
  20. J. P. Bradford, C. Kunz, R. Kohavi, C. Brunk, and C. E. Brodley, “Pruning decision trees with misclassification costs,” in Proceedings of the 10th European Conference on Machine Learning (ECML '98), pp. 131–136, Springer, 1998.