Abstract
Q uery expansion is an important technology for improving retrieval performance in information retrieval. Many Studies have found contexts within query that strongly influence the interpretation of a query. In this paper, we propose the graph mining technique called Quasi-Clique as query context in Markov network retrieval model. Our approach exploits contextual information mined from the term Markov network for per query term in addition to syntactic similarity. The proposal in our work is benefit to select more relevant terms for query expansion and to improve precision in information retrieval. Keywords—information retrieval; query expansion; quasi- clique; Markov network retrieval I. INTRODU CTION
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
