Open Access   Article Go Back

Search Engine Query Grouping using the combination of Time, Text and URL Similarity with Association Rules

Divakar Pandey1

Section:Research Paper, Product Type: Journal Paper
Volume-4 , Issue-1 , Page no. 76-81, Jan-2016

Online published on Jan 31, 2016

Copyright © Divakar Pandey . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Divakar Pandey, “Search Engine Query Grouping using the combination of Time, Text and URL Similarity with Association Rules,” International Journal of Computer Sciences and Engineering, Vol.4, Issue.1, pp.76-81, 2016.

MLA Style Citation: Divakar Pandey "Search Engine Query Grouping using the combination of Time, Text and URL Similarity with Association Rules." International Journal of Computer Sciences and Engineering 4.1 (2016): 76-81.

APA Style Citation: Divakar Pandey, (2016). Search Engine Query Grouping using the combination of Time, Text and URL Similarity with Association Rules. International Journal of Computer Sciences and Engineering, 4(1), 76-81.

BibTex Style Citation:
@article{Pandey_2016,
author = {Divakar Pandey},
title = {Search Engine Query Grouping using the combination of Time, Text and URL Similarity with Association Rules},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {1 2016},
volume = {4},
Issue = {1},
month = {1},
year = {2016},
issn = {2347-2693},
pages = {76-81},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=784},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=784
TI - Search Engine Query Grouping using the combination of Time, Text and URL Similarity with Association Rules
T2 - International Journal of Computer Sciences and Engineering
AU - Divakar Pandey
PY - 2016
DA - 2016/01/31
PB - IJCSE, Indore, INDIA
SP - 76-81
IS - 1
VL - 4
SN - 2347-2693
ER -

VIEWS PDF XML
1604 1471 downloads 1570 downloads
  
  
           

Abstract

Understanding the characteristics of queries wherever a search engine is failing is very important for improving search engine performance. Previous work for the most part depends on user-interaction options (e.g., click through statistics) to spot such underperforming queries. This paper evaluates the techniques used for users log history query grouping in automatic manner. Automatic query grouping is very useful for lots of software and web application. In this paper we proposes new method for calculating similarity between query using various log record attributes like time, clicked url, text similarity and frequently occurring queries using association rules. This work introduces another strong method for similar query grouping to make web browsing easy and efficient by query recommendation. A comparative evaluation of proposed method with existing work available in literature has also been carried out and the result shows that the proposed method is more effective.

Key-Words / Index Term

Query Reformulation, Click Graph, Web Mining, Association Rules, Text Similarity

References

[1] Ageev, M., Guo, Q., Lagun, D., and Agichtein, E. “Find it if you can: a game for modeling different types of web search success using interaction data”. SIGIR, pp-345 –354 , 2011.
[2] Feild, H., Allan, J., and Jones, R. Predicting searcher frustration. SIGIR,pp- 34–41, 2010.
[3] Guo, Q., White, R.W., Zhang, Y., Anderson, B., and Dumais, S.T. Why searchers switch: understanding and pre-dicting engine switching rationales. SIGIR, pp-335–344, 2011.
[4] Hassan, A., Song, Y., and He, L. A task level user satisfaction model and its application on improving relevance estimation. CIKM,pp- 125–134,2011.
[5] Spink, M. Park, B.J. Jansen, and J. Pedersen,“Multitasking during Web Search Sessions” Information Processing and Management, vol. 42, no. 1, pp. 264-275, 2006.
[6] Fuxman, P. Tsaparas, K. Achan, and R. Agrawal, “Using the Wisdom of the Crowds for Keyword Generation” Proc. the 17th Int’l Conf. World Wide Web (WWW ’08), 2008.
[7] Heasoo Hwang, Hady W. Lauw, Lise Getoor, and Alexandros Ntoulas, “Organizing User Search Histories”, IEEE Transactions On Knowledge And Data Engineering, Vol. 24, NO. 5, Page 912-925.2012.
[8] A. Fuxman, P. Tsaparas, K. Achan, and R. Agrawal, “Using the Wisdom of the Crowds for Keyword Generation” Proc. the 17th Int’l Conf. World Wide Web (WWW ’08),2008.
[9] W.M. Rand, “Objective Criteria for the Evaluation of Clustering Methods” J. the Am. Statistical Assoc.,vol. 66, no. 336, pp. 846-850, 1971.
[10] Jaideep Srivastava, Robert Cooley, Mukund Deshpande Pang-Ning Tan, “Web Usage Mining: Discovery and Applications of Usage Patterns from Web Data”, SIGKDD Explorations, Vol. 1, No. 2, 2000.
[11] Spink, M. Park, B.J. Jansen, and J. Pedersen, “Multitasking during Web Search sessions,” Information Processing and Management, vol. 42, no. 1, pp. 264-275, 2006.
[12] H.C. Ozmutlu and F. C¸ avdur, “Application of Automatic Topic Identification on Excite Web Search Engine Data Logs,” Information Processing and Management, vol. 41, no. 5, pp. 1243-1262, 2005
[13] F. Radlinski and T. Joachims, “Query Chains: Learning to Rank from Implicit Feedback,” Proc. ACM Conf. Knowledge Discovery and Data Mining (KDD), 2005.
[14] J. Yi and F. Maghoul, “Query Clustering Using Click-through Graph,” Proc. the 18th Int’l Conf. World Wide Web (WWW ’09), 2009.
[15] E. Sadikov, J. Madhavan, L. Wang, and A. Halevy, “Clustering Query Refinements by User Intent,” Proc. the 19th Int’l Conf. World Wide Web (WWW ’10), 2010.
[16] R. Baeza-Yates and A. Tiberi, “Extracting Semantic Relations from Query Logs,” Proc. 13th ACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining (KDD), 2007.
[17] M. Spiliopoulou, C. Pohle, and L.C. F aulstich. Improving the effectiveness of a website with web usage mining. In Advances in Web Usage Analysis and User Profiling, Berlin, Springer, pp. 141-62, 2000
[18] K. Collins-Thompson and J. Callan, “Query Expansion Using Random Walk Models,” Proc. 14th ACM Int’l Conf. Information and Knowledge Management (CIKM), 2005.
[19] N. Craswell and M. Szummer, “Random Walks on the Click Graph,” Proc. 30th Ann. Int’l ACM SIGIR Conf. Research and Development in Information Retrieval (SIGIR ’07), 2007.
[20] J.-R. Wen, J.-Y. Nie, and H.-J. Zhang, “Query Clustering Using User Logs,” ACM Trans. in Information Systems, vol. 20, no. 1, pp. 59-81,2002.
[21] Tahira Tabassum, Amit Dubey, “User Search Query Grouping using Association Fusion Graph”,International Journal of Advanced Research in Computer Science and Software Engineering, Volume4, ,Issue4, Page 259-267, April 2014.