Affiliation:
1. Luoyang Normal University
Abstract
In the form of background in the form of concept partial relation to the corresponding concept lattice, concept lattice is the core data structure of formal concept analysis. Association rule mining process includes two phases: first find all the frequent itemsets in data collection, Second it is by these frequent itemsets to generate association rules. This paper analyzes the association rule mining algorithms, such as Apriori and FP-Growth. The paper presents the construction search engine based on formal concept analysis and association rule mining. Experimental results show that the proposed algorithm has high efficiency.
Publisher
Trans Tech Publications, Ltd.
Reference6 articles.
1. Ganter B, Wille R. Formal Concept Analysis: Mathematical Foundations [M]. Springer Verlag , Berlin, (1999).
2. C.H. Cai, W.C. Fu Ada, C.H. Cheng, W.W. Kwong. Mining association rules with weighted items．In Proc. of the Int'l Database Engineering and Applications Symposium. 1998. 68～77.
3. Ho T B. Incremental conceptual clustering in the framework of Galois lattice, in KDD: Techniques and Applications, H. Lu, H. Motoda and H. Luu (Eds. ), World Scientific, 1997. 49-64.
4. Wang L-D., Liu X-D. Concept analysis via rough set and AFS algebra Information Sciences 2008, 178(21), 4125-4137.
5. Anderson, B. and Moore, A. Adtrees for fast counting and for fast learning of association rules. KDD-98. USA. (1998).