Total views : 108

An Algorithmic Query Refinement Model based on Query Classification

Affiliations

  • Research and Development Center, Bharathiar University, Coimbatore - 641046, Tamil Nadu, India
  • Department of Computer Science, Rajeswari Vedachalam Arts and Science College, Chengalpattu - 603001, Tamil Nadu, India

Abstract


Objectives: This work focuses on developing an algorithmic refinement model for performing query refinement to improve the original query by adding more relevant candidate terms. The work has been tested in real time web environment and the results are also provided. Methods and Analysis: Query handling is a vibrant area in the field of Information Retrieval. Experiments reveal that formulating a query plays a vital role in generating relevant results. Since most of the users of web environment are naïve, query formulation cannot be expected to be effective always. This challenge could be overcome by the process of Query Refinement. Though there are many approaches put forward in the literature, in this work we propose a query refinement method based on the classification of queries and generating candidate terms from ontology and Thesaurus. Findings: We used the TREC 2014 web queries for evaluation and calculated Precision and Recall. The evaluation has been done on the Real time web environment which includes the most commonly used search engines like Google, Yahoo and Ask. The results have been compared and we could find a significant increase in both the precision and Recall. We did calculate the similarity measure using the Jaccard Similarity Coefficient. Since the Web environment is highly dynamic, the results tend to change depending upon the timing of execution of queries. Applications/Improvement: Addition of more relevant candidate terms helps to improve the accuracy of search applications. There has been no perfect retrieval system so far and there is always a scope of improvement. The result of this work reveals an increase in the accuracy of the retrieval system. We tend to analyze the results further, by comparing its impact in most of the available search applications.

Keywords

Information Retrieval, Ontology, Query Classification, Query Refinement, Semantic Web

Full Text:

 |  (PDF views: 95)

References


  • Broder A. A Taxonomy of Web search. Proceedings in the SIGIR Forum. 2002; 36(2):3–10. Crossref
  • Spink A, Jansen BJ. Web search: Public searching of the Web. New York. 2004; 42(1):248–63.
  • Rose DE, Levinson D. In Understanding user goals in Web search. Proceedings in the World Wide Web Conference, New York, NY, USA. 2004. p. 13–9. Crossref
  • Kang I, Kim G. In Query type classification for Web document retrieval. Proceedings in the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Toronto, Canada.
  • Aug. p. 64–71.
  • Lee U, Liu Z, Cho J. In Automatic identification of user goals in Web search. Proceedings in the World Wide Web Conference, Chiba, Japan. 2005. p. 391–401. Crossref
  • Dai HK, Nie Z, Wang L, Zhao L, Wen JR, Li Y. In detecting online commercial intention (OCI. Proceedings in World Wide Web Conference, Edinburgh, Scotland. 2006. p. 829– 37. PMid:16835901
  • Baeza-Yates R, Calderon-Benavides L, Gonzalez C. In The intention behind Web queries. Proceedings in String Processing and Information Retrieval, Glasgow, Scotland.2006 Oct; 98–109.
  • Cui H, Wen JR, Nie JY, Ma WY. Probabilistic query expansion using query logs. Proceedings of the 11th International Conference on World Wide Web, New York, NY, USA: ACM. 2002. p. 325–32. Crossref
  • Li Y, Luk WPR, Ho KSE, Chung FLK. Improving weak adhoc queries using wikipedia as external corpus. Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, New York, NY, USA: ACM. 2007. p. 797–8.
  • Bendersky M, Metzler D, Croft WB. Parameterized concept weighting in verbose queries. Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval. 2011. p. 605–14.Crossref
  • Voorhees EM. Query expansion using lexical-semantic relations. Proceedings of the 17th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. 1994. p. 61–9. Crossref
  • Fang H. Are-examination of query expansion using lexical resources. Proceedings ofACL-08: HLT. 2008; 139–47.
  • Zhang J, Deng B, Li X. Concept based query expansion using word net. Proceedings of the International e-Conference on Advanced Science and Technology. 2009. p. 52–5.
  • Liu S, Liu F, Yu C, Meng W. An effective approach to document retrieval via utilizing word net and recognizing phrases. Proceedings of the 27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. 2004. p. 266–72.
  • Bendersky M, Metzler D, Croft WB. Effective query formulation with multiple information sources. Proceedings of the fifth ACM International Conference on Web search and data mining. 2012. p. 443–52. Crossref
  • Pal D, Mitra M, Datta K. Query expansion using term distribution and term association. CoRR, abs/1303.0667.
  • ; 19.
  • Cao G, Nie JY, Gao J, Robertson S. Selecting good expansion terms for pseudo- relevance feedback. Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. 2008.p. 243–50. Crossref
  • P’erez-Agu¨era JR, Araujo L. Comparing and combining methods for automatic query expansion. Proceedings of CICLING 2008, Advances in Natural Language Processing and Applications. 2010; 33:177–88.
  • Ruban, Sam B, Kumar R. Determining the Impact of Domain Independent Ontology over Transactional user Queries. Indian Journal of Science and Technology. 2015 Sep; 8(24):1–6. Crossref
  • Ruban S, Sam B. A Comparative Study and Performance Analysis of Wordnet Over Transactional and Informational Queries. International Journal of Applied Engineering Research. 2015; 10(70):1–6.
  • Pass G, Chowdhury A, Torgeson C. A Picture of Search the First International Conference on Scalable Information Systems, Hong Kong. 2006 Jun; 75(1):29–41.
  • Suphakit N. Using of Jaccard coefficient for keywords similarity.Proceedings of the International Multi Conference of Engineers and Computer Scientists, Hong Kong. 2013; 1:1–5.

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.