Granularity of attributes in formal concept analysis

被引:44
作者
Belohlavek, Radim [1 ]
De Baets, Bernard [2 ]
Konecny, Jan [1 ]
机构
[1] Palacky Univ, Dept Comp Sci, CR-77147 Olomouc, Czech Republic
[2] Univ Ghent, Dept Math Modelling Stat & Bioinformat, B-9000 Ghent, Belgium
关键词
Formal concept analysis; Concept lattice; Binary data; Algorithms for data management; Interactive data exploration; CLASS HIERARCHIES;
D O I
10.1016/j.ins.2013.10.021
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We propose a method to control the structure of concept lattices derived from Boolean data. Concept lattices represent the basic structure utilized in formal concept analysis. Their structure is of primary importance for the analysis and understanding of the input data. Our method enables to control the structure of the derived concept lattice by specifying granularity levels of attributes, thus in a sense by focusing the lenses through which we perceive and conceptually carve up the world. The granularity levels are chosen by a user based on his expertise and experimentation with the data. If the resulting formal concepts are too specific and there is a large number of them, the user can choose to use a coarser level of granularity. The resulting formal concepts are then less specific and can be seen as resulting from a zoom-out. In a similar. way, one may perform a zoom-in to obtain finer, more specific formal concepts. The paper presents a basic study of this topic. We describe the motivations, the method, a theoretical insight, zoom-in and zoom-out algorithms, and experiments demonstrating the method. (C) 2013 Elsevier Inc. All rights reserved.
引用
收藏
页码:149 / 170
页数:22
相关论文
共 24 条
  • [1] [Anonymous], 2012, Formal concept analysis: mathematical foundations
  • [2] [Anonymous], 1983, The Theory of Relational Database
  • [3] Belohlavek R., 2002, FUZZY RELATIONAL SYS
  • [4] Evaluation of IPAQ questionnaires supported by formal concept analysis
    Belohlavek, Radim
    Sigmund, Erik
    Zacpal, Jiri
    [J]. INFORMATION SCIENCES, 2011, 181 (10) : 1774 - 1786
  • [5] Discovery of optimal factors in binary data via a novel method of matrix decomposition
    Belohlavek, Radim
    Vychodil, Vilem
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2010, 76 (01) : 3 - 20
  • [6] Formal Concept Analysis With Background Knowledge: Attribute Priorities
    Belohlavek, Radim
    Vychodil, Vilem
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 2009, 39 (04): : 399 - 409
  • [7] Carpineto C., 2004, CONCEPT DATA ANAL TH, V1st, P155
  • [8] Improvement of precision and recall for information retrieval in a narrow domain: Reuse of concepts by Formal Concept Analysis
    Cho, WC
    Richards, D
    [J]. IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE (WI 2004), PROCEEDINGS, 2004, : 370 - 376
  • [9] Dekel U., 2003, ACM SIGPLAN OOPSLA03, P288
  • [10] Frank A., 2010, UCI machine learning repository, V213