Scalable model-based clustering for large databases based on data summarization

Huidong JIN, Man Leung WONG, K.-S. LEUNG

Research output: Journal PublicationsJournal Article (refereed)

12 Citations (Scopus)

Abstract

The scalability problem in data mining involves the development of methods for handling large databases with limited computational resources such as memory and computation time. In this paper, two scalable clustering algorithms, bEMADS and gEMADS, are presented based on the Gaussian mixture model. Both summarize data into subclusters and then generate Gaussian mixtures from their data summaries. Their core algorithm, EMADS, is defined on data summaries and approximates the aggregate behavior of each subcluster of data under the Gaussian mixture model. EMADS is provably convergent. Experimental results substantiate that both algorithms can run several orders of magnitude faster than expectation-maximization with little loss of accuracy.
Original languageEnglish
Pages (from-to)1710-1719
Number of pages10
JournalIEEE Transactions on Pattern Analysis and Machine Intelligence
Volume27
Issue number11
DOIs
Publication statusPublished - 1 Jan 2015

Fingerprint

Model-based Clustering
Summarization
Gaussian Mixture Model
Clustering algorithms
Gaussian Mixture
Data mining
Expectation Maximization
Scalability
Clustering Algorithm
Data storage equipment
Data Mining
Resources
Experimental Results

Keywords

  • Scalable clustering; Gaussian mixture model; expectation-maximization; data summary; maximum penalized likelihood estimate

Cite this

@article{ece7263867954d1d94812941c041df86,
title = "Scalable model-based clustering for large databases based on data summarization",
abstract = "The scalability problem in data mining involves the development of methods for handling large databases with limited computational resources such as memory and computation time. In this paper, two scalable clustering algorithms, bEMADS and gEMADS, are presented based on the Gaussian mixture model. Both summarize data into subclusters and then generate Gaussian mixtures from their data summaries. Their core algorithm, EMADS, is defined on data summaries and approximates the aggregate behavior of each subcluster of data under the Gaussian mixture model. EMADS is provably convergent. Experimental results substantiate that both algorithms can run several orders of magnitude faster than expectation-maximization with little loss of accuracy.",
keywords = "Scalable clustering; Gaussian mixture model; expectation-maximization; data summary; maximum penalized likelihood estimate",
author = "Huidong JIN and WONG, {Man Leung} and K.-S. LEUNG",
year = "2015",
month = "1",
day = "1",
doi = "10.1109/TPAMI.2005.226",
language = "English",
volume = "27",
pages = "1710--1719",
journal = "IEEE Transactions on Pattern Analysis and Machine Intelligence",
issn = "0162-8828",
publisher = "IEEE Computer Society",
number = "11",

}

Scalable model-based clustering for large databases based on data summarization. / JIN, Huidong; WONG, Man Leung; LEUNG, K.-S.

In: IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 27, No. 11, 01.01.2015, p. 1710-1719.

Research output: Journal PublicationsJournal Article (refereed)

TY - JOUR

T1 - Scalable model-based clustering for large databases based on data summarization

AU - JIN, Huidong

AU - WONG, Man Leung

AU - LEUNG, K.-S.

PY - 2015/1/1

Y1 - 2015/1/1

N2 - The scalability problem in data mining involves the development of methods for handling large databases with limited computational resources such as memory and computation time. In this paper, two scalable clustering algorithms, bEMADS and gEMADS, are presented based on the Gaussian mixture model. Both summarize data into subclusters and then generate Gaussian mixtures from their data summaries. Their core algorithm, EMADS, is defined on data summaries and approximates the aggregate behavior of each subcluster of data under the Gaussian mixture model. EMADS is provably convergent. Experimental results substantiate that both algorithms can run several orders of magnitude faster than expectation-maximization with little loss of accuracy.

AB - The scalability problem in data mining involves the development of methods for handling large databases with limited computational resources such as memory and computation time. In this paper, two scalable clustering algorithms, bEMADS and gEMADS, are presented based on the Gaussian mixture model. Both summarize data into subclusters and then generate Gaussian mixtures from their data summaries. Their core algorithm, EMADS, is defined on data summaries and approximates the aggregate behavior of each subcluster of data under the Gaussian mixture model. EMADS is provably convergent. Experimental results substantiate that both algorithms can run several orders of magnitude faster than expectation-maximization with little loss of accuracy.

KW - Scalable clustering; Gaussian mixture model; expectation-maximization; data summary; maximum penalized likelihood estimate

UR - http://commons.ln.edu.hk/sw_master/4091

U2 - 10.1109/TPAMI.2005.226

DO - 10.1109/TPAMI.2005.226

M3 - Journal Article (refereed)

C2 - 16285371

VL - 27

SP - 1710

EP - 1719

JO - IEEE Transactions on Pattern Analysis and Machine Intelligence

JF - IEEE Transactions on Pattern Analysis and Machine Intelligence

SN - 0162-8828

IS - 11

ER -