A survey of stream classification algorithms

Data Classification: Algorithms and Applications

Volumn , Issue , 2014, Pages 245-273

  Aggarwal, Charu C ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84960427987     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/b17320     Document Type: Chapter

References (97)

1. C. Aggarwal. Data Streams: Models and Algorithms, Springer, 2007.
2. C. Aggarwal. On density-based transforms for uncertain data mining, Proceedings of the ICDE Conference, pages 866–875, 2007.
3. C. Aggarwal. Outlier Analysis, Springer, 2013.
4. C. Aggarwal and P. Yu. LOCUST: An online analytical processing framework for high dimensional classification of data streams, Proceedings of the ICDE Conference, pages 426–435, 2008.
5. C. Aggarwal and P. Yu. On classification of high cardinality data streams. Proceedings of the SDM Conference, pages 802–813, 2010.
6. C. Aggarwal and C. X. Zhai, Mining Text Data, Springer, 2012.
7. C. Aggarwal, Y. Li, P. Yu, and R. Jin. On dense pattern mining in graph streams, Proceedings of the VLDB Conference, 3(1-2):975–984, 2010.
8. C. Aggarwal, Y. Zhao, and P. Yu. On clustering graph streams, Proceedings of the SDM Conference, 2010.
9. C. Aggarwal, On classification of graph streams, Proceedings of the SDM Conference, 2010.
10. C. Aggarwal. A framework for clustering massive-domain data streams, Proceedings of the ICDE Conference, pages 102–113, 2009.
11. C. C. Aggarwal, J. Han. J. Wang, and P. Yu. A framework for clustering evolving data streams, Proceedings of the VLDB Conference, pages 81–92, 2003.
12. C. C. Aggarwal. On biased reservoir sampling in the presence of stream evolution, Proceedings of the VLDB Conference, pages 607–618, 2006.
13. C. C. Aggarwal and P. Yu. On clustering massive text and categorical data streams, Knowledge and Information Systems, 24(2), pp. 171–196, 2010.
14. C. Aggarwal, J. Han, J. Wang, and P. Yu. A framework for classification of evolving data streams. In IEEE Transactions on Knowledge and Data Engineering, 18(5):577–589, 2006.
15. C. Aggarwal and K. Subbian. Event detection in social streams, Proceedings of the SDM Conference, 2012.
16. T. Al-Khateeb, M. Masud, L. Khan, C. Aggarwal, J. Han, and B. Thuraisingham. Recurring and novel class detection using class-based ensemble, Proceedings of the ICDM Conference, 2012.
17. I. Androutsopoulos, J. Koutsias, K. V. Chandrinos, and C. D. Spyropoulos. An experimental comparison of naive Bayesian and keyword-based anti-spam filtering with personal e-mail messages. Proceedings of the ACM SIGIR Conference, pages 160–167, 2000.
18. A. Banerjee and J. Ghosh. Competitive learning mechanisms for scalable, balanced and incremental clustering of streaming texts, Neural Networks, pages 2697–2702, 2003.
19. A. Bifet, G. Holmes, B. Pfahringer, and E. Frank. Fast perceptron decision tree learning from evolving data streams. Advances in Knowledge Discovery and Data Mining, pages 299–310, 2010.
20. L. Breiman, J. Friedman, and C. Stone, Classification and Regrssion Trees, Chapman and Hall, 1984.
21. K. Crammer and Y. Singer. A new family of online algorithms for category ranking, ACM SIGIR Conference, pages 151–158, 2002.
22. K. Chai, H. Ng, and H. Chiu. Bayesian online classifiers for text classification and filtering, ACM SIGIR Conference, pages 97–104, 2002.
23. P. Clark and T. Niblett. The CN2 induction algorithm, Machine Learning, 3(4): 261–283, 1989.
24. W. Cohen. Fast effective rule induction, ICML Conference, pages 115–123, 1995.
25. I. Dagan, Y. Karov, and D. Roth. Mistake-driven learning in text categorization. Proceedings of Conference Empirical Methods in Natural Language Processing, pages 55–63, 1997.
26. P. Domingos and G. Hulten, Mining high-speed data streams, ACM KDD Conference, pages 71–80, 2000.
27. W. Fan. Systematic data selection to mining concept drifting data streams, ACM KDD Conference, pages 128–137, 2004.
28. Y. Freund and R. Schapire. Large margin classification using the perceptron algorithm, Machine Learning, 37(3):277–296, 1998.
29. Y. Freund, R. Schapire, Y. Singer, M. Warmuth. Using and combining predictors that specialize. Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 334–343, 1997.
30. G. Cauwenberghs and T. Poggio. Incremental and decremental support vector machine learning, NIPS Conference, pages 409–415, 2000.
31. N. Chawla, N. Japkowicz, and A. Kotcz. Editorial: special issue on learning from imbalanced data sets. ACM SIGKDD Explorations Newsletter, 6(1):1–6, 2004.
32. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. Ullman, and C. Yang, Finding interesting associations without support pruning, IEEE TKDE, 13(1): 64–78, 2001.
33. W. Cohen and Y. Singer. Context-sensitive learning methods for text categorization. ACM Transactions on Information Systems, 17(2): 141–173, 1999.
34. G. Cormode and S. Muthukrishnan. An improved data-stream summary: The count-min sketch and its applications, Journal of Algorithms, 55(1):58–75, 2005.
35. I. Dagan, Y. Karov, and D. Roth. Mistake-driven learning in text categorization, Proceedings of EMNLP, pages 55-63, 1997.
36. C. Domeniconi and D. Gunopulos. Incremental support vector machine construction. ICDM Conference, pages 589–592, 2001.
37. J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang, Graph distances in the data stream model. SIAM Jour. on Comp., 38(5):1709–1727, 2005.
38. G. Fung and O. L. Mangasarian. Incremental support vector machine classification. SIAM Conference on Data Mining, pages 77–86, 2002.
39. G. P. C. Fung, J. X. Yu, and H. Lu. Classifying text streams in the presence of concept drifts. Advances in Knowledge Discovery and Data Mining, 3056:373–383, 2004.
40. J. Gama, R. Fernandes, and R. Rocha. Decision trees for mining data streams. Intelligent Data Analysis, 10:23–45, 2006.
41. J. Gao, W. Fan, J. Han, and P. Yu. A general framework for mining concept drifting data stream with skewed distributions, SDM Conference, 2007.
42. J. Gao, W. Fan, and J. Han. On appropriate assumptions to mine data streams: Analysis and practice, ICDM Conference, pages 143–152, 2007.
43. J. Gehrke, V. Ganti, R. Ramakrishnan, and W.-Y. Loh. BOAT: Optimistic decision tree construction, ACM SIGMOD Conference, pages 169–180, 1999.
44. J. Gehrke, R. Ramakrishnan, and V. Ganti. Rainforest—A framework for fast decision tree construction of large datasets, VLDB Conference, pages 416–427, 1998.
45. T. Guo, L. Chi, and X. Zhu. Graph hashing and factorization for fast graph stream classification. ACM CIKM Conference, pages 1607–1612, 2013.
46. 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, 19(1):95-131, 2009.
47. G. Hulten, L. Spencer, and P. Domingos. Mining time-changing data streams. ACM KDD Conference, pages 97–106, 2001.
48. R. Jin and G. Agrawal. Efficient Decision Tree Construction on Streaming Data, ACM KDD Conference, pages 571–576, 2003.
49. D. Kalles and T. Morris. Efficient incremental induction of decision trees. Machine Learning, 24(3):231–242, 1996.
50. T. Joachims. Making large scale SVMs practical. Advances in Kernel Methods, Support Vector Learning, pp. 169–184, MIT Press, Cambridge, 1998.
51. T. Joachims. Training linear SVMs in linear time. KDD, pages 217–226, 2006.
52. R. Klinkenberg and T. Joachims. Detecting concept drift with support vector machines. ICML Conference, pages 487–494, 2000.
53. J. Kolter and M. Maloof. Dynamic weighted majority: A new ensemble method for tracking concept drift, ICDM Conference, pages 123–130, 2003.
54. Y.-N. Law and C. Zaniolo. An adaptive nearest neighbor classification algorithm for data streams, PKDD Conference, pages 108–120, 2005.
55. D. Lewis. The TREC-4 filtering track: description and analysis. Proceedings of TREC-4, 4th Text Retrieval Conference, pages 165–180, 1995.
56. D. Lewis, R. E. Schapire, J. P. Callan, and R. Papka. Training algorithms for linear text classifiers. ACM SIGIR Conference, pages 298–306, 1996.
57. B. Li, X. Zhu, L. Chi, and C. Zhang. Nested subtree hash kernels for large-scale graph classification over streams. ICDM Conference, pages 399–408, 2012.
58. X. Li, P. Yu, B. Liu, and S. K. Ng. Positive-unlabeled learning for data stream classification, SDM Conference, pages 257–268, 2009.
59. C. Liang, Y. Zhang, and Q. Song. Decision tree for dynamic and uncertain data streams. 2nd Asian Conference on Machine Learning, volume 3, pages 209–224, 2010.
60. N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2: pages 285–318, 1988.
61. B. Liu, W. Hsu, and Y. Ma, Integrating classification and association rule mining, ACM KDD Conference, pages 80–86, 1998.
62. S. Pan, Y. Zhang, and X. Li. Dynamic classifier ensemble for positive unlabeled text stream classification. Knowledge and Information Systems, 33(2):267–287, 2012.
63. J. R. Quinlan. C4.5: Programs in Machine Learning, Morgan-Kaufmann Inc, 1993.
64. M. Masud, T. Al-Khateeb, L. Khan, C. Aggarwal, J. Gao, J. Han, and B. Thuraisingham. Detecting recurring and novel classes in concept-drifting data streams. ICDM Conference, pages 1176–1181, 2011.
65. M. Masud, Q. Chen, L. Khan, C. Aggarwal, J. Gao, J. Han, A. Srivastava, and N. Oza. Classification and adaptive novel class detection of feature-evolving data streams, IEEE Transactions on Knowledge and Data Engineering, 25(7):1484–1487, 2013. Available at http://doi.ieeecomputersociety.org/10.1109/TKDE.2012.109
66. M. Masud, J. Gao, L. Khan, J. Han, and B. Thuraisingham: A practical approach to classify evolving data streams: Training with limited amount of labeled data. ICDM Conference, pages 929–934, 2008.
67. M. Markou and S. Singh. Novelty detection: A review, Part 1: Statistical approaches, Signal Processing, 83(12):2481–2497, 2003.
68. M. Mehta, R. Agrawal, and J. Rissanen. SLIQ: A fast scalable classifier for data mining, EDBT Conference, pages 18–32, 1996.
69. L. Minku, A. White, and X. Yao. The impact of diversity on online ensemble learning in the presence of concept drift, IEEE Transactions on Knowledge and Data Engineering, 22(6):730–742, 2010.
70. H. T. Ng, W. B. Goh, and K. L. Low. Feature selection, perceptron learning, and a usability case study for text categorization. SIGIR Conference, pages 67–73, 1997.
71. N. Oza and S. Russell. Online bagging and boosting. In Eighth Int. Workshop on Artificial Intelligence and Statistics, pages 105–112. Morgan Kaufmann, 2001.
72. S. Pan and X. Zhu. Graph classification with imbalanced class distributions and noise. AAAI Conference, pages 1586–1592, 2013.
73. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers, 1993.
74. L. Ralaivola and F. d’Alché-Buc. Incremental support vector machine learning: A local approach. Artificial Neural Network, pages 322–330, 2001.
75. F. Rosenblatt. The perceptron: A probabilistic model for information and storage organization in the brain, Psychological Review, 65: pages 386–407, 1958.
76. S. Ruping. Incremental learning with support vector machines. IEEE ICDM Conference, pp. 641–642, 2001.
77. T. Salles, L. Rocha, G. Pappa, G. Mourao, W. Meira Jr., and M. Goncalves. Temporally-aware algorithms for document classification. ACM SIGIR Conference, pages 307–314, 2010.
78. J. Schlimmer and D. Fisher. A case study of incremental concept induction. Proceedings of the Fifth National Conference on Artificial Intelligence, pages 495–501. Morgan Kaufmann, 1986.
79. H. Schutze, D. Hull, and J. Pedersen. A comparison of classifiers and document representations for the routing problem. ACM SIGIR Conference, pages 229–237, 1995.
80. A. Shilton, M. Palaniswami, D. Ralph, and A. Tsoi. Incremental training of support vector machines. IEEE Transactions on Neural Networks, 16(1):114–131, 2005.
81. W. N. Street and Y. Kim. A streaming ensemble algorithm (sea) for large-scale classification. ACM KDD Conference, pages 377–382, 2001.
82. N. Syed, H. Liu, and K. Sung. Handling concept drifts in incremental learning with support vector machines. ACM KDD Conference, pages 317–321, 1999.
83. P. Utgoff. Incremental induction of decision trees. Machine Learning, 4(2):161–186, 1989.
84. P. Utgoff and C. Brodley. An incremental method for finding multivariate splits for decision trees. Proceedings of the Seventh International Conference on Machine Learning, pages 58-65, 1990.
85. P. Utgoff. An improved algorithm for incremental induction of decision trees. Proceedings of the Eleventh International Conference on Machine Learning, pages 318–325, 1994.
86. J. Vitter. Random sampling with a reservoir, ACM Transactions on Mathematical Software (TOMS), 11(1):37–57, 1985.
87. H. Wang, W. Fan, P. Yu, J. Han. Mining concept-drifting data streams with ensemble classifiers, KDD Conference, pages 226–235, 2003.
88. H. Wang, J. Yin, J. Pei, P. Yu, and J. X. Yu. Suppressing model overfitting in concept drifting data streams, ACM KDD Conference, pages 736–741, 2006.
89. E. Wiener, J. O. Pedersen, and A. S. Weigend. A neural network approach to topic spotting, SDAIR, pages 317–332, 1995.
90. Y. Yang, X. Wu, and X. Zhu. Combining proactive and reactive predictions for data streams, ACM KDD Conference, pages 710–715, 2005.
91. K. L. Yu andW. Lam. A new on-line learning algorithm for adaptive text filtering, ACM CIKM Conference, pages 156–160, 1998.
92. S. Dzeroski and B. Zenko. Is combining classifiers better than selecting the best one? Machine Learning, 54(3):255–273, 2004.
93. Y. Zhang, X. Li, and M. Orlowska. One class classification of text streams with concept drift, ICDMW Workshop, pages 116–125, 2008.
94. J. Zhang, Z. Ghahramani, and Y. Yang. A probabilistic model for online document clustering with application to novelty detection, NIPS, 2005.
95. P. Zhang, Y. Zhu, and Y. Shi. Categorizing and mining concept drifting data streams, ACM KDD Conference, pages 812–820, 2008.
96. X. Zhu, X. Wu, and Y. Zhang. Dynamic classifier selection for effective mining from noisy data streams, ICDM Conference, pages 305–312, 2004.
97. http://www.itl.nist.gov/iad/mig/tests/tdt/tasks/fsd.html