Dimensionality reduction using magnitude and shape approximations

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2003, Pages 99-107

  Ogras, Ümit Y ^a   Ferhatosmanoglu, Hakan ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

High Dimensional Data; Shape Approximation; Similarity Search

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA REDUCTION; DATABASE SYSTEMS; DISCRETE FOURIER TRANSFORMS; QUERY LANGUAGES; REDUCTION; VECTORS; WAVELET TRANSFORMS;

EUCLIDIAN DISTANCE; HIGH DIMENSIONAL DATA; SHAPE APPROXIMATION; SIMILARITY SEARCH;

IMAGE COMPRESSION;

EID: 18744370476     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/956880.956883     Document Type: Conference Paper

References (43)

1. A. Acharya, M. Uysal, and J. Saltz. Active disks: Programming model, algorithms and evaluation. In ASPLOS-VIII, pages 81-91, September 1998.
2. R. Agrawal, C. Faloutsos, and A. Swami. Efficient similarity search in sequence databases. In 4th Int. Conference on Foundations of Data Organization and Algorithms, pages 69-84, 1993.
3. A. Baruffolo. R-trees for astronomical data indexing. ASP Conf. Ser., Astronomical Data Analysis Software and Systems VIII, 172:375, 1999.
4. S. Berchtold, C. Bohm, D. Keim, and H. Kriegel. A cost model for nearest neighbor search in high-dimensional data space. In Proc. ACM Symp. on Principles of Database Systems, pages 78-86, Tuscon, Arizona, June 1997.
5. S. Berchtold, D. Keim, and H. Kriegel. The X-tree: An index structure for high-dimensional data. In Proceedings of the Int. Conf. on Very Large Data Bases, pages 28-39, Bombay, India, 1996.
6. S. Berchtold and H.-P. Kriegel. S3: Similarity search in CAD database systems. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 564-567, Tuscon, Arizona, 1997.
7. P. Bernstein, M. Brodie, S. Ceri, D. DeWitt, M. Franklin, H. Garcia-Molina, J. Gray, J. Held, J. Hellerstein, H. Jagadish, M. Lesk, D. Maier, J. Naughton, H. Pirahesh, M. Stonebraker, and J. Ullman. The Asilomar report on database research. ACM Sigmod Record, 27(4), December 1998.
8. D. A. Keim C. Bohm, S. Berchtold. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Surveys, 33:322-373, 2001.
9. K. R. Castleman. Digital Image Processing. Prentice-Hall, Inc., 1996.
10. K. Chakrabarti and S. Mehrotra. The hybrid tree: An index structure for high dimensional feature spaces. In Proc. Int. Conf. Data Engineering, pages 440-447, Sydney, Australia, 1999.
11. S. Deerwester, S.T. Dumais, G.W.Furnas, T.K. Launder, and R. Harshman. Indexing by latent semantic analysis. Journal of the American Society for Information Science, 41:391-407, 1990.
12. D.Hull. Improving text retrieval for the routing problem using latent semantic indexing. In Proc. of the 17th ACM-SIGIR Conference, pages 282-291, 1994.
13. S. T. Dumais. Improving the retrieval of information from external sources. Behavior Research Methods, Instruments and Computers, 23:229-236, 1991.
14. O. Egecioglu. Parametric approximation algorithms for high-dimensional euclidean similarity. In Proc. of the 5-th European Conference on Principles of Data Mining and Knowledge Discovery (PKDD 2001), pages 79-90, September 2001.
15. O. Egecioglu and H. Ferhatosmanoglu. Dimensionality reduction and similarity distance computation by inner product approximations. In Proceedings of the 9th ACM Int. Conf. on Information and Knowledge Management, pages 219-226, McLean, Virginia, November 2000.
16. Ö. Eǧecioǧlu. How to approximate the inner-product:fast dynamic algorithms for euclidean similarity. Technical Report TRCS98-37, Comp. Sci. Dept., UC, Santa Barbara, December 1998.
17. C. Faloutsos, R. Barber, M. Flickner, J. Hafner, W. Niblack, D. Petkovic, and W. Equitz. Efficient and effective querying by image content. Journal of Intelligent Information Systems, 3:231-262, 1994.
18. C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 419-429, Minneapolis, May 1994.
19. H. Ferhatosmanoglu, D. Agrawal, and A. El Abbadi. Optimal partitioning for efficient I/O in spatial databases. In Proc. of the European Conference on Parallel Computing (Euro-Par), Manchester, UK, August 2001.
20. H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A. El Abbadi. Approximate nearest neighbor searching in multimedia databases. In Proc of 17th IEEE Int. Conf. on Data Engineering (ICDE), pages 503-511, Heidelberg, Germany, April 2001.
21. V. Gaede and O. Gunther. Multidimensional access methods. ACM Computing Surveys, 30:170-231, 1998.
22. A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In Proceedings of the Int. Conf. on Very Large Data Bases, pages 518-529, Edinburgh, Scotland, UK, September 1999.
23. Informix, http://www.ibm.com/software/data/informix/blades/spatial/rtree. html, 2002.
24. N. S. Jayant and P. Noll. Digital Coding of Waveforms. Prentice-Hall, Inc., 1984.
25. T. Kailath. Modern Signal Processing. Springer Verlag, 1985.
26. K. V. R. Kanth, D. Agrawal, and A. Singh. Dimensionality reduction for similarity searching in dynamic databases. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 166-176, Seattle, Washington, June 1998.
27. K. V. R. Kanth, S. Ravada, and D. Abugov. Quadtree and r-tree indexes in oracle spatial: A comparison using gis data. In Proc. ACM SIGMOD Int. Conf. on Management of Data, Madison, Wisconsin, June 2002.
28. H. Karhunen. Uber lineare methoden in der wahrscheinlich-keitsrechnung. Ann. Acad. Science Fenn, 1947.
29. N. Katayama and S. Satoh. The sr-tree: an index structure for high-dimensional nearest neighbor queries. In Proceedings of the ACM SIGMOD international conference on Management of data, pages 369-380, Tucson, Arizona, May 1997.
30. E. J. Keogh, K. Chakrabarti, S. Mehrotra, and M. J. Pazzani. Locally adaptive dimensionality reduction for indexing large time series databases. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 151-162, Santa Barbara, CA, 2001. ACM.
31. F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas. Fast nearest neighbor search in medical image databases. In Proceedings of the Int. Conf. on Very Large Data Bases, pages 215-226, Mumbai, India, 1996.
32. K. Lin, H. V. Jagadish, and C. Faloutsos. The TV-tree: An index structure for high-dimensional data. VLDB Journal, 3:517-542, 1995.
33. M. Loeve. Fonctions aleatoires de seconde ordre. Processus Stochastiques et Mouvement Brownien, 1948.
34. W. Niblack, R. Barber, W. Equitz, M. Flickner, E. Glasman, D. Petkovic, and P. Yanker. The QBIC project: Querying images by content using color, texture and shape. In Proc. of the SPIE Conf. 1908 on Storage and Retrieval for Image and Video Databases, volume 1908, pages 173-187, February 1993.
35. A. V. Oppenheim and R. W. Schafer. Discrete-Time Signal Processing. Prentice-Hall, Inc., 1989.
36. H. Samet. The Design and Analysis of Spatial Structures. Addison Wesley Publishing Company, Inc., Massachusetts, 1989.
37. T. Seidl and Kriegel H.-P. Efficient user-adaptable similarity search in large multimedia databases. In Proceedings of the Int. Conf. on Very Large Data Bases, pages 506-515, Athens, Greece, 1997.
38. T. Seidl and H.P. Kriegel. Optimal multi-step k-nearest neighbor search. In Proc. ACM SIGMOD Int. Conf. on Management of Data, Chicago, Illinois, U.S.A., June 1998. ACM.
39. V.S. Subrahmanian. Principles of Multimedia Database Systems. Morgan Kaufmann Publishers, Inc., San Francisco, California, 1999.
40. M. Vlachos, C. Domeniconi, D. Gunopulos, G. Kollios, N. Koudas, and H. D. Schwetman. Non-linear dimensionality reduction techniques for classification and visualization. In The Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Edmonton, Canada, July 2002.
41. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proceedings of the Int. Conf. on Very Large Data Bases, pages 194-205, New York City, New York, August 1998.
42. A. J. Wicenec and M. Albrecht. Methods for structuring and searching very large catalogs. ASP Conf. Ser., Astronomical Data Analysis Software and Systems VII, 145:512, 1998.
43. D. Wu, D. Agrawal, A. El Abbadi, and T. R. Smith. Efficient retrieval for browsing large image databases. In Proc. Conf. on Information and Knowledge Management, pages 11-18, November 1996.