Multidimensional clustering and hypergraphs
Teoretičeskaâ i matematičeskaâ fizika, Tome 164 (2010) no. 3, pp. 394-400
Voir la notice de l'article provenant de la source Math-Net.Ru
We discuss a multidimensional generalization of the clustering method. In our approach, the clustering is realized by partially ordered hypergraphs belonging to some family. The suggested procedure is applicable in the case where the original metric depends on a set of parameters. The clustering hypergraph studied here can be regarded as an object describing all possible clustering trees corresponding to different values of the original metric.
Keywords:
clustering, hypergraph, data analysis.
@article{TMF_2010_164_3_a7,
author = {S. V. Kozyrev},
title = {Multidimensional clustering and hypergraphs},
journal = {Teoreti\v{c}eska\^a i matemati\v{c}eska\^a fizika},
pages = {394--400},
publisher = {mathdoc},
volume = {164},
number = {3},
year = {2010},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TMF_2010_164_3_a7/}
}
S. V. Kozyrev. Multidimensional clustering and hypergraphs. Teoretičeskaâ i matematičeskaâ fizika, Tome 164 (2010) no. 3, pp. 394-400. http://geodesic.mathdoc.fr/item/TMF_2010_164_3_a7/