메뉴 건너뛰기




Volumn 16, Issue 2, 2004, Pages 256-270

Evaluating Refined Queries in Top-k Retrieval Systems

Author keywords

K nearest neighbor search; Multidimensional indexing; Query refinement; Relevance feedback; Similarity queries

Indexed keywords

K-NEAREST NEIGBOUR SEARCH; MULTIDIMENSIONAL INDEXING; QUERY REFINEMENT; RELEVANCE FEEDBACK; SIMILARITY QUERIES;

EID: 1342345064     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2004.1269602     Document Type: Article
Times cited : (34)

References (28)
  • 1
    • 0031166627 scopus 로고    scopus 로고
    • On Saying "Enough Already" in Sql
    • M. Carey and D. Kossmann, "On Saying "Enough Already" in Sql," Proc. SIGMOD, 1997.
    • (1997) Proc. SIGMOD
    • Carey, M.1    Kossmann, D.2
  • 2
    • 0032664793 scopus 로고    scopus 로고
    • The Hybrid Tree: An Index Structure for High Dimensional Feature Spaces
    • Mar.
    • K. Chakrabarti and S. Mehrotra, "The Hybrid Tree: An Index Structure for High Dimensional Feature Spaces," Proc. IEEE Int'l Conf. Data Eng., Mar. 1999.
    • (1999) Proc. IEEE Int'l Conf. Data Eng.
    • Chakrabarti, K.1    Mehrotra, S.2
  • 3
    • 26344477513 scopus 로고    scopus 로고
    • Efficient Query Refinement for Top-k Selection Queries
    • K. Chakrabarti, K. Porkaew, and S. Mehrotra, "Efficient Query Refinement for Top-k Selection Queries," Technical Report MARSTR-00-05, 2000.
    • (2000) Technical Report , vol.MARSTR-00-05
    • Chakrabarti, K.1    Porkaew, K.2    Mehrotra, S.3
  • 13
    • 0024036750 scopus 로고
    • Vague: A User Interface to Relational Databases that Permits Vague Queries
    • July
    • A. Motro, "Vague: A User Interface to Relational Databases that Permits Vague Queries," ACM Trans. Office Information Systems, vol. 6, no. 3, July 1988.
    • (1988) ACM Trans. Office Information Systems , vol.6 , Issue.3
    • Motro, A.1
  • 25
    • 84993661650 scopus 로고    scopus 로고
    • Efficient User-Adaptable Similarity Search in Large Multimedia Databases
    • T. Seidl and H. Kriegel, "Efficient User-Adaptable Similarity Search in Large Multimedia Databases," Proc. Very Large Data Bases Conf., 1997.
    • (1997) Proc. Very Large Data Bases Conf.
    • Seidl, T.1    Kriegel, H.2
  • 26
    • 0032094249 scopus 로고    scopus 로고
    • Optimal Multistep k-Nearest Neighbor Search
    • T. Seidl and H. Kriegel, "Optimal Multistep k-Nearest Neighbor Search," Proc. ACM SIGMOD, 1998.
    • (1998) Proc. ACM SIGMOD
    • Seidl, T.1    Kriegel, H.2


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