Machine learning on the basis of formal concept analysis

被引:62
作者
Kuznetsov, SO [1 ]
机构
[1] All Russia Inst Sci & Tech Informat, Moscow, Russia
关键词
D O I
10.1023/A:1012435612567
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A model of machine learning from positive and negative examples (JSM-learning) is described in terms of Formal Concept Analysis (FCA). Graph-theoretical and lattice-theoretical interpretations of hypotheses and classifications resulting in the learning are proposed. Hypotheses and classifications are compared with other objects from domains of data analysis and artificial intelligence: implications in FCA, functional dependencies in the theory of relational data bases, abduction models, version spaces, and decision trees. Results about algorithmic complexity of various problems related to the generation of formal concepts, hypotheses. classifications, and implications.
引用
收藏
页码:1543 / 1564
页数:22
相关论文
共 73 条
[1]  
[Anonymous], 1993, EFFICIENT ALGORITHMS
[2]  
[Anonymous], 1978, REV ROUM MATH PURE A
[3]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[4]  
[Anonymous], 1991, METHOD ITOGI NAUKI T
[5]  
[Anonymous], 1984, 831 FB4 TH DARMST
[6]  
[Anonymous], 1991, MATHEMATIQUES INFORM
[7]  
ANSHAKOV OM, 1989, STUDIA LOGICA, V25, P23
[8]  
Armstrong W. W., 1974, INT FEDERATION INFOR, V74, P580
[9]  
Barbut M., 1970, Ordre et classification. Algebre et Combinatoire, VII
[10]  
Birkhoff G., 1979, LATTICE THEORY, V3