Notes and references on early automatic classification work
ACM SIGIR Forum
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
A partition-based approach towards constructing Galois (concept) lattices
Discrete Mathematics
Computing iceberg concept lattices with TITANIC
Data & Knowledge Engineering
Concepts in fuzzy scaling theory: order and granularity
Fuzzy Sets and Systems - Possibility theory and fuzzy logic
Formal concept analysis for general objects
Discrete Applied Mathematics - Special issue: The 1998 conference on ordinal and symbolic data analysis (OSDA '98)
Monotone concepts for formal concept analysis
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
A review of ontology based query expansion
Information Processing and Management: an International Journal
Delving source code with formal concept analysis
Computer Languages, Systems and Structures
Hi-index | 0.00 |
One of the most important tasks of search engines is presenting more additional relevant web pages and reducing those pages which are useless for users. Query expansion is an efficient method for dealing with this task. In this paper, variable precision concept(VPC) based on formal concept analysis(FCA) is firstly proposed and its properties are discussed. Then a new strategy of expanding query terms based on VPC is proposed. According to this new strategy, users can set the query precision in terms of their interests and obtain the additional relevance web pages. Finally, application results show the efficiency and effectiveness of this method.