메뉴 건너뛰기




Volumn 16, Issue 6, 2004, Pages 714-726

Dimensionality reduction and similarity computation by inner-product approximations

Author keywords

Dimensionality reduction; High dimensional data; Inner product approximation; P NORMS, similarity search

Indexed keywords

DIMENSIONALITY REDUCTION; HIGH-DIMENSIONAL DATA; INNER-PRODUCT APPROXIMATION; P-NORMS; SIMILARITY SEARCH;

EID: 3042542203     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2004.9     Document Type: Article
Times cited : (38)

References (43)
  • 10
    • 0005287692 scopus 로고    scopus 로고
    • Local dimensionality reduction: A new approach to indexing high dimensional spaces
    • K. Chakrabarti and S. Mehrotra, "Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces," The VLDB J., pp. 89-100, 2000.
    • (2000) The VLDB J. , pp. 89-100
    • Chakrabarti, K.1    Mehrotra, S.2
  • 13
    • 0003733695 scopus 로고    scopus 로고
    • An elementary proof of the Johnson-Lindenstrauss Lemma
    • Int'l Computer Science Inst., Berkeley
    • S. Dasgupta and A. Gupta, "An Elementary Proof of the Johnson-Lindenstrauss Lemma," Technical Report TR-99-006, Int'l Computer Science Inst., Berkeley, 1999.
    • (1999) Technical Report , vol.TR-99-006
    • Dasgupta, S.1    Gupta, A.2
  • 15
    • 34447620746 scopus 로고
    • Improving text retrieval for the routing problem using latent semantic indexing
    • D. Hull, "Improving Text Retrieval for the Routing Problem Using Latent Semantic Indexing," Proc. 17th ACM-SIGIR Conf., pp. 282-291, 1994.
    • (1994) Proc. 17th ACM-SIGIR Conf. , pp. 282-291
    • Hull, D.1
  • 16
  • 17
    • 25944440338 scopus 로고    scopus 로고
    • How to approximate the inner-product: Fast dynamic algorithms for similarity
    • Dept. of Computer Science, Univ. of California at Santa Barbara, Dec.
    • Ö. Egecioglu, "How to Approximate the Inner-Product: Fast Dynamic Algorithms for Similarity," Technical Report TRCS98-37, Dept. of Computer Science, Univ. of California at Santa Barbara, Dec. 1998.
    • (1998) Technical Report , vol.TRCS98-37
    • Egecioglu, O.1
  • 30
    • 34249762939 scopus 로고
    • The TV-tree: An index structure for high-dimensional data
    • K. Lin, H.V. Jagadish, and C. Faloutsos, "The TV-Tree: An Index Structure for High-Dimensional Data," VLDB J., vol. 3, pp. 517-542, 1995.
    • (1995) VLDB J. , vol.3 , pp. 517-542
    • Lin, K.1    Jagadish, H.V.2    Faloutsos, C.3
  • 31
    • 0025625409 scopus 로고
    • The hb-Tree: A multi-attribute indexing method with good guaranteed performance
    • Dec.
    • D.B. Lomet and B. Salzberg, "The hb-Tree: A Multi-Attribute Indexing Method with Good Guaranteed Performance," ACM Trans. Database Systems, vol. 15, no. 4, pp. 625-658, Dec. 1990.
    • (1990) ACM Trans. Database Systems , vol.15 , Issue.4 , pp. 625-658
    • Lomet, D.B.1    Salzberg, B.2
  • 35
    • 85010847034 scopus 로고
    • The kdb-Tree: A search structure for large. Multi-dimensional dynamic indexes
    • J.T. Robinson, "The kdb-Tree: A Search Structure for Large. Multi-Dimensional Dynamic Indexes," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 10-18, 1981.
    • (1981) Proc. ACM SIGMOD Int'l Conf. Management of Data , pp. 10-18
    • Robinson, J.T.1
  • 36
    • 84862380762 scopus 로고    scopus 로고
    • SciDAC, Scientific data management center, http://sdm.lbl.gov/sdmcenter/, 2002.
    • (2002)
  • 37
    • 84993661650 scopus 로고    scopus 로고
    • Efficient user-adaptable similarity search in large multimedia databases
    • T. Seidl and H.-P. Kriegel, "Efficient User-Adaptable Similarity Search in Large Multimedia Databases," Proc. Int'l Conf. Very Large Data Bases, pp. 506-515, 1997.
    • (1997) Proc. Int'l Conf. Very Large Data Bases , pp. 506-515
    • Seidl, T.1    Kriegel, H.-P.2
  • 41
    • 0029752929 scopus 로고    scopus 로고
    • Similarity indexing with the SS-Tree
    • D. White and R. Jain, "Similarity Indexing with the SS-Tree," Proc. Int'l Conf. Data Eng., pp. 516-523, 1996.
    • (1996) Proc. Int'l Conf. Data Eng. , pp. 516-523
    • White, D.1    Jain, R.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.