Investigating the potential of ART neural network models for indexing and information retrieval

International Journal of Intelligent Systems

Volumn 22, Issue 4, 2007, Pages 319-336

  Romero, Roseli A F ^a   Vicentini, José F ^a   Oliveira, Patricia R ^a   Traina, Agma M J ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; DATA STRUCTURES; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; INFORMATION RETRIEVAL SYSTEMS; QUERY LANGUAGES;

K-NEAREST NEIGHBOR; NONDIMENSIONAL DATA; SLIM TREE DATA STRUCTURE;

NEURAL NETWORKS;

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

References (41)

1. Samet H. Spatial data structures. In: Kim W, editor. Modern database systems. Reading, MA: Addison-Wesley/ACM; 1995.
2. Gaede V, Günther O. Multidimensional access methods. ACM Comput Surv 1998;30:170-231.
3. Guttman A. R-tree: A dynamic index structure for spatial searching. In: ACM Int Conf on Data Management (SIGMOD), Boston, MA; 1984. pp 47-57.
4. Chávez E, Navarro G, Baeza-Yates R, Marroquín JL. Proximity searching in metric spaces. ACM Comput Surv 2001;33:273-321.
5. Burkhard WA, Keller RM. Some approaches to best-match file searching. Commun ACM 1973;16:230-236.
6. Baeza-Yates RA, Cunto W, Manber U, Wu S. Proximity matching using fixed-queries trees. In: Proc Fifth Annual Symp on Combinatorial Pattern Matching, Asilomar, CA; 1994. pp 198-212.
7. Chiueh T. Content-based image indexing. In: Proc 20th Int Conf on Very Large Databases, Santiago, Chile; 1994. pp 582-593.
8. Brin S. Near neighbor search in large metric spaces. In: Proc 21st Int Conf on Very Large Data Bases, Zurich, Switzerland; 1995. pp 574-584.
9. Bozkaya T, Ozsoyoglu M. Distance-based indexing for high-dimensional metric spaces. In: Proc 1997 ACM SIGMOD Int Conf on Management of Data, Tucson, Arizona; 1997. pp 357-368.
10. Traina C Jr, Traina AJM, Seeger B, Faloutsos C. Slim-trees: High performance metric trees minimizing overlap between nodes. In: Proc Sixth Int Conf on Extending Database Technology, Konstanz, Germany; 2000. pp 51-65.
11. Laaksonen J, Koskela M, Oja E. PicSOM: Self-organizing maps for content-based image retrieval. In: Proc Int Joint Conf on Neural Networks (IJCNN'99), Washington, DC; 1999. pp 2470-2473.
12. Aghbari Z, Oh KS, Feng Y, Makinouchi A. Som-based k-nearest neighbors search in large databases. In: Proc Sixth Working Conf on Visual Database Systems, Brisbane, Australia; 2002. pp 51-65.
13. Romero RAF, Cuadros-Vargas E. Introduction to the SAM-SOM* and MAM-SOM* families. In Proc Int Joint Conf on Neural Networks, IEEE IJCNN 2005. Piscataway, NJ: IEEE Press; 2005. pp 2966-2970.
14. Haykin S. Neural networks - A comprehensive foundation. New York: Macmillan and IEEE Press; 1994.
15. Kohonen T. Self-organizing maps, 3rd ed. New York: Springer; 2000.
16. Carpenter GA, Grossberg S. A massively parallel architecture for a self-organizing neural pattern recognition machine. Comput Vis Graph Image Process 1987;37:54-115.
17. Carpenter GA, Grossberg S. Art 2: Self-organization of stable category recognition codes for analog input patterns. Appl Optic 1987;26:4919-4930.
18. Carpenter GA, Grossberg S, Rosen DB. ART2-A: An adaptive resonance algorithm for rapid category learning and recognition. Neural Netw 1991;4:493-504.
19. Carpenter GA, Grossberg S, Rosen DB. Fuzzy ART: Fast stable learning and categorization of analog patterns by an adaptive resonance system. Neural Netw 1991;4:759-771.
20. Carpenter GA, Grossberg S. Adaptive resonance theory ART. In: Arbib MA, editor. The handbook of brain theory and neural networks. Cambridge, MA: MIT Press; 1995. pp 79-82.
21. Carpenter GA, Grossberg S, Reynolds S. Artmap: Supervised real-time learning and classification of nonstationary data by a self-organizing neural network. Neural Netw 1991;4:565-588.
22. Carpenter GA, Grossberg S, Markuzon N, Reynolds JH, Rosen DB. Fuzzy ARTMAP: A neural network architecture for incremental supervised learning of analog multidimensional maps. IEEE Trans Neural Netw 1992;3:698-713.
23. Williamson JR. Gaussian artmap: A neural network for fast incremental learning of noisy multidimensional maps. Neural Netw 1996;9:881-897.
24. Blake CL, Merz CJ. UCI repository of machine learning databases. University of California, Irvine, Department of Information and Computer Sciences; 1998. Available at: http://www.ics.uci.edu/~mlearn/MLRepository.html.
25. Swets JA. Measuring the accuracy of diagnostic system. Science 1988;240:1285-1293.
26. Hussain TS. ARTSTAR: A supervised modular adaptive resonance network classifier. Master's thesis. Kingston, Ontario, Canada: Queen's University; 1993.
27. Peper F, Zhang B, Noda H. A comparative study of ART2-A and the self-organizing feature map. In: Proc 1993 Int Joint Conf on Neural Networks (IJCNN'93), vol 2, Nagoya, Japan; 1993. pp 1425-1429.
28. Fausset L. Fundamentals of neural networks: Architectures, algorithms, and applications. Englewood Cliffs, NJ: Prentice Hall; 1994.
29. Upal MA, Neufeld EM. Comparison of unsupervised classifiers. In: Proc First Int Conf on Information, Statistics and Induction in Science (ISIS), Singapore; 1996. pp 342-353.
30. Frank T, Kraiss KF, Kuhlen T. Comparative analysis of Fuzzy ART and ART2-A network clustering performance. IEEE Trans Neural Netw 1998;9:544-559.
31. Baraldi A, Alpaydin E. Constructive feedforward ART clustering networks - part I. IEEE Trans Neural Netw 2002;13:645-661.
32. Vicentini JF, Romero RAF. Utilização de redes neurais da família ART para indexação e recuperação de informações. In: Proc 4th Congress of Logic Applied to Technology (LAPTEC 2003): Proc Advances in Intelligent System and Robotics, vol 2, Marilia, São Paulo, Brazil; 2003. pp 195-202.
33. Burkhard WA, Keller RM. Some approaches to best-match file searching. Commun ACM 1973;16:230-236.
34. Baeza-Yates RA, Cunto W, Manber U, Wu S. Proximity matching using fixed-queries trees. In: 5th Annual Symp on Combinatorial Pattern Matching (CPM), Asilomar, CA. Lecture Notes in Computer Science, vol 807. Berlin: Springer Verlag; 1994. pp 198-212.
35. Brin S. Near neighbor search in large metric spaces. In: Proc Int Conf on Very Large Data Bases (VLDB), Zurich. Switzerland. San Francisco, CA: Morgan Kaufmann: 1995. pp 574-584.
36. Bozkaya T, Özsoyoglu M. Distance-based indexing for high-dimensional metric spaces. In: Proc ACM Int Conf on Management of Data (SIGMOD); 1997. pp 357-368.
37. Hjaltason GR, Samet H. Index-driven similarity search in metric spaces. ACM Trans Database Syst 2003:21:517-580.
38. Ciaccia P. Patella M, Zezula P. M-tree: An efficient access method for similarity search in metric spaces. In: Proc Int Conf on Very Large Data Bases (VLDB), Athens, Greece. San Francisco, CA: Morgan Kaufmann; 1997. pp 426-435.
39. Traina C Jr, Traina AJM, Seeger B, Faloutsos C. Slim-trees: High performance metric trees minimizing overlap between nodes. In: Proc Int Conf on Extending Database Technology (EDBT), Konstanz, Germany. Lecture Notes in Computer Science, vol 1777. Berlin: Springer Verlag; 2000. pp 51-65.
40. Chávez E, Navarro G, Baeza-Yates R, Marroquín JL. The ubiquitous B-tree. ACM Comput Surv 1979;11:121-137.
41. Traina C Jr, Traina AJM, Faloutsos C, Seeger B. Fast indexing and visualization of metric datasets using slim-trees. IEEE Trans Knowl Data Eng 2002;14:244-260.