Finite Confluences and Closed Pattern Mining

The purpose of this article is to propose and investigate a partial order structure weaker than the lattice structure and which have nice properties regarding closure operators. We extend accordingly closed pattern mining and formal concept analysis to such structures we further call confluences. The primary motivation for investigating these structures is that it allows to reduce a lattice to a part whose elements are connected, as in some graph, still preserving a useful characterization of closure operators. Our investigation also considers how reducing one of the lattice involved in a Galois connection affects the structure of the closure operators ranges. When extending this way formal concept analysis we will focus on the intensional space, i.e. in reducing the pattern language, while recent investigations rather explored the reduction of the extensional space to connected elements.

[1]  Henry Soldano,et al.  Local Knowledge Discovery in Attributed Graphs , 2015, 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI).

[2]  Hiroki Arimura,et al.  Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems , 2009, SDM.

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

[4]  Karell Bertet,et al.  The multiple facets of the canonical direct unit implicational basis , 2010, Theor. Comput. Sci..

[5]  Henry Soldano,et al.  Extensional Confluences and Local Closure Operators , 2015, ICFCA.

[6]  Bernhard Ganter,et al.  Pattern Structures and Their Projections , 2001, ICCS.

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

[8]  Gordon Plotkin,et al.  A Further Note on Inductive Generalization , 2008 .

[9]  Alexandre Termier,et al.  ParaMiner: a generic pattern mining algorithm for multi-core architectures , 2014, Data Mining and Knowledge Discovery.

[10]  Nathalie Pernelle,et al.  ZooM: a nested Galois lattices-based system for conceptual clustering , 2002, J. Exp. Theor. Artif. Intell..

[11]  Henry Soldano,et al.  Abstract Concept Lattices , 2011, ICFCA.

[12]  Nicolas Pasquier,et al.  Efficient Mining of Association Rules Using Closed Itemset Lattices , 1999, Inf. Syst..

[13]  Henry Soldano,et al.  Graph abstraction for closed pattern mining in attributed networks , 2014, ECAI.

[14]  Henry Soldano,et al.  Closed Patterns and Abstraction Beyond Lattices , 2014, ICFCA.

[15]  Stefan Wrobel,et al.  Listing closed sets of strongly accessible set systems with applications to data , 2010, LWA.

[16]  Cherif Chiraz Latiri,et al.  LC-mine: a framework for frequent subgraph mining with local consistency techniques , 2014, Knowledge and Information Systems.

[17]  Jean Sallantin,et al.  Structural Machine Learning with Galois Lattice and Graphs , 1998, ICML.

[18]  T. Blyth.  Lattices and Ordered Algebraic Structures , 2005 .

[19]  Alexander Borgida,et al.  Computing Least Common Subsumers in Description Logics , 1992, AAAI.

[20]  G. Polaillon.  Interpretation and Reduction of Galois Lattices of Complex Data , 1998 .

[21]  Edwin Diday,et al.  Maximal and Stochastic Galois Lattices , 2003, Discret. Appl. Math..

[22]  Gerd Stumme,et al.  Generating a Condensed Representation for Association Rules , 2005, Journal of Intelligent Information Systems.

[23]  Bernard Monjardet,et al.  The Lattices of Closure Systems, Closure Operators, and Implicational Systems on a Finite Set: A Survey , 2003, Discret. Appl. Math..

[24]  Sergei O. Kuznetsov,et al.  Learning Closed Sets of Labeled Graphs for Chemical Applications , 2005, ILP.

[25]  Jiawei Han,et al.  Mining closed relational graphs with connectivity constraints , 2005, 21st International Conference on Data Engineering (ICDE'05).