Hierarchical Clustering of Composite Objects with a Variable Number of Components
Abstract
This paper examines the problem of clustering a sequence of objects that cannot be described with a predefined list of attributes (or variables). In many applications, such a crisp representation cannot be determined. An extension of the traditionnal propositionnal formalism is thus proposed, which allows objects to be represented as a set of components. The algorithm used for clustering is briefly illustrated, and mechanisms to handle sets are described. Some empirical evaluations are also provided, to assess the validity of the approach.
Cite
Text
Ketterlin et al. "Hierarchical Clustering of Composite Objects with a Variable Number of Components." Pre-proceedings of the Fifth International Workshop on Artificial Intelligence and Statistics, 1995.Markdown
[Ketterlin et al. "Hierarchical Clustering of Composite Objects with a Variable Number of Components." Pre-proceedings of the Fifth International Workshop on Artificial Intelligence and Statistics, 1995.](https://mlanthology.org/aistats/1995/ketterlin1995aistats-hierarchical/)BibTeX
@inproceedings{ketterlin1995aistats-hierarchical,
title = {{Hierarchical Clustering of Composite Objects with a Variable Number of Components}},
author = {Ketterlin, Alain and Gançarski, Pierre and Korczak, Jerzy J.},
booktitle = {Pre-proceedings of the Fifth International Workshop on Artificial Intelligence and Statistics},
year = {1995},
pages = {303-309},
volume = {R0},
url = {https://mlanthology.org/aistats/1995/ketterlin1995aistats-hierarchical/}
}