Concept and Attribute Reduction Based on Rectangle Theory of Formal Concept

Based on rectangle theory of formal concept and set covering theory, the concept reduction preserving binary relations is investigated in this paper. It is known that there are three types of formal concepts: core concepts, relative necessary concepts and unnecessary concepts. First, we present the new judgment results for relative necessary concepts and unnecessary concepts. Second, we derive the bounds for both the maximum number of relative necessary concepts and the maximum number of unnecessary concepts and it is a difficult problem as either in concept reduction preserving binary relations or attribute reduction of decision formal contexts, the computation of formal contexts from formal concepts is a challenging problem. Third, based on rectangle theory of formal concept, a fast algorithm for reducing attributes while preserving the extensions for a set of formal concepts is proposed using the extension bit-array technique, which allows multiple context cells to be processed by a single 32-bit or 64-bit operator. Technically, the new algorithm could store both formal context and extent of a concept as bit-arrays, and we can use bit-operations to process set operations ”or” as well as ”and”. One more merit is that the new algorithm does not need to consider other concepts in the concept lattice, thus the algorithm is explicit to understand and fast. Experiments demonstrate that the new algorithm is effective in the computation of attribute reductions.

[1]  Theresa Beaubouef,et al.  Rough Sets , 2019, Lecture Notes in Computer Science.

[2]  Daqiang Zhang,et al.  Using Concept Lattice for Personalized Recommendation System Design , 2017, IEEE Systems Journal.

[3]  Ming-Wen Shao,et al.  Knowledge reduction in formal fuzzy contexts , 2015, Knowl. Based Syst..

[4]  Dan Meng,et al.  Formal concept analysis based on the topology for attributes of a formal context , 2013, Inf. Sci..

[5]  Dan Corbett,et al.  A basic mathematical framework for conceptual graphs , 2006, IEEE Transactions on Knowledge and Data Engineering.

[6]  Lotfi A. Zadeh,et al.  Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic , 1997, Fuzzy Sets Syst..

[7]  Wen-Xiu Zhang,et al.  Attribute reduction theory and approach to concept lattice , 2007, Science in China Series F: Information Sciences.

[8]  Wen-Xiu Zhang,et al.  Attribute Reduction in Concept Lattice Based on Discernibility Matrix , 2005, RSFDGrC.

[9]  Jinhai Li,et al.  On inference rules in decision formal contexts , 2015, Int. J. Comput. Intell. Syst..

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

[11]  Jinhai Li,et al.  Incomplete decision contexts: Approximate concept construction, rule acquisition and knowledge reduction , 2013, Int. J. Approx. Reason..

[12]  Yiyu Yao,et al.  Concept lattices in rough set theory , 2004, IEEE Annual Meeting of the Fuzzy Information, 2004. Processing NAFIPS '04..

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

[14]  QianTing,et al.  The connections between three-way and classical concept lattices , 2016 .

[15]  Ling Wei,et al.  The connections between three-way and classical concept lattices , 2016, Knowl. Based Syst..

[16]  Petr Osicka,et al.  Algorithms for Computation of Concept Trilattice of Triadic Fuzzy Context , 2012, IPMU.

[17]  Wei Liu,et al.  Computing the set of concepts through the composition and decomposition of formal contexts , 2012, 2012 International Conference on Machine Learning and Cybernetics.

[18]  Yuanliang Wang,et al.  Using Formal Concept Analysis to Identify Negative Correlations in Gene Expression Data , 2016, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[19]  Robert LIN,et al.  NOTE ON FUZZY SETS , 2014 .

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

[21]  Sergei O. Kuznetsov.  On Computing the Size of a Lattice and Related Decision Problems , 2001, Order.

[22]  A ZadehLotfi.  Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic , 1997 .

[23]  Vilém Vychodil,et al.  Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data , 2012, Inf. Sci..

[24]  P. Alam.  ‘A’ , 2021, Composites Engineering: An A–Z Guide.

[25]  Camille Roth,et al.  Reducing the Representation Complexity of Lattice-Based Taxonomies , 2007, ICCS.

[26]  Ling Wei,et al.  Concept reduction and concept characteristics in formal concept analysis , 2020, SCIENTIA SINICA Informationis.

[27]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[28]  Qing Wan,et al.  Approximate concepts acquisition based on formal contexts , 2015, Knowl. Based Syst..

[29]  Ling Wei,et al.  The attribute reductions of three-way concept lattices , 2016, Knowledge-Based Systems.

[30]  Bin Xie,et al.  Attribute reduction based on maximal rules in decision formal context , 2014, Int. J. Comput. Intell. Syst..

[31]  Jonas Poelmans,et al.  Text Mining Scientific Papers: A Survey on FCA-Based Information Retrieval Research , 2012, ICDM.

[32]  Claudio Carpineto,et al.  A lattice conceptual clustering system and its application to browsing retrieval , 2004, Machine Learning.

[33]  Xiao Zhang,et al.  Rule-preserved object compression in formal decision contexts using concept lattices , 2014, Knowl. Based Syst..

[34]  Simon Andrews,et al.  A 'Best-of-Breed' approach for designing a fast algorithm for computing fixpoints of Galois Connections , 2015, Inf. Sci..