Assessment of four modifications of a novel indexing technique for case-based reasoning

International Journal of Intelligent Systems

Volumn 22, Issue 4, 2007, Pages 353-383

  Galushka, Mykola ^a   Patterson, David ^a   Nugent, Christopher ^a  

^a UNIVERSITY OF ULSTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); INDEXING (OF INFORMATION); INFORMATION ANALYSIS; KNOWLEDGE ENGINEERING; REGRESSION ANALYSIS;

DISCRETIZATION APPROACH; DISCRETIZED ATTRIBUTE VALUES; KNOWLEDGE MAINTENANCE;

CASE BASED REASONING;

EID: 33947573317     PISSN: 08848173     EISSN: 1098111X     Source Type: Journal    
DOI: 10.1002/int.20202     Document Type: Article

References (29)

1. Aamodt A, Plaza E. Case-based reasoning: Foundational issues, methodological variations, and system approaches. AI Commun 1994;7:39-59.
2. Wettschereck D, Aha D, Mohri T. A review of empirical evaluation of feature weighting methods for a class of lazy learning algorithms. Artif Intell Rev J 1997;11:273-314.
3. Cost S, Salzberg S. Neighbour algorithm for learning with symbolic features. Mach Learn 1993;10:57-78.
4. Anand S, Patterson D, Hughes J. Knowledge intensive exception spaces. In: Proc 14th National Conf on Artificial Intelligence; 1998. pp 574-579.
5. Patterson D, Anand S, Dubitzky D, Hughes J. A knowledge light approach to similarity maintenance for improving case-based competence In: Proc 14th European Conf on Artificial Intelligence, Workshop on Flexible Strategies for Maintaining Knowledge Containers; 2000. pp 65-77.
6. Stanfill C, Waltz D. Towards memory-based reasoning. Commun ACM 1986;29:1213-1228.
7. Smyth B, Cunningham P. The utility problem analysed: A case-based reasoning perspective. In: Proc Third European Workshop on Case-Based Reasoning, Lausanne, Switzerland; 1996. pp 392-399.
8. Bentley J. Multidimensional binary search trees used for associative searching. Commun ACM 1975; 18:509-517.
9. Bentley J, Friedman J. Data structures for range searching. ACM Comput Surv 1979;11:397-409.
10. Tamminen M. Comment on quad- and octtrees. Commun ACM 1984;27:248-249.
11. Fuchs H, Kedem Z, Naylor B. On visible surface generation by a priori tree structures. Proc 7th Annual Conf on Computer Graphics and Interactive Techniques. New York: ACM Press; 1980. pp 124-133.
12. Fuchs H, Abram G, Grant E. Near real-time shaded display of rigid objects. In: Proc 10th Annual Conf on Computer Graphics and Interactive Techniques. New York: ACM Press; 1983. pp 65-72.
13. Guttman A. R-trees: A dynamic index structure for spatial searching. In: Proc ACM SIGMOD Int Conf on Management of Data. New York: ACM Press; 1984. pp 47-57.
14. Otterman M. Approximate matching with high dimensionality R-trees. M.S. scholarly paper. College Park, MD: Department of Computer Science, University of Maryland; 1992.
15. Berchtold S, Keim D, Kriegel HP. The X-tree: An index structure for high-dimensional data. In: Proc 22th Int Conf on Very Large Data Bases. San Francisco, CA: Morgan Kaufmann; 1996. pp 28-39.
16. Katayama N, Satoh S. The SR-tree: An index structure for high-dimensional nearest neighbor queries. In: Proc ACM SIGMOD Int Conf on Management of Data. New York: ACM Press; 1997. pp 369-380.
17. Lin K, Jagadish H, Faloutsos C. The TV-tree: An index structure for high-dimensional data. VLDB J 1994;3:517-542.
18. Aggarwa C, Yu P. The IGrid index: Reversing the dimensionality curse for similarity indexing in high dimensional space. In: Proc Sixth ACM SIGKDD Int Conf on Knowledge Discovery and Data Mining. New York: ACM Press; 2000. pp 119-129.
19. Quinlin J. C4.5 programs for machine learning. San Meteo, CA: Morgan Kauffman; 1993.
20. Altoff K, Auriol E, Barletta R, Manago M. A review of industrial case-based reasoning tools. Oxford, UK: AI Intelligence; 2004.
21. Deangdej J, Lukose D, Tsui E, Beinat P, Prophet L. Dynamically creating indices for two million cases: A real world problem. In: Smith I, Faltings B, editors. Advances in case-based reasoning. Lecture Notes in Artificial Intelligence. Berlin: Springer Verlag; 1996. pp 105-119.
22. Fox S, Leake D. Using introspective reasoning to refine indexing. In: Proce 14th Int Joint Conf on Artificial Intelligence, Montreal, Canada; 1995. pp 391-397.
23. Zhang Z, Yang Q. Towards lifetime maintenance of case base indexes for continual case-based reasoning. In: Proc Eighth Int Conf on Artificial Intelligence: Methodology, Systems, Applications, Sozopol, Bulgaria; 1998. pp 489-500.
24. Smyth B, McKenna E. Footprint-based retrieval. Proc Third Int Conf on Case-Based Reasoning, Munich, Germany; 1999. pp 343-357.
25. Lenz M, Burkhard H-D, Brückner S. Applying case retrieval nets to diagnostic tasks in technical domains. In: Smith I, Faltings B, editors. Proc Third European Workshop on Advances in Case-Based Reasoning. Lecture Notes in Computer Science 1168. London, UK: Springer-Verlag; 1996. pp 219-233.
26. Patterson D, Rooney N, Galushka M. Towards dynamic maintenance of retrieval knowledge in CBR. In: Proc 15th Int FLAIRS Conf. Menlo Park, CA: AAAI Press; 2002. pp 126-131.
27. Patterson D, Rooney N, Galushka M. Efficient similarity determination and case construction techniques for case-based reasoning. In: Proc Fourth European Conf on CBR; 2002. pp 292-305.
28. Fayyad U, Irani K. Multi-interval discretization of continuous-valued attributes for classification learning. In: Proc Int Joint Conf on Artificial Intelligence, San Francisco, CA: Morgan Kaufmann; 1993. pp 1022-1027.
29. Blake C, Merz C. UCI repository of machine learning databases. Irvine, CA: University of California, Department of Information and Computer Science; 2004. Available at: http://www.ics.uci.edu/~mlearn/MLRepository.html.