Autocannibalistic and anyspace indexing algorithms with applications to sensor data mining

Society for Industrial and Applied Mathematics - 9th SIAM International Conference on Data Mining 2009, Proceedings in Applied Mathematics

Volumn 1, Issue , 2009, Pages 84-95

  Ye, Lexiang ^a   Wang, Xiaoyue ^a   Keogh, Eamonn ^a   Mafra Neto, Agenor ^b  

^a University of California Riverside   (United States)

^b ISCA Technologies   (United States)

Author keywords

Anyspace algorithms; Data mining; Indexing; Sensors

Indexed keywords

ANYSPACE ALGORITHMS; AUTONOMOUS ROBOT; DATA MINING ALGORITHM; DATABASE COMMUNITY; EFFECTIVE ALGORITHMS; INDEXING; INDEXING ALGORITHMS; LOW POWER SENSOR; METRIC SPACES; SENSOR-DATA MINING;

DATA MINING; INDEXING (OF INFORMATION); ORCHARDS; SENSORS; SET THEORY; TOPOLOGY;

ALGORITHMS;

EID: 72849141374     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. S.J. Castle, S.E. Naranjo, J.L. Bi, F.J. Byrne and N.C. Toscano. Phenology and demography of Homalodisca coagulata (Hemiptera: Cicadellidae) in southern California citrus and implications for management Bulletin of Entomological Research (2005) 95, 621-634
2. A. Chechetka and. K. Sycara. An Any-space Algorithm for Distributed Constraint Optimization. In Proceedings of AAAI Spring Symposium on Distributed Plan and Schedule Management, March, 2006.
3. K.L. Clarkson. Nearest-neighbor searching and metric space dimensions. In Nearest-Neighbor Methods for Learning and Vision: Theory and Practice, MIT Press, 2006.
4. A. Darwiche. Any-space probabilistic inference. In 16th Conference on Uncertainty in Artificial Intelligence, pages 133-142, 2000.
5. C. Elkan. Using the triangle inequality to accelerate kMeans. In Proceedings of the Twentieth International Conference on Machine Learning, pages 147-153, 2003.
6. D. Ghosh and A. P. Shivaprasad. Fast codeword search algorithm for real-time codebook generation inadaptive VQ. Vision, Image and Signal Processing, IEE Proceedings, volume: 144, issue: 5. pages 278-284, 1997.
7. J. Grass and S. Zilberstein. Anytime algorithm development tools. SIGART Artificial Intelligence. volumn 7, no. 2, ACM Press, 1996.
8. C. Faloutsos and K. I. Lin. FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In Proceedings of the 1st ACM SIGKDD Conference, pages 163-174, 1995.
9. M. E. Hodgson. Reducing computational requirements of the minimum-distance classifier. Remote Sensing of Environments, 25:117-128, 1988.
10. A. Ihler, J. Hutchins, and P. Smyth. Adaptive event detection with time-varying Poisson processes. In Proceedings of the 12th ACM SIGKDD Conference (KDD'06), 2006.
11. M. T. Orchard. A fast nearest-neighbor search algorithm. International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 2297-2300, IEEE Computer Society Press, 1991.
12. B. C. Song; J. B. Ra. A fast search algorithm for vector quantization using L2-norm pyramid of codewords; Image Processing, IEEE Transactions, volume 11, issue 1, pages 10-15, 2002.
13. P. Smyth and D. Wolpert. Anytime Exploratory Data Analysis for Massive Data Sets. In Proceeding of the 3rd International Conference on Knowledge Discovery and Data mining (KDD'97), pages 54-60, 1997.
14. K. Ueno, X. Xi, E. Keogh and D.J. Lee. Anytime Classification Using the Nearest Neighbor Algorithm with Applications to Stream Mining, In Proc. of the 6th International Conference on Data Mining (ICDM'06), pages 623-632, 2006.
15. rd SIAM Int'l Conference on Data Mining. San Francisco, CA. 2003.
16. J. T. Wang, X. Wang, K. I. Lin, D. Shasha, B. A. Shapiro & K. Zhang. Evaluating a class of distance-mapping algorithms for data mining and clustering. In Proceedings of the 4th ACM SIGKDD Conference, pages 307-311, 1999.
17. 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.
18. L. Ye.(2008). Supporting URL for this paper. www.cs.ucr.edu/ ∼lexiangy/Anyspace/Dataset.html
19. P. N. Yianilos. Data structures and algorithms for nearest neighbor search in general metric spaces. In Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 311-321, 1993.
20. K. Zatloukal, M. H. Johnson and R. Ladner. Nearest neighbor search for data compression. In Data Structures, Nearest Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges. AMS, 2002.
21. S. Zilberstein, and S. Russell. Approximate reasoning using anytime algorithms. In Imprecise and Approximate Computation, Kluwer Academic Publishers, 1995.