메뉴 건너뛰기




Volumn , Issue , 2012, Pages 591-600

Automatic suggestion of query-rewrite rules for enterprise search

Author keywords

enterprise search; query reformulation; query rewrite rules

Indexed keywords

CLASSIFICATION APPROACH; COMPLEXITY THEORY; COMPUTATIONAL PROBLEM; DOMAIN EXPERTS; DOMAIN SPECIFIC; ENTERPRISE SEARCHES; EXPERIMENTAL STUDIES; HEURISTIC APPROACH; INTRANET SEARCH; LARGE DATASETS; MACHINE-LEARNING; QUERY REFORMULATION; QUERY-REWRITE RULES; RELEVANT DOCUMENTS; REWRITE RULES; SEARCH RESULTS;

EID: 84866620457     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2348283.2348363     Document Type: Conference Paper
Times cited : (10)

References (24)
  • 1
    • 77954575160 scopus 로고    scopus 로고
    • Towards rich query interpretation: Walking back and forth for mining query templates
    • G. Agarwal, G. Kabra, and K. C.-C. Chang. Towards rich query interpretation: walking back and forth for mining query templates. In WWW, pages 1-10, 2010.
    • (2010) WWW , pp. 1-10
    • Agarwal, G.1    Kabra, G.2    Chang, K.C.-C.3
  • 2
    • 79961206520 scopus 로고    scopus 로고
    • Towards the development of an integrated framework for enhancing enterprise search using latent semantic indexing
    • O. Alhabashneh, R. Iqbal, N. Shah, S. Amin, and A. E. James. Towards the development of an integrated framework for enhancing enterprise search using latent semantic indexing. In ICCS, pages 346-352, 2011.
    • (2011) ICCS , pp. 346-352
    • Alhabashneh, O.1    Iqbal, R.2    Shah, N.3    Amin, S.4    James, A.E.5
  • 3
    • 35048823972 scopus 로고    scopus 로고
    • Query recommendation using query logs in search engines
    • EDBT Workshops
    • R. A. Baeza-Yates, C. A. Hurtado, and M. Mendoza. Query recommendation using query logs in search engines. In EDBT Workshops, volume 3268 of Lecture Notes in Computer Science, pages 588-596, 2004.
    • (2004) Lecture Notes in Computer Science , vol.3268 , pp. 588-596
    • Baeza-Yates, R.A.1    Hurtado, C.A.2    Mendoza, M.3
  • 5
    • 7444222498 scopus 로고    scopus 로고
    • Towards the next generation of enterprise search technology
    • A. Z. Broder and A. C. Ciccolo. Towards the next generation of enterprise search technology. IBM Systems Journal, 43(3):451-454, 2004.
    • (2004) IBM Systems Journal , vol.43 , Issue.3 , pp. 451-454
    • Broder, A.Z.1    Ciccolo, A.C.2
  • 6
    • 0034785403 scopus 로고    scopus 로고
    • Robertson. Effective site finding using link anchor information
    • N. Craswell, D. Hawking, and S. E. Robertson. Effective site finding using link anchor information. In SIGIR, pages 250-257, 2001.
    • (2001) SIGIR , pp. 250-257
    • Craswell, N.1    Hawking, D.2    E, S.3
  • 11
    • 84864338078 scopus 로고    scopus 로고
    • Challenges in enterprise search
    • ADC
    • D. Hawking. Challenges in enterprise search. In ADC, volume 27 of CRPIT, pages 15-24, 2004.
    • (2004) CRPIT , vol.27 , pp. 15-24
    • Hawking, D.1
  • 12
    • 33745816294 scopus 로고    scopus 로고
    • Enterprise search - The new frontier?
    • ECIR
    • D. Hawking. Enterprise search - the new frontier? In ECIR, volume 3936 of Lecture Notes in Computer Science, page 12, 2006.
    • (2006) Lecture Notes in Computer Science , vol.3936 , pp. 12
    • Hawking, D.1
  • 13
    • 33845952637 scopus 로고    scopus 로고
    • Generating query substitutions
    • R. Jones, B. Rey, O. Madani, and W. Greiner. Generating query substitutions. In WWW, pages 387-396, 2006.
    • (2006) WWW , pp. 387-396
    • Jones, R.1    Rey, B.2    Madani, O.3    Greiner, W.4
  • 14
    • 19944411179 scopus 로고    scopus 로고
    • Mining anchor text for query refinement
    • R. Kraft and J. Y. Zien. Mining anchor text for query refinement. In WWW, pages 666-674, 2004.
    • (2004) WWW , pp. 666-674
    • Kraft, R.1    Zien, J.Y.2
  • 15
    • 33750362018 scopus 로고    scopus 로고
    • Getting work done on the web: Supporting transactional queries
    • Y. Li, R. Krishnamurthy, S. Vaithyanathan, and H. V. Jagadish. Getting work done on the web: supporting transactional queries. In SIGIR, pages 557-564, 2006.
    • (2006) SIGIR , pp. 557-564
    • Li, Y.1    Krishnamurthy, R.2    Vaithyanathan, S.3    Jagadish, H.V.4
  • 16
    • 0031312210 scopus 로고    scopus 로고
    • Split selection methods for classification trees
    • W.-Y. Loh and Y.-S. Shih. Split selection methods for classification trees. Statistica Sinica, 7:815-840, 1997.
    • (1997) Statistica Sinica , vol.7 , pp. 815-840
    • Loh, W.-Y.1    Shih, Y.-S.2
  • 18
    • 77950948821 scopus 로고    scopus 로고
    • Optimizing query rewrites for keyword-based advertising
    • A. Malekian, C.-C. Chang, R. Kumar, and G. Wang. Optimizing query rewrites for keyword-based advertising. In EC, pages 10-19, 2008.
    • (2008) EC , pp. 10-19
    • Malekian, A.1    Chang, C.-C.2    Kumar, R.3    Wang, G.4
  • 19
    • 83055187789 scopus 로고    scopus 로고
    • Suggestion set utility maximization using session logs
    • U. Ozertem, E. Velipasaoglu, and L. Lai. Suggestion set utility maximization using session logs. In CIKM, pages 105-114, 2011.
    • (2011) CIKM , pp. 105-114
    • Ozertem, U.1    Velipasaoglu, E.2    Lai, L.3
  • 20
    • 83055186849 scopus 로고    scopus 로고
    • Improving recommendation for long-tail queries via templates
    • I. Szpektor, A. Gionis, and Y. Maarek. Improving recommendation for long-tail queries via templates. In WWW, 2011.
    • (2011) WWW
    • Szpektor, I.1    Gionis, A.2    Maarek, Y.3
  • 22
    • 67649855128 scopus 로고    scopus 로고
    • Mining search engine query logs for query recommendation
    • Z. Zhang and O. Nasraoui. Mining search engine query logs for query recommendation. In WWW, pages 1039-1040, 2006.
    • (2006) WWW , pp. 1039-1040
    • Zhang, Z.1    Nasraoui, O.2
  • 23
    • 35348866211 scopus 로고    scopus 로고
    • Navigating the intranet with high precision
    • H. Zhu, S. Raghavan, S. Vaithyanathan, and A. Löser. Navigating the intranet with high precision. In WWW, pages 491-500, 2007.
    • (2007) WWW , pp. 491-500
    • Zhu, H.1    Raghavan, S.2    Vaithyanathan, S.3    Löser, A.4
  • 24
    • 43849088675 scopus 로고    scopus 로고
    • Linear degree extractors and the inapproximability of max clique and chromatic number
    • D. Zuckerman. Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing, 3(1):103-128, 2007.
    • (2007) Theory of Computing , vol.3 , Issue.1 , pp. 103-128
    • Zuckerman, D.1


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