Fast factorization by similarity in formal concept analysis of data with fuzzy attributes

  • Authors:
  • Radim Belohlavek;Jiří Dvořák;Jan Outrata

  • Affiliations:
  • Department of Systems Science and Industrial Engineering, Binghamton University, SUNY, Binghamton, NY 13902, USA and Department of Computer Science, Palacký University, Tomkova 40, CZ-779 00 ...;Department of Computer Science, Palacký University, Tomkova 40, CZ-779 00 Olomouc, Czech Republic;Department of Computer Science, Palacký University, Tomkova 40, CZ-779 00 Olomouc, Czech Republic

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a method of fast factorization in formal concept analysis (FCA) of data with fuzzy attributes. The output of FCA consists of a partially ordered collection of clusters extracted from a data table describing objects and their attributes. The collection is called a concept lattice. Factorization by similarity enables us to obtain, instead of a possibly large concept lattice, its factor lattice. The elements of the factor lattice are maximal blocks of clusters which are pairwise similar to degree exceeding a user-specified threshold. The factor lattice thus represents an approximate version of the original concept lattice. We describe a fuzzy closure operator the fixed points of which are just clusters which uniquely determine the blocks of clusters of the factor lattice. This enables us to compute the factor lattice directly from the data without the need to compute the whole concept lattice. We present theoretical solution and examples demonstrating the speed-up of our method.