Anytime classification using the nearest neighbor algorithm with applications to stream mining

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 623-632

  Ueno, Ken ^a   Xi, Aopeng ^b   Keogh, Eamonn ^b   Lee, Dah Jye ^c  

^a TOSHIBA CORPORATION   (Japan)

^b University of California Riverside   (United States)

^c BRIGHAM YOUNG UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BURSTY STREAM; NEIGHBOR ALGORITHMS; REAL WORLD PROBLEMS;

ALGORITHMS; CLASSIFICATION (OF INFORMATION); SET THEORY;

DATA MINING;

EID: 72849144638     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2006.21     Document Type: Conference Paper

References (30)

1. T. Adamek and N. E. Connor. A multiscale representation method for nonrigid shapes with a single closed contour. IEEE Circuits and Systems for Video Technology, Vol.14, pp. 742-753, 2004.
2. C. Aggarwal, J. Han, J. Wang, and P. S. Yu. On demand classification of data streams. In Proc. of the International Conference on Knowledge Discovery and Data Mining, 2004.
3. H. I. Bozma, and H. Yalcin. Visual processing and classification of items on a moving conveyor: A selective perception approach. Robotics and Computer Integrated Manufacturing, 18(2): 125-133, 2002.
4. P. Bradley, U. Fayyad and C. Reina. Scaling clustering algorithms to large databases. In Proc. of the 4th International Conference on Knowledge Discovery and Data Mining, pp. 9-15, 1998.
5. S. Esmeir, and S. Markovitch. Interruptible anytime algorithms for iterative improvement of decision trees. In Proc. of Workshop on the Utility-Based Data Mining, held with the 11th International Conference on Knowledge Discovery and Data Mining, 2005.
6. P. Geurts. Contributions to decision tree induction: bias/variance tradeoff and time series classification. Ph.D. thesis, Department of Electrical Engineering and Computer Science, University of Liege, Belgium, 2002.
7. J. Grass, and S. Zilberstein. Anytime algorithm development tools. SIGART Artificial Intelligence. Vol 7, No. 2, ACM Press, 1996.
8. O. Grumberg, S. Livne, and S. Markovitch. Learning to order BDD variables in verification. Journal of Artificial Intelligence Research, 2003.
9. A. Guttman. R-trees: A Dynamic Index Structure for Spatial Searching. In Proc. of International Conference on Management of Data, Boston, MA, 1984, pp. 47-57.
10. E. A. Hansen, and S. Zilberstein. Monitoring anytime algorithms. In M. Pittarelli (Ed.), SIGART Bulletin Special Issue on Anytime Algorithms and Deliberation Scheduling, Vol.7, No.2, pp. 28-33, 1996.
11. G. Heidemann, H. Bekel, I. Bax, I, and H. Ritter. Interactive online learning. Pattern Recognition and Image Analysis, Vol.15, No.1, pp. 55-58, 2005.
12. G. Hulten, and P. Domingos. Mining complex models from arbitrarily large databases in constant time. In Proc. of the 8th International Conference on Knowledge Discovery and Data Mining, pp. 525-531, 2002.
13. E. Keogh, L. Wei, X. Xi, S.H. Lee and M. Vlachos. LB_Keogh Supports Exact Indexing of Shapes under Rotation Invariance with Arbitrary Representations and Distance Measures. To appear in VLDB 2006.
14. E. Keogh, www.cs.ucr.edu/~eamonn/ICDM06/
15. I. Kotenko, and L. Stankevitch. The control of teams of autonomous objects in the time-constrained environments. In Proc. of the IEEE International Conference on Artificial Intelligence Systems, pp. 158-163, 2002.
16. D-J. Lee, R. Schoenberger, D. Shiozawa, X. Xu, and P. Zhan (2004). Contour Matching for a Fish Recognition and Migration Monitoring System. In Proc. of the SPIE Optics East, Two and Three-Dimensional Vision Systems for Inspection, Control, and Metrology II, vol. 5606-05, Oct. 25-28, 2004.
17. M. Li, X. Chen , X. Li , B. Ma and P. Vitányi, The similarity metric. In Proc. of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, 2003.
18. T. Lindgren. Anytime inductive logic programming. In Proc. of the 15th International Conference on Computers and Their Applications, pp. 439-442, 2000.
19. K. Myers, M. J. Kearns, S. P. Singh, M. A. Walker. A boosting approach to topic spotting on subdialogues. In Proc. of the International Conference on Machine Learning, pp. 655-662, 2000.
20. E. Pekalska, R. Duin, and P. Paclik. Prototype selection for dissimilarity-based classifiers. Pattern Recognition, Vol. 39, No.2, pp. 189-208, 2006.
21. J.J. Rodriguez, and C.J. Alonso. Interval and dynamic time warping-based decision trees. In Proc. of the 2004 ACM symposium on Applied computing, pp. 548-552.
22. N. Roy, and A. McCallum. Toward optimal active learning through sampling estimation of error reduction. In Proc. of the 18th International Conference on Machine Learning, pp. 441-448, 2001.
23. R. Shah, S. Krishnaswamy, and M. M. Gaber. Resource-aware very fast K-Means for ubiquitous data stream mining, In Proc. of 2nd International Workshop on Knowledge Discovery in Data Streams. 2005.
24. S. Yamada, and N. Nagino. Constructing a personal web map with anytime-control of web robots. International Journal of Cooperative Information Systems, Vol. 11 No.1-2, pp. 1-19, 2002.
25. G.I. Webb, Y. Yang, J. Boughton, K. Korb, and K-M. Ting Classifying under computational resource constraints: Anytime classification using probabilistic estimators. Technical Report 2005/185, Clayton School of Information Technology, Monash University, 2005.
26. L. Wei, E. Keogh, H. Van Herle, and A. Mafra-Neto. Atomic Wedgie: Efficient query filtering for streaming time series. In Proc. of the 5th IEEE International Conference on Data Mining, pp. 490-497, 2005.
27. Z. Wen, and Y. Tao. Dual-Camera NIR/MIR imaging for stem-end/calyx identification in apple defect sorting. Transaction of ASAE. Vol.43, No.2, pp. 446-452, 2000.
28. D.R. Wilson and T.R Martinez. Reduction techniques for instance-based learning algorithms. Machine Learning, Vol 38, pp. 257-286, Kluwer Acadamic Publishers, 2000.
29. R. Winn Hardin. Vision System Monitors Fish Populations. Vision Systems Design, January 2006.
30. S. Zilberstein, and S. Russell. Approximate reasoning using anytime algorithms. In Imprecise and Approximate Computation, Kluwer Academic Publishers, 1995.