loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth IEEE International Conference on Computer and Information Technology (CIT'06)
A New Strategy of Query Expansion using Formal Concept Analysis
Seoul, Korea
September 20-September 22
ISBN: 0-7695-2687-X
ASCII Text
x 
 
Yufeng Hai, Yajun Du, Haiming Li, "A New Strategy of Query Expansion using Formal Concept Analysis," Computer and Information Technology, International Conference on, pp. 34, Sixth IEEE International Conference on Computer and Information Technology (CIT'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/CIT.2006.18,
author = {Yufeng Hai and Yajun Du and Haiming Li},
title = {A New Strategy of Query Expansion using Formal Concept Analysis},
journal ={Computer and Information Technology, International Conference on},
volume = {0},
year = {2006},
isbn = {0-7695-2687-X},
pages = {34},
doi = {http://doi.ieeecomputersociety.org/10.1109/CIT.2006.18},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer and Information Technology, International Conference on
TI - A New Strategy of Query Expansion using Formal Concept Analysis
SN - 0-7695-2687-X
SP
EP
A1 - Yufeng Hai,
A1 - Yajun Du,
A1 - Haiming Li,
PY - 2006
KW - null
VL - 0
JA - Computer and Information Technology, International Conference on
ER -
 
Yufeng Hai, Xihua University, China
Yajun Du, Xihua University, China
Haiming Li, Zhejiang Forestry University, China
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.
Citation:
Yufeng Hai, Yajun Du, Haiming Li, "A New Strategy of Query Expansion using Formal Concept Analysis," cit, pp.34, Sixth IEEE International Conference on Computer and Information Technology (CIT'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.