Theoretical analysis of case retrieval method based on neighborhood of a new problem

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

Volumn 1266, Issue , 1997, Pages 349-358

  Okamoto, Seishi ^a   Yugami, Nobuhiro ^a  

^a FUJITSU LABORATORIES LTD   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

INTELLIGENT SYSTEMS; MEMBERSHIP FUNCTIONS; MONTE CARLO METHODS; MOTION COMPENSATION; NEAREST NEIGHBOR SEARCH; TEXT PROCESSING;

AVERAGE-CASE ANALYSIS; CASE RETRIEVAL; CLASSIFICATION ACCURACY; FORMAL ANALYSIS; K-NEAREST NEIGHBOR METHOD; K-NEAREST NEIGHBORS; NEAREST NEIGHBORHOOD; TARGET CONCEPT;

CASE BASED REASONING;

EID: 84957545320     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63233-6_505     Document Type: Conference Paper

References (13)

1. Aha, D., Kibler, D., and Albert, M. Instance-Based Learning Algorithms. Machine Learning, 6, (1991) 37-66.
2. Albert, M. and Aha, D. Analyses of Instance-Based Learning Algorithms. In Proceedings of AAAI-91, (1991) 553-558. AAAI Press/MIT Press.
3. Cover, T. and Hart, P. Nearest Neighbor Pattern Classification. IEEE Transactions on Information Theory, 13(1), (1967) 21-27.
4. Creecy, H., Masand, M., Smith, J., and Waltz, D. Trading Mips and Memory for Knowledge Engineering. Communications of the ACM, 35(8), (1992) 48-63.
5. Drakopoulos, J. Bounds on the Classification Error of the Nearest Neighbor Rule. In Proceedings of ICML-95, (1995) 203-208. Morgan Kaufmann.
6. Langley, P. and Iba, W. Average-Case Analysis of a Nearest Neighbor Algorithm. In Proceedings of IJCAI-93, (1993) 889-894. Morgan Kaufmann.
7. Murphy. P. and Pazzani, M. ID2-of-3: Constructive Induction of M-of-N Concepts for Discriminators in Decision Trees. In Proceedings of IWML-91, (1991) 183-187. Morgan Kaufmann.
8. O’Callaghan, J. P. An Alternative Definition for Neighborhood of a Point, IEEE Transactions on Computers, 24(11), (1975) 1121-1125.
9. Okamoto, S. and Satoh, K. An Average-Case Analysis of k-Nearest Neighbor Classifier. In Proceedings of ICCBR-95 (Veloso. M. And Aamodt, A. Eds., LNAI, 1010), (1995) 243-264. Springer-Verlag.
10. Okamoto, S. and Yugami, N. Theoretical Analysis of the Nearest Neighbor Classifier in Noisy Domains. In Proceedings of ICML-96 (1996) 355-363. Morgan Kaufmann.
11. Okamoto, S. and Yugami, N. An Average-Case Analysis of the k-Nearest Neighbor Classifier for Noisy Domains. In Proceedings of IJCAI-97, (1997) to appear. Morgan Kaufmann.
12. Pazzani, M. and Sarrett, W. A Framework for Average Case Analysis of Conjunctive Learning Algorithms. Machine Learning, 9 (1992) 349-372.
13. Wettschereck, D. and Aha, D. Weighting Features. In Proceedings of ICCBR-95 (Veloso, M. and Aamodt, A. Eds., LNAI, 1010), (1995) 347-358. Springer-Verlag.