πŸ“ž +91-7667918914 | βœ‰οΈ ijarcce@gmail.com
International Journal of Advanced Research in Computer and Communication Engineering
International Journal of Advanced Research in Computer and Communication Engineering A monthly Peer-reviewed & Refereed journal
ISSN Online 2278-1021ISSN Print 2319-5940Since 2012
IJARCCE adheres to the suggestive parameters outlined by the University Grants Commission (UGC) for peer-reviewed journals, upholding high standards of research quality, ethical publishing, and academic excellence.
← Back to VOLUME 3, ISSUE 11, NOVEMBER 2014

Query Suggestion and Recommendation Using Bipartite Graph and K-Means Clustering

πŸ‘ 35 viewsπŸ“₯ 0 downloads
Share: 𝕏 f in ✈ βœ‰
Abstract: With the diverse and explosive growth of web information, retrieving, organizing and utilizing the information effectively and efficiently has become more and more critical. The first challenge is that it is not easy to recommend latent semantically relevant results to users. The second challenge is to take into account the personalization feature. As the exponential explosion of various contents generated on the Web, Recommendation techniques have become increasingly indispensable. Innumerable different kinds of recommendations are made on the Web every day, including movies, music, images, books recommendations, query suggestions, tags recommendations, etc., The proposed work carries out query suggestion and recommends query and URLβ€Ÿs using Bipartite graph and K- means clustering.

Keywords: Recommendation, Clustering, Query suggestion.

How to Cite:

[1] , β€œQuery Suggestion and Recommendation Using Bipartite Graph and K-Means Clustering,” International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE)

Creative Commons License This work is licensed under a Creative Commons Attribution 4.0 International License.