Evaluation of Reranked Recommended Queries in Web Information Retrieval using NDCG and CV

Full Text (PDF, 549KB), PP.23-30

Views: 0 Downloads: 0

Author(s)

R.Umagandhi 1,* A.V. Senthil Kumar 2

1. Department of Computer Technology, Kongunadu Arts and Science College, Coimbatore, TamilNadu, India

2. Department of Computer Applications, Hindusthan College of Arts and Science, Coimbatore, TamilNadu, India

* Corresponding author.

DOI: https://doi.org/10.5815/ijitcs.2015.08.04

Received: 17 Nov. 2014 / Revised: 1 Mar. 2015 / Accepted: 23 Apr. 2015 / Published: 8 Jul. 2015

Index Terms

Queries, PrefixSpan, UDDAG, NDCG, CV

Abstract

Tremendous growth of the Web, lack of background knowledge about the Information Retrieval (IR), length of the input query keywords and its ambiguity, Query Recommendation is an important procedure which analyzes the real search intent of the user and recommends set of queries to be used in future to retrieve the relevant and required information. The proposed method recommends the queries by generating frequently accessed queries, rerank the recommended queries and evaluates the recommendation with the help of the ranking measures Normalized Discounted Cumulative Gain (NDCG) and Coefficient of Variance (CV). The proposed strategies are experimentally evaluated using real time American On Line (AOL) search engine query log.

Cite This Paper

R.Umagandhi, A.V. Senthil Kumar, "Evaluation of Reranked Recommended Queries in Web Information Retrieval using NDCG and CV", International Journal of Information Technology and Computer Science(IJITCS), vol.7, no.8, pp.23-30, 2015. DOI:10.5815/ijitcs.2015.08.04

Reference

[1]B. Krishna, and A. Broder, "A technique for measuring the relative size and overlap of public web search engines,” Computer Networks and ISDN Systems 30.1, pp. 379-388, 1998.

[2]G. Antonio, and A. Signorini, "The indexable web is more than 11.5 billion pages,” Special interest tracks and posters of the 14th international conference on World Wide Web, ACM, 2005.

[3]M. Sanderson, "Ambiguous queries: test collections need more sense,” Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval, ACM, 2008.

[4]C. Silverstein, H. Monika, H. Marais, and M. Moricz, “Analysis of a very large altavista query log,” Technical Report 1998-014, Systems Research Center, Compaq Computer Corporation.

[5]T. Hanghang, and C. Faloutsos, "Center-piece subgraphs: problem definition and fast solutions,” In Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 404-413. 2006.

[6]B. Paolo, F. Bonchi, C. Castillo, D. Donato, A.Gionis, and Sebastiano Vigna, "The query-flow graph: model and applications,” In Proceedings of the 17th ACM conference on Information and knowledge management, pp. 609-618. ACM, 2008.

[7]B. Francesco, R. Perego, F. Silvestri, H.Vahabi, and Rossano Venturini, "Efficient query recommendations in the long tail via center-piece subgraphs,” In Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval, pp. 345-354, 2012.

[8]Fonseca, M. Bruno, P. B. Golgher, E. Silva de Moura, and N. Ziviani, "Using association rules to discover search engines related queries,” In Web Congress, Proceedings. First Latin American, pp. 66-71, 2003. 

[9]R. Baeza-Yates, C. Hurtado, and M. Mendoza, "Query recommendation using query logs in search engines,” In Current Trends in Database Technology-EDBT 2004 Workshops, pp. 588-596. 

[10]C. Silviu, and Ryen W. White, "Query suggestion based on user landing pages,” In Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, pp. 875-876, 2007. 

[11]Z. Zhiyong and O. Nasraoui, "Mining search engine query logs for query recommendation,” In Proceedings of the 15th international conference on World Wide Web, pp. 1039-1040, 2006.

[12]R. Jones, B. Rey, O. Madani, and W. Greiner, "Generating query substitutions,” In Proceedings of the 15th international conference on World Wide Web, pp. 387-396, 2006. 

[13]N. Azimi, and S. Kiani , “Accelerating the Response of Query in Semantic Web,” I.J. Computer Network and Information Security, vol. 8, pp. 26-33, August 2014.

[14]V. Jain V, and M. Singh, “Ontology development and query retrieval using protege tool,” International Journal of Intelligent Systems and Applications, vol. 5. no. 9, pp. 67-75, September 2013.

[15]N. Dunhan and A.K.Sharma, “Rank Optimization and Query Recommendation in Search Engines using Web Log Mining Techniques”, Journal of Computing, Vol.2, Issue 12, 2010.

[16]Hang LI, “A Short Introduction to Learning to Rank”, Special Section on Information-Based Induction Sciences and Machine Learning, ieice trans. inf. & syst., vol.e94-d, no.10, 2011. 

[17]Ravikumar, D. Pradeep, A.Tewari, and E. Yang, "On NDCG consistency of listwise ranking methods,” In International Conference on Artificial Intelligence and Statistics, pp. 618-626, 2011.

[18]R.Busa-Fekete, G. Szarvas, T. Elteto, and B. Kegl, "An apple-to-apple comparison of Learning-to-rank algorithms in terms of Normalized Discounted Cumulative Gain,” In 20th European Conference on Artificial Intelligence, 2012. 

[19]Liu Tie-Yan, "Learning to rank for information retrieval,” Foundations and Trends in Information Retrieval 3, no. 3, 225-331, 2009.

[20]D. Allan, M. M. Shoukri, N. Klar, and E. Bartfay, "Testing the equality of two dependent kappa statistics,” Statistics in medicine 19, no. 3, 373-387, 2000.

[21]D. Manning Christopher, P. Raghavan, and H. Schutze, “Introduction to information retrieval”. Vol. 1, 2008. 

[22]AOL data set from 2006 -03 - 01 to 2006 – 05 - 31 (zola. di. unipi. it / smalltext/datasets.html).

[23]R. Umagandhi, and A. V. Senthilkumar, “Search Query Recommendations using Hybrid User Profile with Query Logs,” International Journal of Computer Applications, Vol. 80 No.10, pp. 7-18, 2013.

[24]P. Jian, J. Han, B. Mortazavi-Asl, J. Wang, H. Pinto, Q. Chen, U. Dayal, and M. Hsu, "Mining sequential patterns by pattern-growth: The prefixspan approach,” Knowledge and Data Engineering, IEEE Transactions on 16, no. 11, 1424-1440, 2004.

[25]R. Umagandhi, and A.V. Senthilkumar, “Time Dependent Approach for Query and URL Recommendations Using Search Engine Query Logs,” IAENG International Journal of Computer Science. 40(3), 2013.

[26]M. I. Dan, R. Green, and P. Joseph, and Turian, "Precision and recall of machine translation,” In Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology, 2003.