Short Communication: Concept lattice reduction using fuzzy K-Means clustering

  • Authors:
  • Ch. Aswani Kumar;S. Srinivas

  • Affiliations:
  • Networks and Information Security Division, School of Information Technology and Engineering, VIT University, Vellore 632014, India;Fluid Dynamics Division, School of Science, VIT University, Vellore 632014, India

  • Venue:
  • Expert Systems with Applications: An International Journal
  • Year:
  • 2010

Quantified Score

Hi-index 12.05

Visualization

Abstract

During the design of concept lattices, complexity plays a major role in computing all the concepts from the huge incidence matrix. Hence for reducing the size of the lattice, methods based on matrix decompositions like SVD are available in the literature. However, SVD computation is known to have large time and memory requirements. In this paper, we propose a new method based on Fuzzy K-Means clustering for reducing the size of the concept lattices. We demonstrate the implementation of proposed method on two application areas: information retrieval and information visualization.