Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSejal, D.
dc.contributor.authorShailesh, K.G.
dc.contributor.authorTejaswi, V.
dc.contributor.authorAnvekar, D.
dc.contributor.authorVenugopal, K.R.
dc.contributor.authorIyengar, S.S.
dc.contributor.authorPatnaik, L.M.
dc.identifier.citationProceedings - 2015 IEEE Region 10 Symposium, TENSYMP 2015, 2015, Vol., , pp.78-81en_US
dc.description.abstractQuery recommendation is an important feature of the search engine with the explosive and diverse growth of web contents. Different kind of recommendation like query, image, movies, music and book etc. Are used every day. Various types of data sources are used for the recommendations. If we model the data into various kinds of graphs then we can build a general method for any recommendation. In this paper, we have proposed a general method for query recommendation by combining two graphs: 1) query click graph which captures the relationship between queries frequently clicked on common URLs and 2) query text similarity graph which finds the similarity between two queries using Jaccard similarity. The proposed method provides literally as well as semantically relevant queries for users' need. Simulation results show that the proposed algorithm outperforms heat diffusion method by providing more number of relevant queries. It can be used for recommendation tasks like query, image, and product recommendation. � 2015 IEEE.en_US
dc.titleQRGQR: Query relevance graph for query recommendationen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.