Biclustering numerical data in formal concept analysis

  • Authors:
  • Mehdi Kaytoue;Sergei O. Kuznetsov;Amedeo Napoli

  • Affiliations:
  • Laboratoire Lorrain de Recherche en Informatique et ses Applications, Vandoeuvre-lès-Nancy - France;State University Higher School of Economics, Moscow - Russia;Laboratoire Lorrain de Recherche en Informatique et ses Applications, Vandoeuvre-lès-Nancy - France

  • Venue:
  • ICFCA'11 Proceedings of the 9th international conference on Formal concept analysis
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

A numerical dataset is usually represented by a table where each entry denotes the value taken by an object in line for an attribute in column. A bicluster in a numerical data table is a subtable with close values different from values outside the subtable. Traditionally, largest biclusters were found by means of methods based on linear algebra. We propose an alternative approach based on concept lattices and lattices of interval pattern structures. In other words, this paper shows how formal concept analysis originally tackles the problem of biclustering and provides interesting perspectives of research.