Parametric approximation algorithms for high-dimensional euclidean similarity

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

Volumn 2168, Issue , 2001, Pages 79-90

  Eğecioğlu, Ömer ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; PARAMETER ESTIMATION; TIME SERIES; VECTOR SPACES;

CAUCHY-SCHWARZ INEQUALITY; CONVEX COMBINATIONS; EUCLIDEAN; EUCLIDEAN SPACES; HIGH-DIMENSIONAL; INNER PRODUCT; SYMMETRIC FUNCTIONS; TIME-SERIES DATA;

APPROXIMATION ALGORITHMS;

EID: 77949592943     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44794-6_7     Document Type: Conference Paper

References (19)

1. R. Agrawal, K-I. Lin, H. S. Sawhney, and K. Shim. Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases. The VLDB Journal, pp. 490–501, 1995.
2. B. Bollobas, G. Das, D. Gunopulos, and H. Mannila. Time-Series Similarity Problems and Well-Separated Geometric Sets. Proc. of 13th Annual ACMSymp osium on Computational Geometry, Nice, France, pp. 454–456, 1997.
3. R. Agrawal, C. Faloutsos, and A. Swami. Efficient similarity search in sequence databases. In 4th Int. Conference on Foundations of Data Organization and Algorithms, pp. 69–84, 1993.
4. S. Berchtold, D. Keim, and H. Kriegel. The X-tree: An index structure for highdimensional data. In Proceedings of the Int. Conf. On Very Large Data Bases, pp. 28–39, Bombay, India, 1996.
5. S. Berchtold, C. Bohm, D. Keim, and H. Kriegel. A cost model for nearest neighbour search in high-dimensional data space. In Proc. ACMSymp. on Principles of Database Systems, Tuscon, Arizona, 1997.
6. S. Deerwester, S.T. Dumais, G.W.Furnas, T.K. Launder, and R. Harshman. Indexingb y latent semantic analysis. Journal of the American Society for Information Science, 41:391–407, 1990.
7. Ö. Eğecioğlu. How to approximate the inner-product: fast dynamic algorithms for Euclidean similarity. Technical Report TRCS98-37, Department of Computer Science, University of California at Santa Barbara, December 1998.
8. Ö. Eğecioğlu and H. Ferhatosmanoğlu, Dimensionality reduction and similarity computation by inner product approximations. Proc. 9th Int. Conf. On Information and Knowledge Management (CIKM’00), Nov. 2000, Washington DC.
9. V. Estivill-Castro and D. Wood. A Survey of Adaptive SortingAlg orithms. ACM Computing Surveys, Vol. 24, No. 4, pp. 441–476, 1992.
10. 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.
11. A. Guttman. R-trees: A dynamic index structure for spatial searching. In Proc. ACM SIGMOD Int. Conf. On Management of Data, pp. 47–57, 1984.
12. N.A.J. Hastings and J.B. Peacock. Statistical Distributions, Halsted Press, New York, 1975.
13. D. Hull. Improvingtext retrieval for the routingproblem usinglaten t semantic indexing. In Proc. of the 17th ACM-SIGIR Conference, pp. 282–291, 1994.
14. J. E. Humphreys. Reflection Groups and Coxeter Groups, Cambridge Studies in Advanced Mathematics, No. 29, Cambridge Univ. Press, Cambridge, 1990.
15. D. Knuth. The art of computer programming(Vol. III), Addison-Wesley, Reading, MA, 1973.
16. Korn F., Sidiropoulos N., Faloutsos C., Siegel E., and Protopapas Z. 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.
17. C-S. Perng, H. Wang, S. R. Zhang, and D. S. Parker. Landmarks: a new model for similarity-basedpattern queryingin time-series databases. Proc. of the 16-th ICDE, San Diego, CA, 2000.
18. 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.
19. D. White and R. Jain. Similarity indexingwith the SS-tree. In Proc. Int. Conf. Data Engineering, pp. 516–523, 1996.