On complexity reduction of concept lattices: three counterexamples

Authors:
Michal Krupka
Affiliations:
Department of Computer Science, Palacký University of Olomouc, Olomouc, Czech Republic
Venue:
Information Retrieval
Year:
2012

Citing 3
Cited 0

Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Complexity Reduction in Lattice-Based Information Retrieval

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

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss the paper by Cheung and Vogel, Inf Retr 8(2), pp 285---299 (2005). We introduce some counterexamples showing that the theoretical results, the paper is based upon, are incorrect.