메뉴 건너뛰기




Volumn 4, Issue 2, 2010, Pages

Optimal distance bounds for fast search on compressed time-series query logs

Author keywords

[No Author keywords available]

Indexed keywords

DATA ORGANIZATION; DISTANCE BOUND; DISTANCE ESTIMATION; EXPERIMENTAL EVALUATION; FAST SEARCH; INTERNET SEARCH ENGINE; MULTIPLE PERSPECTIVES; OPTIMIZATION PRINCIPLE; POLLING MECHANISM; QUERY LOGS; SEARCH PERFORMANCE; STORAGE REQUIREMENTS; WEBLOGS;

EID: 77951928248     PISSN: 15591131     EISSN: 1559114X     Source Type: Journal    
DOI: 10.1145/1734200.1734203     Document Type: Article
Times cited : (4)

References (41)
  • 9
    • 0034215869 scopus 로고    scopus 로고
    • Dynamic VP-Tree indexing for N-nearest neighbor search given pair-wise distances
    • CHEE FU, A. W., CHAN, P. M., CHEUNG, Y.-L., AND MOON, Y. 2000. Dynamic VP-Tree indexing for N-nearest neighbor search given pair-wise distances. J. VLDB, 154-173.
    • (2000) J. VLDB , pp. 154-173
    • Chee Fu, A.W.1    Chan, P.M.2    Cheung, Y.-L.3    Moon, Y.4
  • 16
    • 33845258513 scopus 로고    scopus 로고
    • A Web search method based on the temporal relation of query keywords
    • KAGE, T. AND SUMIYA, K. 2006. A Web search method based on the temporal relation of query keywords. In Proceedings of the Web Information Systems. 4-15.
    • (2006) Proceedings of the Web Information Systems , pp. 4-15
    • Kage, T.1    Sumiya, K.2
  • 20
    • 0042711018 scopus 로고    scopus 로고
    • On the need for time series datamining benchmarks: A survey and empirical demonstration
    • KEOGH, E. J. AND KASETTY, S. 2003. On the need for time series datamining benchmarks: A survey and empirical demonstration. Data Min. Knowl. Discov. 7, 4, 349-371.
    • (2003) Data Min. Knowl. Discov. , vol.7 , Issue.4 , pp. 349-371
    • Keogh, E.J.1    Kasetty, S.2
  • 29
    • 55149100303 scopus 로고    scopus 로고
    • Learning about the world through long-term query logs
    • RICHARDSON, M. 2008. Learning about the world through long-term query logs. ACM Trans. Web, 2, 4.
    • (2008) ACM Trans. Web , vol.2 , pp. 4
    • Richardson, M.1
  • 39
    • 0027188633 scopus 로고
    • Data structures and algorithms for nearest neighbor search in general metric spaces
    • YIANILOS, P. 1992. Data structures and algorithms for nearest neighbor search in general metric spaces. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithm. 311-321.
    • (1992) Proceedings of the ACM-SIAM Symposium on Discrete Algorithm , pp. 311-321
    • Yianilos, P.1


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