title: Deep first formal concept search.
abstract: 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.
authors.affiliation: School of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China.
authors.forename: Tao
authors.initials: T
authors.lastname: Zhang
authors.affiliation: School of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China.
authors.forename: Hui
authors.initials: H
authors.lastname: Li
authors.affiliation: School of Electrical Engineering, Yanshan University, Qinhuangdao 066004, China.
authors.forename: Wenxue
authors.initials: W
authors.lastname: Hong
authors.affiliation: College of Foreign Languages, Yanshan University, Qinhuangdao 066004, China.
authors.forename: Xiamei
authors.initials: X
authors.lastname: Yuan
authors.affiliation: School of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China.
authors.forename: Xinyu
authors.initials: X
authors.lastname: Wei
mesh_terms: D000465:Algorithms; D003210:Concept Formation; D057225:Data Mining / Q000379:methods*; D055641:Mathematical Concepts; D008962:Models, Theoretical; D015203:Reproducibility of Results