메뉴 건너뛰기




Volumn , Issue , 2011, Pages 781-792

Efficient diversity-aware search

Author keywords

data access scheduling; diversification; search

Indexed keywords

ACCESS SCHEDULING; DATA ACCESS; DATA ACCESS SCHEDULING; DIVERSIFICATION; EMERGING APPLICATIONS; HARD PROBLEMS; PERFORMANCE; SEARCH; USER QUERY; USERS' SATISFACTIONS;

EID: 79959958173     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989323.1989405     Document Type: Conference Paper
Times cited : (123)

References (30)
  • 2
    • 70349142102 scopus 로고    scopus 로고
    • Ranking objects based on relationships and fixed associations
    • A. Angel, S. Chaudhuri, G. Das, and N. Koudas. Ranking objects based on relationships and fixed associations. In EDBT, 2009.
    • (2009) EDBT
    • Angel, A.1    Chaudhuri, S.2    Das, G.3    Koudas, N.4
  • 5
    • 0033321433 scopus 로고    scopus 로고
    • Introduction to information extraction
    • D. Appelt and D. Israel. Introduction to information extraction. In IJCAI Tutorial, 1999.
    • (1999) IJCAI Tutorial
    • Appelt, D.1    Israel, D.2
  • 7
    • 0032270694 scopus 로고    scopus 로고
    • The use of mmr, diversity-based reranking for reordering documents and producing summaries
    • J. Carbonell and J. Goldstein. The use of mmr, diversity-based reranking for reordering documents and producing summaries. In SIGIR, 1998.
    • (1998) SIGIR
    • Carbonell, J.1    Goldstein, J.2
  • 9
    • 33750364986 scopus 로고    scopus 로고
    • Less is more: Probabilistic models for retrieving fewer relevant documents
    • H. Chen and D. R. Karger. Less is more: probabilistic models for retrieving fewer relevant documents. In SIGIR, 2006.
    • (2006) SIGIR
    • Chen, H.1    Karger, D.R.2
  • 12
    • 0034819889 scopus 로고    scopus 로고
    • Optimal aggregation algorithms for middleware
    • R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, 2001.
    • (2001) PODS
    • Fagin, R.1    Lotem, A.2    Naor, M.3
  • 13
    • 57149144917 scopus 로고    scopus 로고
    • Keyword proximity search in complex data graphs
    • K. Golenberg, B. Kimelfeld, and Y. Sagiv. Keyword proximity search in complex data graphs. In SIGMOD, 2008.
    • (2008) SIGMOD
    • Golenberg, K.1    Kimelfeld, B.2    Sagiv, Y.3
  • 14
    • 84865627427 scopus 로고    scopus 로고
    • An axiomatic approach for result diversification
    • S. Gollapudi and A. Sharma. An axiomatic approach for result diversification. In WWW, 2009.
    • (2009) WWW
    • Gollapudi, S.1    Sharma, A.2
  • 15
    • 79959982391 scopus 로고    scopus 로고
    • Providing diversity in k-nearest neighbor query results
    • A. Jain, P. Sarda, and J. R. Haritsa. Providing diversity in k-nearest neighbor query results. In PAKDD, 2004.
    • (2004) PAKDD
    • Jain, A.1    Sarda, P.2    Haritsa, J.R.3
  • 18
    • 52949135806 scopus 로고    scopus 로고
    • Submodular function minimization
    • Elsevier
    • S. T. McCormick. Submodular function minimization. In Discrete Optimization, volume 12, pages 321-391. Elsevier, 2005.
    • (2005) Discrete Optimization , vol.12 , pp. 321-391
    • McCormick, S.T.1
  • 20
    • 33750340233 scopus 로고    scopus 로고
    • Improving personalized web search using result diversification
    • F. Radlinski and S. Dumais. Improving personalized web search using result diversification. In SIGIR, 2006.
    • (2006) SIGIR
    • Radlinski, F.1    Dumais, S.2
  • 21
    • 57349171311 scopus 로고    scopus 로고
    • Tf-idf uncovered: A study of theories and probabilities
    • T. Roelleke and J.Wang. Tf-idf uncovered: a study of theories and probabilities. In SIGIR, 2008.
    • (2008) SIGIR
    • Roelleke, T.1    Wang, J.2
  • 22
    • 77952753812 scopus 로고    scopus 로고
    • Efficient identification of coupled entities in document collections
    • N. Sarkas, A. Angel, N. Koudas, and D. Srivastava. Efficient identification of coupled entities in document collections. In ICDE, 2010.
    • (2010) ICDE
    • Sarkas, N.1    Angel, A.2    Koudas, N.3    Srivastava, D.4
  • 23
    • 50849144347 scopus 로고    scopus 로고
    • Dense subgraph problems with output-density conditions
    • A. Suzuki and T. Tokuyama. Dense subgraph problems with output-density conditions. ACM Trans. Algorithms, 4(4), 2008.
    • (2008) ACM Trans. Algorithms , vol.4 , Issue.4
    • Suzuki, A.1    Tokuyama, T.2
  • 25
    • 70349156147 scopus 로고    scopus 로고
    • It takes variety to make a world: Diversification in recommender systems
    • C. Yu, L. Lakshmanan, and S. Amer-Yahia. It takes variety to make a world: diversification in recommender systems. In EDBT, 2009.
    • (2009) EDBT
    • Yu, C.1    Lakshmanan, L.2    Amer-Yahia, S.3
  • 28
    • 0036989637 scopus 로고    scopus 로고
    • Novelty and redundancy detection in adaptive filtering
    • Y. Zhang, J. P. Callan, and T. P. Minka. Novelty and redundancy detection in adaptive filtering. In SIGIR, 2002.
    • (2002) SIGIR
    • Zhang, Y.1    Callan, J.P.2    Minka, T.P.3
  • 29
  • 30
    • 33645657113 scopus 로고    scopus 로고
    • Improving recommendation lists through topic diversification
    • C.-N. Ziegler, S. M. McNee, J. A. Konstan, and G. Lausen. Improving recommendation lists through topic diversification. In WWW, 2005.
    • (2005) WWW
    • Ziegler, C.-N.1    McNee, S.M.2    Konstan, J.A.3    Lausen, G.4


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