K-nearest neighbor classification on spatial data streams using P-trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2336, Issue , 2002, Pages 517-528

  Khan, Maleq ^a   Ding, Qin ^a   Perrizo, William ^a  

^a North Dakota State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA COMMUNICATION SYSTEMS; DATA MINING; FORESTRY; MEMBERSHIP FUNCTIONS; MOTION COMPENSATION; NEAREST NEIGHBOR SEARCH; TEXT PROCESSING; TREES (MATHEMATICS);

CLASSIFICATION ACCURACY; CLASSIFICATION TIME; FAST AND EFFICIENT ALGORITHMS; K-NEAREST NEIGHBOR CLASSIFICATION; K-NEAREST NEIGHBORS; K-NN CLASSIFICATIONS; NEAREST NEIGHBORS; SPATIAL DATA STREAMS;

CLASSIFICATION (OF INFORMATION);

EID: 84945279952     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-47887-6_51     Document Type: Article

References (11)

1. Domingos, P. and Hulten, G., “Mining high-speed data streams”, Proceedings of ACM SIGKDD 2000.
2. Domingos, P., & Hulten, G., “Catching Up with the Data: Research Issues in Mining Data Streams”, DMKD 2001.
3. T. Cover and P. Hart, “Nearest Neighbor pattern classification”, IEEE Trans. Information Theory, 13:21-27, 1967.
4. Dasarathy, B.V., “Nearest-Neighbor Classification Techniques”. IEEE Computer Society Press, Los Alomitos, CA, 1991.
5. Morin, R.L. and D.E. Raeside, “A Reappraisal of Distance-Weighted k-Nearest Neighbor Classification for Pattern Recognition with Missing Data”, IEEE Transactions on Systems, Man, and Cybernetics, Vol. SMC-11 (3), pp. 241-243, 1981.
6. William Perrizo, “Peano Count Tree Technology”, Technical Report NDSU-CSOR-TR-01-1, 2001.
7. Jiawei Han, Micheline Kamber, “Data Mining: Concepts and Techniques”, Morgan Kaufmann, 2001.
8. M. James, “Classification Algorithms”, New York: John Wiley & Sons, 1985.
9. William Perrizo, Qin Ding, Qiang Ding and Amalendu Roy, “On Mining Satellite and Other Remotely Sensed Images”, DMKD 2001, pp. 33-40.
10. William Perrizo, Qin Ding, Qiang Ding and Amalendu Roy, “Deriving High Confidence Rules from Spatial Data using Peano Count Trees”, Springer-Verlag, Lecturer Notes in Computer Science 2118, July 2001.
11. Qin Ding, Maleq Khan, Amalendu Roy and William Perrizo, “The P-tree Algebra”, proceedings of the ACM Symposium on Applied Computing (SAC’02), 2002.