메뉴 건너뛰기




Volumn , Issue , 2005, Pages 533-540

ERkNN: Efficient Reverse k-Nearest Neighbors retrieval with local kNN-distance estimation

Author keywords

KNN distance estimation; Reverse k nearest neighbours

Indexed keywords

KNN DISTANCE ESTIMATION; PROFILE-BASED MARKETING; REVERSE K-NEAREST NEIGHBOURS (RKNN);

EID: 33745867324     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (17)

References (18)
  • 1
    • 84858924631 scopus 로고    scopus 로고
    • http://kdd.ics.uci.edu/.
  • 2
    • 84858923001 scopus 로고    scopus 로고
    • http://s2k-ftp.cs.berkeley.edu:8000/sequoia/benchmark/.
  • 3
    • 0039301636 scopus 로고    scopus 로고
    • A cost model for query processing in high dimensional data spaces
    • C. Böhm. A cost model for query processing in high dimensional data spaces. TODS, 25(2): 129-178, 2000.
    • (2000) TODS , vol.25 , Issue.2 , pp. 129-178
    • Böhm, C.1
  • 4
    • 0038670812 scopus 로고    scopus 로고
    • Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases
    • C. Böhm, S. Berchtold, and D. Keim. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Surveys, 33(3):322-373, 2001.
    • (2001) ACM Computing Surveys , vol.33 , Issue.3 , pp. 322-373
    • Böhm, C.1    Berchtold, S.2    Keim, D.3
  • 8
    • 0035020719 scopus 로고    scopus 로고
    • Distinctiveness-sensitive nearest-neighbor search for efficient similarity retrieval of multimedia information
    • N. Katayama and S. Satoh. Distinctiveness-sensitive nearest-neighbor search for efficient similarity retrieval of multimedia information. In ICDE, pages 493-502, 2001.
    • (2001) ICDE , pp. 493-502
    • Katayama, N.1    Satoh, S.2
  • 9
    • 84956992397 scopus 로고    scopus 로고
    • Nearest neighbor queries in a mobile environment
    • G. Kollios, D. Gunopulos, and V. J. Tsotras. Nearest neighbor queries in a mobile environment. In STDM, pages 119-134, 1999.
    • (1999) STDM , pp. 119-134
    • Kollios, G.1    Gunopulos, D.2    Tsotras, V.J.3
  • 10
    • 0039845446 scopus 로고    scopus 로고
    • Influence sets based on reverse nearest neighbor queries
    • F. Korn and S. Muthukrishnan. Influence sets based on reverse nearest neighbor queries. In ACM SIGMOD, pages 201-212, 2000.
    • (2000) ACM SIGMOD , pp. 201-212
    • Korn, F.1    Muthukrishnan, S.2
  • 11
    • 2442450144 scopus 로고    scopus 로고
    • Reverse nearest neighbor aggregates over data streams
    • F. Korn, S. Muthukrishnan, and D. Srivastava. Reverse nearest neighbor aggregates over data streams. In VLDB, 2002.
    • (2002) VLDB
    • Korn, F.1    Muthukrishnan, S.2    Srivastava, D.3
  • 12
    • 33745626332 scopus 로고    scopus 로고
    • Applying bulk insertion techniques for dynamic reverse nearest neighbor problems
    • K.-I. Lin, M. Nolen, and C. Yang. Applying bulk insertion techniques for dynamic reverse nearest neighbor problems. In IDEAS, pages 290-297, 2003.
    • (2003) IDEAS , pp. 290-297
    • Lin, K.-I.1    Nolen, M.2    Yang, C.3
  • 13
    • 18744363040 scopus 로고    scopus 로고
    • High dimensional reverse nearest neighbor queries
    • A. Singh, H. Ferhatosmanoglu, and A. Ş. Tosun. High dimensional reverse nearest neighbor queries. In CIKM, pages 91-98, 2003.
    • (2003) CIKM , pp. 91-98
    • Singh, A.1    Ferhatosmanoglu, H.2    Tosun, A.Ş.3
  • 15
    • 26444614367 scopus 로고    scopus 로고
    • Discovery of influence sets in frequently updated databases
    • I. Stanoi, M. Riedewald, D. Agrawal, and A. El Abbadi. Discovery of influence sets in frequently updated databases. In VLDB, pages 99-108, 2001.
    • (2001) VLDB , pp. 99-108
    • Stanoi, I.1    Riedewald, M.2    Agrawal, D.3    El Abbadi, A.4
  • 16
    • 85028132868 scopus 로고    scopus 로고
    • Reverse knn search in arbitrary dimensionality
    • Y. Tao, D. Papadias, and X. Lian. Reverse knn search in arbitrary dimensionality. In VLDB, pages 744-755, 2004.
    • (2004) VLDB , pp. 744-755
    • Tao, Y.1    Papadias, D.2    Lian, X.3
  • 17
    • 0019094381 scopus 로고
    • A critical evaluation of intrinsic dimensionality algorithms
    • N. Wyse, R. Dubes, and A.K. Jain. A critical evaluation of intrinsic dimensionality algorithms. Pattern Recognition in Practice, pages 415-425, 1980.
    • (1980) Pattern Recognition in Practice , pp. 415-425
    • Wyse, N.1    Dubes, R.2    Jain, A.K.3
  • 18
    • 0034996301 scopus 로고    scopus 로고
    • An index structure for efficient reverse nearest neighbor queries
    • C. Yang and K.-I. Lin. An index structure for efficient reverse nearest neighbor queries. In ICDE, pages 485-492, 2001.
    • (2001) ICDE , pp. 485-492
    • Yang, C.1    Lin, K.-I.2


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