Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 275679, 13 pages
Research Article

Deep First Formal Concept Search

1School of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China
2School of Electrical Engineering, Yanshan University, Qinhuangdao 066004, China
3College of Foreign Languages, Yanshan University, Qinhuangdao 066004, China

Received 11 June 2014; Accepted 21 July 2014; Published 31 August 2014

Academic Editor: Yunqiang Yin

Copyright © 2014 Tao Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.