Advanced Search
CS Search Google Search
Subscribers, please login

Published Articles >> Table of Contents >> Abstract

Sixth IEEE International Conference on Computer and Information Technology (CIT'06)   p. 34
A New Strategy of Query Expansion using Formal Concept Analysis

Full Article Text: Download PDF of full textBuy this article

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CIT.2006.18
Send link to a friend

Abstract
One of the most important tasks of search engine is presenting more additional relevant web pages and reducing those web pages which are useless for user. Query expansion is an efficient method for this. In this paper, a new strategy of expanding query terms based on formal concept analysis was proposed. In this strategy basic rules and extended rules are mined from concept lattice which is built from lower adjacency set of user’s requirements for query expansion. By matching between terms of web pages of upper adjacency set and association rules, search engine can return web pages to user much better. There is no need to scan all nodes of lattice, and search engine can provide more additional relevant web pages and reduce useless web pages to user with an effective way.
Additional Information

Citation:  Yufeng Hai, Yajun Du, Haiming Li, "A New Strategy of Query Expansion using Formal Concept Analysis," cit, p. 34,  Sixth IEEE International Conference on Computer and Information Technology (CIT'06),  2006

Similar Articles

Abstract Contents
Abstract
Citation




Free access to

  • Abstracts
  • Selected PDFs

Electronic subscribers login to:

  • Access HTML/PDFs of full text articles

Subscription information

Get a Web account

PDFs require Adobe Acrobat Reader.

Peer Review Notice

Give us Feedback