Computing Concept Lattices with Clustering Approaches

摘要

Finding the concepts in formal concept context is time-consuming, which is a NP problem. In this paper, hierarching conceptual clustering analysis based on distance function is investigated, under this clustering, we only check the some subset of feature set instead of all of them, which largely reduces the computing steps in finding the concepts, we pave a way to explore concept lattice with clustering approaches.