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.

A Link Prediction Algorithm Based on GAN

“…In the process of random walk, an offset parameter is set, and the search mode of the model is controlled by the size adjustment the offset parameter, which is biased towards width-first search [17] or depth-first search [18]. In 2018, Wang et al proposed the GraphGAN [19] algorithm, which is represented by the low-dimensional vector of the vertex in the network graph of generative confrontation network learning.…”

“…(3) First-order proximity [19]: The first-order proximity in the network represents the local similarity between two vertices. For two vertices u and v, if there are edges (u, v) between them, then vertices u and v have first-order proximity.…”

“…(4) Second-order proximity [19]: The second-order proximity between a pair of vertices in a network is the similarity between their neighborhood network structures. If two vertices u and v have the same neighbor node, then vertices u and v have second-order proximity.…”

Attribute Topology and Concept Lattice Bridged by Concept Tree

“…To solve this problem, the Attribute Topology representation for formal context [6] is proposed. Fatherly, in order to compute concept fast, sub topology spilled algorithm [7] and deep first search algorithm are proposed [8]. AT has been applied into actual engineer such as blog data analysis [9][10].…”