A completeness analysis of frequent weighted concept lattices and their algebraic properties

Frequent weighted concept lattice (FWCL) is an interesting version of the WCL (weighted concept lattice), which helps realize knowledge extraction in a more efficient way. One of the open issues is that the completeness of FWCL cannot be ensured (namely, some nodes would be removed since their intent weights are lower than intent importance thresholds specified by the user, so that it can occur that the supremum of their parent nodes or the infimum of their child nodes might not exist). In this study, we first introduce a virtual node into the structure of FWCL to retain the completeness of FWCL. Next, an algebraic system of FWCL is presented by introducing two operations, which form the least frequent upper bound and the greatest frequent lower bound of the FWCL. Finally, we discuss some algebraic properties of FWCL and prove its completeness of knowledge representation in this way providing the theoretical foundations for applications of WCL.

[1]  Sulan Zhang,et al.  A concept lattice based outlier mining method in low-dimensional subspaces , 2009, Pattern Recognit. Lett..

[2]  Zhang Ji-fu.  Intension Weight Value Acquisition of Weighted Concept Lattice Based on Information Entropy and Deviance , 2011 .

[3]  Xia Wang,et al.  Relations of attribute reduction between object and property oriented concept lattices , 2008, Knowl. Based Syst..

[4]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[5]  Jihoon Kim,et al.  Concept lattices for visualizing and generating user profiles for context-aware service recommendations , 2009, Expert Syst. Appl..

[6]  Kamran Sartipi,et al.  Dynamic Knowledge Extraction from Software Systems Using Sequential Pattern Mining , 2010, Int. J. Softw. Eng. Knowl. Eng..

[7]  Jorge Lobo,et al.  Mining Roles with Multiple Objectives , 2010, TSEC.

[8]  Petko Valtchev,et al.  Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice , 2009, ICFCA.

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

[10]  Didier Dubois,et al.  Possibility theory and formal concept analysis: Characterizing independent sub-contexts , 2012, Fuzzy Sets Syst..

[11]  Mohammed J. Zaki,et al.  Efficient algorithms for mining closed itemsets and their lattice structure , 2005, IEEE Transactions on Knowledge and Data Engineering.

[12]  Bijan Davvaz,et al.  Rough set theory applied to lattice theory , 2012, Inf. Sci..

[13]  Zhang Ji.  Weighted Concept Lattice and Incremental Construction , 2005 .

[14]  Yiyu Yao,et al.  A multiview approach for intelligent data analysis based on data operators , 2008, Inf. Sci..

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

[16]  Derrick G. Kourie,et al.  AddIntent: A New Incremental Algorithm for Constructing Concept Lattices , 2004, ICFCA.

[17]  Ruud W. van der Pol,et al.  Dipe-R: a knowledge representation language , 2003, Data Knowl. Eng..

[18]  Rokia Missaoui,et al.  INCREMENTAL CONCEPT FORMATION ALGORITHMS BASED ON GALOIS (CONCEPT) LATTICES , 1995, Comput. Intell..

[19]  Wang Xin.  A Batch Constructing Algorithm of Frequent Weighted Concept Lattice , 2010 .

[20]  Jean-Luc Marichal,et al.  Weighted lattice polynomials , 2007, Discret. Math..

[21]  Cherukuri Aswani Kumar,et al.  Knowledge discovery in data using formal concept analysis and random projections , 2011, Int. J. Appl. Math. Comput. Sci..

[22]  Vincenzo Loia,et al.  Hierarchical web resources retrieval by exploiting Fuzzy Formal Concept Analysis , 2012, Inf. Process. Manag..

[23]  Ping Wang,et al.  Encoding multiple inheritance hierarchies for lattice operations , 2004, Data Knowl. Eng..

[24]  Lhouari Nourine,et al.  Representing lattices using many-valued relations , 2009, Inf. Sci..

[25]  Yee Leung,et al.  Granular Computing and Knowledge Reduction in Formal Contexts , 2009, IEEE Transactions on Knowledge and Data Engineering.

[26]  Pablo Moscato,et al.  Mining disjunctive minimal generators with TitanicOR , 2012, Expert Syst. Appl..

[27]  Ch. Aswanikumar,et al.  Concept lattice reduction using fuzzy K-Means clustering , 2010, Expert Syst. Appl..

[28]  Rudolf Wille,et al.  Formal Concept Analysis as Mathematical Theory of Concepts and Concept Hierarchies , 2005, Formal Concept Analysis.

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

[30]  Derrick G. Kourie,et al.  An incremental algorithm to construct a lattice of set intersections , 2009, Sci. Comput. Program..