Indexing density models for incremental learning and anytime classification on data streams

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, EDBT'09

Volumn , Issue , 2009, Pages 311-322

  Seidl, Thomas ^a   Assent, Ira ^b   Kranen, Philipp ^a   Krieger, Ralph ^a   Herrmann, Jennifer ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ANYTIME LEARNING; BAYES CLASSIFIER; DATA STREAM; DENSITY MODELS; EVALUATION METHOD; INCREMENTAL LEARNING; INDIVIDUAL OBJECTS; KERNEL DENSITY ESTIMATORS; MIXTURE DENSITY; POISSON STREAM; PROBABILITY DENSITIES; STREAMING DATA; TRAINING DATA; TWO-STREAM;

CLASSIFIERS; DATA COMMUNICATION SYSTEMS; DATABASE SYSTEMS; LEARNING SYSTEMS; PROBABILITY DENSITY FUNCTION;

CLASSIFICATION (OF INFORMATION);

EID: 68749121246     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1516360.1516397     Document Type: Conference Paper

References (36)

1. D. Andre and P. Stone. Physiological data modeling contest (ICML-2004): http://www.cs.utexas.edu/users/pstone/workshops/2004icml/, 2004.
2. T. Bayes. An essay towards solving a problem in the doctrine of chances. Philosophical Transactions of the Royal Society, 53:370-418, 1763.
3. *-tree: an efficient and robust access method for points and rectangles. In SIGMOD, pages 322-331, 1990.
4. C. Böhm, A. Pryakhin, and M. Schubert. The Gauss-Tree: Efficient Object Identification in Databases of Probabilistic Feature Vectors. ICDE, 2006.
5. J. S. Breese and E. Horvitz. Ideal reformulation of belief networks. In UAI, pages 129-144, 1990.
6. C. J. C. Burges. A tutorial on support vector machines for pattern recognition. DMKD, 2(2):121-167, 1998.
7. Y. Cao and J. Wu. Projective art for clustering data sets in high dimensional spaces. Neural Networks, 15(l):105-120, 2002.
8. K. Crammer, J. S. Kandola, and Y. Singer. Online classification on a budget. In NIPS, 2003.
9. D. DeCoste. Anytime interval-valued outputs for kernel machines: Fast support vector machine classification via distance geometry. In IGML, 2002.
10. P. Domingos and G. Hulten. Mining high-speed data streams. In KDD, pages 71-80, 2000.
11. P. Domingos and G. Hulten. Learning from infinite data in finite time. In NIPS, pages 673-680, 2001.
12. R. Duda, P. Hart, and D. Stork. Pattern Classification (2nd Edition). Wiley, 2000.
13. S. Esmeir and S. Markovitch. Interruptible anytime algorithms for iterative improvement of decision trees. In UBDM workshop at KDD, 2005.
14. A. G. Gray and A. W. Moore. Nonparametric density estimation: Toward computational tractability. In SDM, 2003.
15. A. Guttman. R-trees: A dynamic index structure for spatial searching. In SIGMOD, pages 47-57, 1984.
16. T. Hastie, R. Tibshirani, and J. H. Friedman. Datasets for "The Elements of Statistical Learning": http://www-stat.stanford.edu/~tibs/ elemstatlearn/.
17. T. Hastie, R. Tibshirani, and J. H. Friedman. The Elements of Statistical Learning. Springer, 2002.
18. S. Hettich and S. Bay. The UCI KDD archive http://kdd.ics.uci.edu, 1999.
19. G. Hulten and P. Domingos. Mining complex models from arbitrarily large databases in constant time. In KDD, pages 525-531, 2002.
20. M. Jordan and R. Jacobs. Hierarchical Mixtures of Experts and the EM Algorithm. Graphical Models: Foundations of Neural Computation, 2001.
21. P. Kranen, D. Kensche, S. Kim, N. Zimmermann, E. Muller, C. Quix, X. Li, T. Gries, T. Seidl, M. Jarke, and S. Leonhardt. Mobile mining and information management in healthnet scenarios. In MDM, 2008.
22. C.-L. Liu and M. P. Wellman. On state-space abstraction for anytime evaluation of bayesian networks. SIGART Bulletin, 7(2):50-57, 1996.
23. K. Myers, M. J. Kearns, S. P. Singh, and M. A. Walker. A boosting approach to topic spotting on subdialogues. In ICML, pages 655-662, 2000.
24. J. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1992.
25. T. Seidl. Nearest Neighbor Classification/Liu L., Ozsu M. T. (eds.): Encyclopedia of Database Systems. (to appear). Springer, 2009.
26. T. Seidl and K. H.-P. Optimal multi-step k-nearest neighbor search. In Proc. ACM SIGMOD Int. Conf. on Management of Data, Seattle, Washington, pages 154-165, 1998.
27. L. Silva, J. M. de Sa, and L. Alexandra. Neural network classification using shannonSs entropy. In ESANN, 2005.
28. B. Silverman. Density Estimation for Statistics and Data Analysis. 1986.
29. W. N. Street and Y. Kim. A streaming ensemble algorithm (sea) for large-scale classification. In KDD, pages 377-382, 2001.
30. K. Ueno, X. Xi, E. Keogh, and D. Lee. Anytime Classification Using the Nearest Neighbor Algorithm with Applications to Stream Mining. ICDM, pages 623-632, 2006.
31. W. Wahlster. Verbmobil: Foundations of Speech-To-Speech Translation. Springer, 2000.
32. H. Wang, W. Fan, P. S. Yu, and J. Han. Mining concept-drifting data streams using ensemble classifiers. In KDD, pages 226-235, 2003.
33. G. Widmer and M. Kubat. Learning in the presence of concept drift and hidden contexts. Machine Learning, 23(l):69-101, 1996.
34. Y. Yang, G. Webb, K. Korb, and K. M. Ting. Classifying under computational resource constraints: anytime classification using probabilistic estimators. Machine Learning, 69(l):35-53, 2007.
35. T. Zhang, R. Ramakrishnan, and M. Livny. Fast density estimation using cf-kernel for very large databases. In KDD, pages 312-316, 1999.
36. S. Zilberstein. Using anytime algorithms in intelligent systems. The AI magazine, 17(3):73-83, 1996.