Concepedia

Abstract

Combination strategies in classification are a popular way of overcoming instabilities in classification algorithms. A direct application of ideas such as “voting” to cluster analysis problems is not possible, as no a priori class information for the patterns is available. We present a methodology for combining ensembles of partitions obtained by clustering, discuss the properties of such combination strategies and relate them to the task of assessing partition “aggrement”.

References

YearCitations

1994

18.7K

1996

16.6K

1996

10.3K

1980

7.2K

1999

2.6K

1998

2.3K

1992

2.2K

1997

951

1995

309

1994

251

Page 1