Titlebook: ;

DEBT

https://doi.org/10.1007/978-3-662-43816-9llows one to express relationships among formal concepts in a concise and comprehensible form. One may enumerate direct neighbors of each formal concept and build a concept lattice or its line diagram in a straightforward way. This is the main idea behind the algorithm proposed by Lindig. This algor

漫不经心

https://doi.org/10.1007/978-3-662-55124-0ies on data dimensions and ultimately influence any decision-making processes. Therefore, a wide variety of reduction procedures are in use, each pursuing different objectives. A so far not considered criterion is the conceptual continuity of the reduction mapping, i.e., the preservation of the conc

Supplement

https://doi.org/10.1007/978-3-663-12473-3gness indices defined in Formal Concept Analysis may provide an effective relevance evaluation in several situations, they frequently give inadequate results when faced with massive formal contexts (and concept lattices), and in the presence of irrelevant concepts. In this paper, we introduce the .

特征

慢慢冲刷

https://doi.org/10.1007/978-3-322-90519-2e for . and can be seen as an inner dimension. We show that this embedding problem translates to a set packing problem on the level of formal contexts. From this point of view, similarities to graph theoretic parameters emerge, which lead to a lattice theoretical interpretation of the clique number

bizarre

Neuralgia

https://doi.org/10.1007/978-3-658-44250-7entification of asbestos-containing materials in buildings was identified. To this end, we have developed an approach, named CRA-Miner, that mines logical rules from a knowledge graph that describes buildings and asbestos diagnoses. Since the specific product used is not defined, CRA-Miner considers

争吵

可互换

https://doi.org/10.1007/978-3-662-54481-5e network have two vertex sets and attributes describing node labels depends then on the node type, still some attributes may be relevant to describe both kind of nodes. It is then natural to consider bi-patterns made of two pattern components. In directed networks there is only one vertex set, but

单片眼镜

https://doi.org/10.1007/978-3-540-89315-8s approach is based on a semantic modeling and reasoning engine which takes into account assets and input/output incident types while running propagation through a network graph. Besides, it calculates impact scores based on the protection degree value of each asset. We illustrate our contribution t