eCommons

 

Meta Clustering

Other Titles

Abstract

Most clustering methods search for one optimal partitioning of the data. Often it is better to search for many different clusterings of the data and present the user with a means of efficiently navigating between them. We present two algorithms for generating many alternate clusterings: Sample-and-Merge and Component Reweighting. We then use clustering at a meta level to organize these different base-level clusterings. This {\em MetaClustering} partitions the base-level clusterings into groups of similar clusterings. We demonstrate MetaClustering on a synthetic data set, and on a real protein data set. The results show that the algorithms are effective at generating qualitatively different clusterings, and at organizing these clusterings so that similar ones are grouped together.

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

2002-11-08

Publisher

Cornell University

Keywords

computer science; technical report

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Committee Co-Chair

Committee Member

Degree Discipline

Degree Name

Degree Level

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR2002-1884

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record