Abstract
This paper presents an incremental and scalable learning algorithm in order to mine numeric, low dimensionality, high–cardinality, time–changing data streams. Within the Supervised Learning field, our approach, named SCALLOP, provides a set of decision rules whose size is very near to the number of concepts to be extracted. Experimental results with synthetic databases of different complexity degrees show a good performance from streams of data received at a rapid rate, whose label distribution may not be stationary in time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) Proc. 20th International Conf. on Very Large Data Bases, VLDB, September 12-15, pp. 487–499. Morgan Kaufmann, San Francisco (1994)
Bartlett, P.L., Ben-David, S., Kulkarni, S.R.: Learning changing concepts by exploiting the structure of change. In: Computational Learing Theory, pp. 131–139 (1996)
Bradley, P.S., Fayyad, U.M., Reina, C.: Scaling clustering algorithms to large database. Knowledge Discovery and Data Mining, 9–15 (1998)
Cattlet, J.: Megainduction: machine learning on very large databases. PhD thesis, Basser Department of Computer Science, University of Sydney, Australia (1991)
Wai-Lok Cheung, D., Han, J., Ng, V., Wong, C.Y.: Maintenance of discovered association rules in large databases: An incremental updating technique. In: ICDE, pp. 106–114 (1996)
Dobra, A., Gehrke, J.: Secret: A scalable linear regression tree algorithm. In: Proc. 8th ACM SIGKDD International Conf. on Knowledge Discovery and Data Mining, Edmonton, Canada, ACM Press, New York (2002)
Domingos, P., Hulten, G.: Mining high-speed data streams. In: Proc. 6th ACM SIGKDD International Conf. on Knowledge Discovery and Data Mining, Boston, MA, pp. 71–80 (2000)
Ganti, V., Gehrke, J., Ramakrishnan, R.: Mining data streams under block evolution. ACM SIGKDD Explorations 3(2), 1–10 (2002)
Garofalakis, M., Rastogi, R.: Scalable data mining with model constraints. ACM SIGKDD Explorations 2(2), 39–48 (2000)
Gehrke, J., Ganti, V., Ramakrishnan, R., Loh, W.Y.: BOAT – optimistic decision tree construction. In: ACM SIGMOD Conference, pp. 169–180, Philadelphia, Pennsylvania (1999)
Gehrke, J., Ramakrishnan, R., Ganti, V.: Rainforest – a framework for fast decision tree construction of large datasets. In: Proc. 24th Int. Conf. Very Large Data Bases, VLDB, pp. 416–427 (1998)
Guha, S., Mishra, N., Motwani, R., O’Callaghan, L.: Clustering data streams. In: IEEE Symposium on Foundations of Computer Science, pp. 359–366 (2000)
Guha, S., Rastogi, R., Shim, K.: CURE: an efficient clustering algorithm for large databases. In: ACM SIGMOD International Conference on Management of Data, June 1998, pp. 73–84 (1998)
Hulten, G., Spencer, L., Domingos, P.: Mining time-changing data streams. In: Proc. 7th ACM SIGKDD International Conf. on Knowledge Discovery and Data Mining, pp. 97–106. ACM Press, San Francisco (2001)
Hulten, G., Spencer, L., Domingos, P.: Mining complex models from arbitrarily large databases in constant time. In: Proc. 8th ACM SIGKDD International Conf. on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, ACM Press, New York (2002)
Kelly, M., Hand, D., Adams, N.: The impact of changing populations on classier performance (1999)
Rastogi, R., Garofalakis, M., Hyun, D., Shim, K.: Scalable data mining with model constraints. In: Proc. 6th ACM SIGKDD International Conf. on Knowledge Discovery and Data Mining, Boston, MA, pp. 335–339 (2000)
O’Callaghan, L., Mishra, N., Meyerson, A., Guha, S.: High–performance clustering of streams and large data sets. In: Proc. 18th International Conf. on Data Engineering, pp. 359–366 (2000)
Provost, F., Kolluri, V.: A survey of methods for scaling up inductive algorithms. Data Mining and Knowledge Discovery 3(2), 131–169 (1999)
Shafer, J.C., Agrawal, R., Mehta, M.: SPRINT: A scalable parallel classifier for data mining. In: Proc. 22th International Conf. Very Large Databases, VLDB, pp. 544–555 (1996)
Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: an efficient data clustering method for very large databases. In: ACM SIGMOD International Conf. on Management of Data, Montreal, Canada, June 1996, pp. 103–114 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ferrer-Troyano, F.J., Aguilar-Ruiz, J.S., Riquelme, J.C. (2003). Mining Low Dimensionality Data Streams of Continuous Attributes. In: Pires, F.M., Abreu, S. (eds) Progress in Artificial Intelligence. EPIA 2003. Lecture Notes in Computer Science(), vol 2902. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24580-3_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-24580-3_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20589-0
Online ISBN: 978-3-540-24580-3
eBook Packages: Springer Book Archive