The use of cluster hierarchies in hypertext information retrieval
HYPERTEXT '89 Proceedings of the second annual ACM conference on Hypertext
Fast discovery of association rules
Advances in knowledge discovery and data mining
Extended Boolean information retrieval
Communications of the ACM
A vector space model for automatic indexing
Communications of the ACM
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
Proceedings of the 17th International Conference on Data Engineering
Mining Non-Redundant Association Rules
Data Mining and Knowledge Discovery
Bioinformatics
New fast algorithm for constructing concept lattice
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
Formal concept analysis in knowledge discovery: a survey
ICCS'10 Proceedings of the 18th international conference on Conceptual structures: from information to intelligence
An improved association rules mining method
Expert Systems with Applications: An International Journal
A novel attribute reduction approach based on the object oriented concept lattice
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Semantic ranking of web pages based on formal concept analysis
Journal of Systems and Software
Analysis of association rule mining on quantitative concept lattice
AICI'12 Proceedings of the 4th international conference on Artificial Intelligence and Computational Intelligence
A new parallel association rule mining algorithm on distributed shared memory system
International Journal of Business Intelligence and Data Mining
Rule acquisition and complexity reduction in formal decision contexts
International Journal of Approximate Reasoning
An approach for selecting seed URLs of focused crawler based on user-interest ontology
Applied Soft Computing
Editorial: A topic-specific crawling strategy based on semantics similarity
Data & Knowledge Engineering
| Hi-index | 0.00 |
To avoid returning irrelevant web pages for search engine results, technologies that match user queries to web pages have been widely developed. In this study, web pages for search engine results are classified as low-adjacence (each web page includes all query keywords) or high-adjacence (each web page includes some of the query keywords) sets. To match user queries with web pages using formal concept analysis (FCA), a concept lattice of the low-adjacence set is defined and the non-redundancy association rules defined by Zaki for the concept lattice are extended. OR- and AND-RULEs between non-query and query keywords are proposed and an algorithm and mining method for these rules are proposed for the concept lattice. The time complexity of the algorithm is polynomial. An example illustrates the basic steps of the algorithm. Experimental and real application results demonstrate that the algorithm is effective.