Zhang Tao, Li Hui, Hong Wenxue, Yuan Xiamei, Wei Xinyu
School of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China.
School of Electrical Engineering, Yanshan University, Qinhuangdao 066004, China.
ScientificWorldJournal. 2014;2014:275679. doi: 10.1155/2014/275679. Epub 2014 Aug 31.
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.
形式概念的计算是形式概念分析（FCA）理论中非常重要的一部分；然而，在FCA框架内，计算所有形式概念是主要挑战，因为其具有指数级复杂性且计算过程难以可视化。基于深度优先搜索的基本思想，本文提出了一种基于形式背景属性拓扑的可视化算法。受限于约束条件和计算规则，通过可视化全局形式概念搜索，基于固定起点和终点退化的拓扑结构，无重复无遗漏地实现所有概念。该方法使形式概念的计算精确且易于操作，体现了算法的完整性，使其适用于可视化分析。
