Deep First Formal Concept Search

The calculation of formal concepts is a very important part in the theory of formal concept analysis (FCA); however, within the framework of FCA, computing all formal concepts is the main challenge because of its exponential complexity and difficulty in visualizing the calculating process. With the basic idea of Depth First Search, this paper presents a visualization algorithm by the attribute topology of formal context. Limited by the constraints and calculation rules, all concepts are achieved by the visualization global formal concepts searching, based on the topology degenerated with the fixed start and end points, without repetition and omission. This method makes the calculation of formal concepts precise and easy to operate and reflects the integrity of the algorithm, which enables it to be suitable for visualization analysis.

[1]  Anna Formica,et al.  Semantic Web search based on rough sets and Fuzzy Formal Concept Analysis , 2012, Knowl. Based Syst..

[2]  Bingru Yang,et al.  A Frequent Pattern Mining Algorithm Based on Concept Lattice , 2013 .

[3]  Takanari Tanabata,et al.  An Algorithm for Recomputing Concepts in Microarray Data Analysis by Biological Lattice , 2013, J. Adv. Comput. Intell. Intell. Informatics.

[4]  Hong Wang,et al.  Attribute Reduction of Intuitionistic Fuzzy Concept Lattices , 2015 .

[5]  Amedeo Napoli,et al.  Mining gene expression data with pattern structures in formal concept analysis , 2011, Inf. Sci..

[6]  Yang Bingru,et al.  Frequent Itemsets Mining Based on Concept Lattice and Sliding Window , 2013 .

[7]  Yang Bingru,et al.  An Algorithm on Generating Lattice Based on Layered Concept Lattice , 2013 .

[8]  Lei Zhang,et al.  An Incremental Algorithm for Removing Object from Concept Lattice , 2013 .

[9]  Lambrini Seremeti,et al.  Yoneda Philosophy in Engineering , 2013 .

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

[11]  Yang Xu,et al.  A Combination Algorithm of Multiple Lattice-Valued Concept Lattices , 2013, Int. J. Comput. Intell. Syst..

[12]  Hareton K. N. Leung,et al.  Combining concept lattice with call graph for impact analysis , 2012, Adv. Eng. Softw..

[13]  Bernhard Ganter,et al.  Formal Concept Analysis , 2013 .

[14]  Xiaomin Wang,et al.  A CALCULATION OF FORMAL CONCEPT BY ATTRIBUTE TOPOLOGY , 2013 .

[15]  Yafeng Yang,et al.  Parallel Construction of Variable Precision Concept Lattice in Fuzzy Formal Context , 2013 .

[16]  Yajun Du,et al.  Semantic ranking of web pages based on formal concept analysis , 2013, J. Syst. Softw..

[17]  Veera Boonjing,et al.  A new case-based classification using incremental concept lattice knowledge , 2013, Data Knowl. Eng..

[18]  Tarek Abudawood,et al.  Improving Predictions of Multiple Binary Models in ILP , 2014, TheScientificWorldJournal.

[19]  Zhang Hongli,et al.  Theory and Algorithms of Attribute Decrement for Concept Lattice , 2013 .

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

[21]  Xiangping Kang,et al.  Research on domain ontology in different granulations based on concept lattice , 2012, Knowl. Based Syst..

[22]  Xi Gong A Novel Incorporate Algorithm of Concept Lattice , 2012 .

[23]  Frano Skopljanac-Macina,et al.  Formal Concept Analysis – Overview and Applications , 2014 .

[24]  Bixin Li,et al.  FCA-CIA: An approach of using FCA to support cross-level change impact analysis for object oriented Java programs , 2013, Inf. Softw. Technol..

[25]  Zhang Ta Attribute Topology of Formal Context , 2014 .