Interface between Logical Analysis of Data and Formal Concept Analysis

被引：13
作者：
Janostik, Radek [1 ]
Konecny, Jan [1 ]
Krajca, Petr [1 ]
机构：
[1] Palacky Univ, Dept Comp Sci, Olomouc 17 Listopadu 12, CZ-77146 Olomouc, Czech Republic
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2020年 / 284卷 / 02期
关键词：
Data Science; Formal Concept Analysis; Logical Analysis of Data; Hypothesis generation; Combinatorial optimization; CONCEPT LATTICES; NEGATIVE ATTRIBUTES; FAST ALGORITHM; CONSTRUCTION; INFORMATION; HYPOTHESES; COMPLEXITY; REDUCTION; STABILITY; PATTERNS;
D O I：
10.1016/j.ejor.2020.01.015
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
Logical Analysis of Data and Formal Concept Analysis are separately developed methodologies based on different mathematical foundations. We show that the two methodologies utilize the same basic building blocks. That enables us to develop an interface between the two methodologies. We provide some preliminary benefits of the interface; most notably efficient algorithms for computing spanned patterns in Logical Analysis of Data using algorithms of Formal Concept Analysis. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页码：792 / 800
页数：9
相关论文
共 71 条
[1]   Spanned patterns for the logical analysis of data [J].
Alexe, G ;
Hammer, PL .
DISCRETE APPLIED MATHEMATICS, 2006, 154 (07) :1039-1049
[2]   Comprehensive vs. comprehensible classifiers in logical analysis of data [J].
Alexe, Gabriela ;
Alexe, Sorin ;
Hammer, Peter L. ;
Kogan, Alexander .
DISCRETE APPLIED MATHEMATICS, 2008, 156 (06) :870-882
[3]   Logical analysis of data - the vision of Peter L. Hammer [J].
Alexe, Gabriela ;
Alexe, Sorin ;
Bonates, Tiberius O. ;
Kogan, Alexander .
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2007, 49 (1-4) :265-312
[4]   Coronary risk prediction by logical analysis of data [J].
Alexe, S ;
Blackstone, E ;
Hammer, PL ;
Ishwaran, H ;
Lauer, MS ;
Snader, CEP .
ANNALS OF OPERATIONS RESEARCH, 2003, 119 (1-4) :15-42
[5]   Making Use of Empty Intersections to Improve the Performance of CbO-Type Algorithms [J].
Andrews, Simon .
FORMAL CONCEPT ANALYSIS, ICFCA 2017, 2017, 10308 :56-71
[6]   A 'Best-of-Breed' approach for designing a fast algorithm for computing fixpoints of Galois Connections [J].
Andrews, Simon .
INFORMATION SCIENCES, 2015, 295 :633-649
[7]  
Andrews S, 2011, LECT NOTES ARTIF INT, V6828, P50, DOI 10.1007/978-3-642-22688-5_4
[8]  
[Anonymous], P INT C CONC LATT TH
[9]  
[Anonymous], 1999, FORMAL CONCEPT ANAL
[10]  
[Anonymous], P IFSR INT SERIES SY
12345678