Metric incremental clustering of nominal data

Dan Simovici; Namita Singla; Michael Kuperberg

doi:10.1109/ICDM.2004.10005

Metric incremental clustering of nominal data

Dan Simovici
, Namita Singla
, Michael Kuperberg

Computer Science

University of Massachusetts Boston
Karlsruhe Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We present an algorithm for clustering nominal data that is based on a metric on the set of partitions of a finite set of objects; this metric is defined starting from a lower valuation of the lattice of partitions. The proposed algorithm seeks to determine a clustering partition such that the total distance between this partition and the partitions determined by the attributes of the objects has a local minimum. The resulting clustering is quite stable relative to the ordering of the objects.

Original language	English
Title of host publication	Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004
Editors	R. Rastogi, K. Morik, M. Bramer, X. Wu
Pages	523-526
Number of pages	4
DOIs	https://doi.org/10.1109/ICDM.2004.10005
State	Published - 2004
Event	Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004 - Brighton, United Kingdom Duration: Nov 1 2004 → Nov 4 2004

Publication series

Name	Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004

Conference

Conference	Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004
Country/Territory	United Kingdom
City	Brighton
Period	11/1/04 → 11/4/04

ASJC Scopus Subject Areas

General Engineering

Access to Document

10.1109/ICDM.2004.10005

Cite this

Metric incremental clustering of nominal data. / Simovici, Dan; Singla, Namita; Kuperberg, Michael.
Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004. ed. / R. Rastogi; K. Morik; M. Bramer; X. Wu. 2004. p. 523-526 (Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Simovici, D, Singla, N & Kuperberg, M 2004, Metric incremental clustering of nominal data. in R Rastogi, K Morik, M Bramer & X Wu (eds), Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004. Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004, pp. 523-526, Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004, Brighton, United Kingdom, 11/1/04. https://doi.org/10.1109/ICDM.2004.10005

@inproceedings{bfb88fea5da74c43b109db4280c59e72,

title = "Metric incremental clustering of nominal data",

abstract = "We present an algorithm for clustering nominal data that is based on a metric on the set of partitions of a finite set of objects; this metric is defined starting from a lower valuation of the lattice of partitions. The proposed algorithm seeks to determine a clustering partition such that the total distance between this partition and the partitions determined by the attributes of the objects has a local minimum. The resulting clustering is quite stable relative to the ordering of the objects.",

author = "Dan Simovici and Namita Singla and Michael Kuperberg",

year = "2004",

doi = "10.1109/ICDM.2004.10005",

language = "English",

isbn = "0769521428",

series = "Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004",

pages = "523--526",

editor = "R. Rastogi and K. Morik and M. Bramer and X. Wu",

booktitle = "Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004",

note = "Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004 ; Conference date: 01-11-2004 Through 04-11-2004",

}

TY - GEN

T1 - Metric incremental clustering of nominal data

AU - Simovici, Dan

AU - Singla, Namita

AU - Kuperberg, Michael

PY - 2004

Y1 - 2004

N2 - We present an algorithm for clustering nominal data that is based on a metric on the set of partitions of a finite set of objects; this metric is defined starting from a lower valuation of the lattice of partitions. The proposed algorithm seeks to determine a clustering partition such that the total distance between this partition and the partitions determined by the attributes of the objects has a local minimum. The resulting clustering is quite stable relative to the ordering of the objects.

AB - We present an algorithm for clustering nominal data that is based on a metric on the set of partitions of a finite set of objects; this metric is defined starting from a lower valuation of the lattice of partitions. The proposed algorithm seeks to determine a clustering partition such that the total distance between this partition and the partitions determined by the attributes of the objects has a local minimum. The resulting clustering is quite stable relative to the ordering of the objects.

UR - https://www.scopus.com/pages/publications/19544365046

UR - https://www.scopus.com/pages/publications/19544365046#tab=citedBy

U2 - 10.1109/ICDM.2004.10005

DO - 10.1109/ICDM.2004.10005

M3 - Conference contribution

AN - SCOPUS:19544365046

SN - 0769521428

SN - 9780769521428

T3 - Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004

SP - 523

EP - 526

BT - Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004

A2 - Rastogi, R.

A2 - Morik, K.

A2 - Bramer, M.

A2 - Wu, X.

T2 - Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004

Y2 - 1 November 2004 through 4 November 2004

ER -

Metric incremental clustering of nominal data

Abstract

Publication series

Conference

ASJC Scopus Subject Areas

Access to Document

Other files and links

Fingerprint

Cite this