An order theoretic framework for overlapping clustering
Discrete Mathematics - Special issue: trends in discrete mathematics
Triadic distance models: axiomatization and least squares representation
Journal of Mathematical Psychology
Identifying objects using cluster and concept analysis
Proceedings of the 21st international conference on Software engineering
Towards adaptive Web sites: conceptual framework and case study
Artificial Intelligence - Special issue on Intelligent internet systems
Order Structure of Symbolic Assertion Objects
IEEE Transactions on Knowledge and Data Engineering
Pyramids and weak hierarchies in the ordinal model for clustering
Discrete Applied Mathematics
A mixed measure of content on the set of real numbers
Journal of Computational and Applied Mathematics
A relation between the theory of formal concepts and multiway clustering
Pattern Recognition Letters
Approaches to conceptual clustering
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Conceptual Clustering in Knowledge Organization
IEEE Transactions on Pattern Analysis and Machine Intelligence
| Hi-index | 0.04 |
We discuss relations between cluster structures and so-called cluster prestructures. On the other hand, we place ourselves in the framework of a context where entity descriptions belong to a complete meet-semilattice. Such a context induces a Galois correspondence which, in turn, induces a closure operator on the powerset of the entity set. We give a necessary and sufficient condition for a particular collection of fixed points of this closure operator to be hierarchical. Moreover, we specify the collection of all entity subsets which are both fixed points of this closure operator and strong clusters associated with a given pairwise dissimilarity function, as well as that of all entity subsets which are both fixed points of this closure operator and weak clusters associated with a given k-way dissimilarity function.