A learning model is considered in terms of formal concept analysis (FCA). This model is generalized for objects represented by sets of graphs with partially ordered labels of vertices and edges (these graphs can be considered as simple conceptual graphs). An algorithm that computes all concepts and the linear (Hasse) diagram of the concept lattice in time linear with respect to the number of concepts is presented. The linear diagram gives the structure of the set of all concepts with respect to the partial order on them and provides a useful tool for browsing or discovery of implications (associations) in data.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- Learning of Simple Conceptual Graphs from Positive and Negative Examples
Sergei O. Kuznetsov
- Springer Berlin Heidelberg