FARM: An FCA-based Association Rule Miner

Abstract Association rule mining is a well-researched and widely applied data mining technique for discovering regularities between items in a dataset. An association rule consists of an antecedent and a consequent with two measures, named support and confidence, which indicate how valuable the rule is. For several decades, intensive studies have been made on efficient association rule mining methods aiming to reduce rule-extraction time and to prevent generation of redundant rules. By incorporating negation and disjunction operators into antecedents, our study offers richer expressive power in describing user interests as antecedents, which in turn translates into more valuable association rules whose consequents match the expressed user interests. This study consists of three components: (1) a conceptual model, called plant , that represents necessary constituents for the proposed extended association rules; (2) three algorithms, called CULTIVATION algorithm family , that demonstrate how the extended association rule is processed within the model; (3) a full-fledged Java-based system, called FARM (FCA-based Association Rule Miner), that is a computerized implementation of our approach. Finally, in order to verify the efficiency and usefulness of our approach, experiments were carried out that compared the approach with extant representative methods.

[1]  Sadok Ben Yahia,et al.  GenAll Algorithm: Decorating Galois lattice with minimal generators , 2005, CLA.

[2]  Sadok Ben Yahia,et al.  Prince: An Algorithm for Generating Rule Bases Without Closure Computations , 2005, DaWaK.

[3]  Jonas Poelmans,et al.  Formal Concept Analysis in Knowledge Discovery: A Survey , 2010, ICCS.

[4]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[5]  Andreas Hotho,et al.  Mining Association Rules in Folksonomies , 2006, Data Science and Classification.

[6]  Rafael Berlanga Llavori,et al.  Finding association rules in semantic web data , 2012, Knowl. Based Syst..

[7]  Eugene F. Krause Maximizing the Product of Summands; Minimizing the Sum of Factors , 1996 .

[8]  Olivier Ridoux,et al.  A Parameterized Algorithm to Explore Formal Contexts with a Taxonomy , 2008, Int. J. Found. Comput. Sci..

[9]  O. Ridoux,et al.  Introduction to logical information systems , 2004, Inf. Process. Manag..

[10]  Jilles Vreeken,et al.  Krimp: mining itemsets that compress , 2011, Data Mining and Knowledge Discovery.

[11]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[12]  Engelbert Mephu Nguifo,et al.  Towards a Finer Assessment of Extraction Contexts Sparseness , 2007, 18th International Workshop on Database and Expert Systems Applications (DEXA 2007).

[13]  Yang Huang,et al.  A Linear Delay Algorithm for Building Concept Lattices , 2008, CPM.

[14]  Rokia Missaoui,et al.  A framework for incremental generation of closed itemsets , 2008, Discret. Appl. Math..

[15]  Ramakrishnan Srikant,et al.  Mining Association Rules with Item Constraints , 1997, KDD.

[16]  Siu Cheung Hui,et al.  An Effective Clustering-based Approach for Conceptual Association Rules Mining , 2009, 2009 IEEE-RIVF International Conference on Computing and Communication Technologies.

[17]  Haiming Li,et al.  A New Strategy of Query Expansion using Formal Concept Analysis , 2006, The Sixth IEEE International Conference on Computer and Information Technology (CIT'06).

[18]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[19]  Anthony J. T. Lee,et al.  Mining spatial association rules in image databases , 2007, Inf. Sci..

[20]  Michael I. Jordan,et al.  Advanced tools for operators at amazon.com , 2006 .

[21]  Claudio Carpineto,et al.  Concept data analysis - theory and applications , 2004 .

[22]  Nicolas Spyratos,et al.  Preference-Based Query Tuning Through Refinement/Enlargement in a Formal Context , 2006, FoIKS.

[23]  Hong-Gee Kim,et al.  Query-based association rule mining supporting user perspective , 2011, Computing.

[24]  Tzung-Pei Hong,et al.  A lattice-based approach for mining most generalization association rules , 2013, Knowl. Based Syst..

[25]  Damian Dudek RMAIN: Association rules maintenance without reruns through data , 2009, Inf. Sci..

[26]  Gerd Stumme,et al.  Computing iceberg concept lattices with T , 2002, Data Knowl. Eng..

[27]  Engelbert Mephu Nguifo,et al.  Succinct System of Minimal Generators: A Thorough Study, Limitations and New Definitions , 2006, CLA.

[28]  Mohammed J. Zaki,et al.  CHARM: An Efficient Algorithm for Closed Itemset Mining , 2002, SDM.

[29]  Sébastien Ferré,et al.  Camelis: a logical information system to organise and browse a collection of documents , 2009, Int. J. Gen. Syst..