FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets

ACM SIGMOD Record

Volumn 24, Issue 2, 1995, Pages 163-174

  Faloutsos, Christos ^a   Lin, King Ip David ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976803260     PISSN: 01635808     EISSN: N/A     Source Type: Journal    
DOI: 10.1145/568271.223812     Document Type: Article

References (55)

1. Rakesh Agrawal, Christos Faloutsos, and Arun Swami, Efficient similarity search in sequence databases. In Foundations of Data Organization and Algorithms (FODO) Conference, Evanston, Illinois, October 1993. also available through anonymous ftp, from olym-pos.cs.umd.edu: ftp/pub/TechReports/fodo.ps.
2. Rakesh Agrawal, Tomasz Imielinski, and Arun Swami. Mining association rules between sets of items in large databases. Proc. ACM SIGMOD, pages 207–216, May 1993.
3. Rakesh Agrawal and Ramakrishnan Srikant. Fast algorithms for mining association rules in large databases. Proc. of VLDB Conf., pages 487–499, September 1994.
4. S.F. Altschul, W. Gish, W. Miller, E.W. Myers, and D.J. Lipman. A basic local alignment search tool. Journal of Molecular Biology, 215(3):403-410, 1990.
5. Manish Arya, William Cody, Christos Faloutsos, Joel Richardson, and Arthur Toga. Qbism: a prototype 3-d medical image database system. IEEE Data Engineering Bulletin, 16(1):38-42, March 1993.
6. Ricardo A. Baeza-Yates, Walter Cunto, Udi Manber, and Sun Wu. Proximity matching using fixed queries trees. In M. Crochemore and D. Gusheld, editors, 5th Combinatorial Patters Matching, LNCS 807, pages 198–212. Springer-Verlag, Asilomar, CA, June 1994.
7. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The r*-tree: an efficient and robust access method for points and rectangles. A CM SIGMOD, pages 322–331, May 1990.
8. Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger. Multi-step processing of spatial joins. ACM SIGMOD, pages 197–208, May 1994.
9. Thomas Brinkhoff, Hans-Peter Kriegel, and Bernhard Seeger. Efficient processing of spatial joins using r-trees. Proc. of ACM SIGMOD, pages 237–246, May 1993.
10. [10] W.A. Burkhard and R.M. Keller. Some approaches to best-match file searching. Comm, of the ACM (CACM), 16(4):230-236, April 1973.
11. Mathematical Committee on Physical and NSF Engineering Sciences. Grand Challenges: High Performance Computing and Communications. National Science Foundation, 1992. The FY 1992 U.S. Research and Development Program.
12. R.O. Duda and P.E. Hart. Pattern Classification and Scene Analysis. Wiley, New York, 1973.
13. Susan T. Dumais. Latent semantic indexing (LSI) and TREC-2. In D. K. Harman, editor, The Second Text Retrieval Conference (TREC-2), pages 105–115, Gaithersburg, MD, March 1994. NIST. Special Publication 500–215.
14. C. Faloutsos and S. Roseman. Fractals for secondary key retrieval. Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pages 247–252, March 1989. also available as UMIACS-TR-89-47 and CS-TR-2242.
15. Christos Faloutsos and King-Ip (David) Lin. Fastmap; a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. Cs-tr-3383 umiacs-tr-94-132 isr tr 94–80, Dept, of Computer Science, Univ. of Maryland, College Park, 1994. also available from mosaic (URL ftp: //olympos.cs.umd.edu /pub/TechReports /sigmod95.ps).
16. Peter W. Foltz and Susan T. Dumais. Personalized information delivery: an analysis of information filtering methods. Comm. of ACM (CACM) 35(12):51—60, December 1992.
17. Keinosuke Fukunaga. Introduction to Statistical Pattern Recognition. Academic Press, 1990. 2nd Edition.
18. I. Gargantini. An effective way to represent quadtrees. Comm, of ACM (CACM), 25(12):905-910, December 1982.
19. G. H. Golub and C. F. Van Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore, second edition, 1989.
20. A. Guttman. R-trees: a dynamic index structure for spatial searching. Proc. ACM SIGMOD, pages 47–57, June 1984.
21. John A. Hartigan. Clustering Algorithms. John Wiley & Sons, 1975.
22. K. Hinrichs and J. Nievergelt. The grid file: a data structure to support proximity queries on spatial objects. Proc. of the WGy8S (Intern. Workshop on Graph Theoretic Concepts in Computer Science), pages 100–113, 1983.
23. H.V. Jagadish. Linear clustering of objects with multiple attributes. ACM SIGMOD Conf., pages 332–342, May 1990.
24. H.V. Jagadish. Spatial search with polyhedra. Proc. Sixth IEEE Int7 Conf. on Data Engineering, February 1990.
25. [25] H.V. Jagadish. A retrieval technique for similar shapes. Proc. ACM SIQMOD Confpages 208–217, May 1991.
26. Mark A. Jones, Guy A. Story, and Bruce W. Ballard. Integrating multiple knowledge sources in a bayesian ocr post-processor. In First International Conference on Document Analysis and Recognition, Saint-Malo, France, September 1991. to appear.
27. Ibrahim Kamel and Christos Faloutsos. Hilbert r-tree: an improved r-tree using fractals. In Proc. of VLDB Conference,, pages 500–509, Santiago, Chile, September 1994.
28. Joseph B. Kruskal. Nonmetric multidimensional scaling. Psychometrika, 29:1-27, 1964.
29. Joseph B. Kruskal and Myron Wish. Multidimensional scaling. SAGE publications, Beverly Hills, 1978.
30. Karen Kukich. Techniques for automatically correcting words in text. ACM Computing Surveys, 24(4):377-440, December 1992.
31. David B. Lomet and Betty Salzberg. The hb-tree: a multiattribute indexing method with good guaranteed performance. ACM TODS, 15(4):625-658, December 1990.
32. F. Murtagh. A survey of recent advances in hierarchical clustering algorithms. The Computer Journal, 26(4):354-359, 1983.
33. A. Desai Narasimhalu and Stavros Christodoulakis. Multimedia information systems: the unfolding of a reality. IEEE Computer, 24(10):6-8, October 1991.
34. Raymond T. Ng and Jiawei Han. Efficient and effective clustering methods for spatial data mining. Proc. of VLDB Conf., pages 144–155, September 1994.
35. Wayne Niblack, Ron Barber, Will Equitz, Myron Flickner, Eduardo Glasman, Dragutin Petkovic, Peter Yanker, Christos Faloutsos, and Gabriel Taubin. The QBIC project: Querying images by content using color, texture and shape. SPIE 1993 Inti. Symposium on Electronic Imaging: Science and Technology, Conf. 1908f Storage and Retrieval for Image and Video Databases, February 1993. Also available as IBM Research Report RJ 9203 (81511), Feb. 1, 1993, Computer Science.
36. J. Nievergelt, H. Hinterberger, and K.C. Sevcik. The grid file: an adaptable, symmetric multikey file structure. ACM TODS, 9(1):38—71 7 March 1984.
37. J. Orenstein. Spatial query processing in an object-oriented database system. Proc. ACM SIGMOD, pages 326–336, May 1986.
38. J.A. Orenstein. A comparison of spatial query processing techniques for native and parameter spaces. Proc. of ACM SIGMOD Conf., pages 343–352, 1990.
39. William H. Press, Brian P. Flannery, Saul A. Teukolsky, and William T. Vetterling. Numerical Recipes in C. Cambridge University Press, 1988.
40. A. Ravishankar Rao and Jerry Lohse. Identifying high level features of texture perception. In SPIE Conference, San Jose, February 1992.
41. [41] A. Kimball Romney, Roger N. Shepard, and Sara Beth Nerlove. Multidimensional scaling: Theory and applications in the behavioral sciences : vol II - Applications. Seminar Press, New York, 1972.
42. Nick Roussopoulos, Steve Kelley, and F. Vincent. Nearest neighbor queries. In Proc. of the 1995 ACM-SIGMOD Conference, San Jose, CA, May 1995. to appear.
43. G. Salton and M.J. McGill. Introduction to Modern Information Retrieval McGraw-Hill, 1983.
44. David Sankoff and Joseph B. Kruskal. Time Warps, String Edits and Macromolecules: the Theory and Practice of Sequence Comparisons. Addison-Wesley Publishing Company, Inc., Reading, MA, 1983.
45. T. Sellis, N. Roussopoulos, and C. Faloutsos. The r-f tree: a dynamic index for multi-dimensional objects. In Proc. 13th International Conference on VLDB, pages 507–518, England,, September 1987, also available as SRC-TR-87-32, UMIACS-TR-87-3, CS-TR-1795.
46. M. Shapiro, The choice of reference points in best-match file searching. Comm, of the ACM (CACM), 20(5):339-343, maya 1977.
47. Dennis Shasha and Tsong-Li Wang. New techniques for best-match retrieval. ACM TOIS, 8(2): 140–158, April 1990.
48. R. N. Shepard. The analysis of proximities: Multidimensional scaling with an unknown distance i and ii. Psychometrika, 27:125-140, 219–246, 1962.
49. Gilbert Strang. Linear Algebra and its Applications. Academic Press, 1980. 2nd edition.
50. A.W. Toga, P.K. Banerjee, and E.M. Santori. Warping 3d models for interbrain comparisons. Neurosc. Abs., 16:247, 1990.
51. W. S. Torgerson. Multidimensional scaling: I. theory and method. Psychometrika, 17:401-419, 1952.
52. C.J. Van-Rijsbergen. Information Retrieval Butterworths, London, England, 1979. 2nd edition.
53. Dimitris Vassiliadis. The input-state space approach to the prediction of auroral geomagnetic activity from solar wind variables. Int. Workshop on Applications of Artificial Intelligence in Solar Terrestrial Physics, September 1993.
54. Stephen Wolfram. Mathematica. Addison Wesley, 1991. Second Edition.
55. Forrest W. Young. Multidimensional scaling: History, Theory and Applications. Lawrence Erlbaum associates, Hillsdale, New Jersey, 1987.