Lattice-valued hierarchical clustering for analyzing information systems

Authors:
Sadaaki Miyamoto
Affiliations:
Department of Risk Engineering, Faculty of Systems and Information Engineering, University of Tsukuba, Ibaraki, Japan
Venue:
RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
Year:
2006

Citing 2
Cited 1

Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
Soft Computing and Human-Centered Machines

Soft Computing and Human-Centered Machines

Data Clustering Algorithms for Information Systems

RSFDGrC '07 Proceedings of the 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A generalization of hierarchical clustering is proposed in which the dendrogram is replaced by clusters attached to a lattice diagram. Hence the method is called lattice-valued hierarchical clustering. Different algorithms of lattice-valued clustering are described with application to information systems in the form of tables studied in rough sets. A simple example is given whereby how the concept of the lattice-valued hierarchical clustering is related to classifications in rough sets is shown.