Message passing clustering with stochastic merging based on kernel functions

Huimin Geng, Xutao Deng, Hesham H Ali

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, we propose a new Stochastic Message Passing Clustering (SMPC) algorithm for clustering biological data based on the Message Passing Clustering (MPC) algorithm, which we introduced in earlier work. MPC has shown its advantage when applied to describing parallel and spontaneous biological processes. SMPC, as a generalized version of MPC, extends the clustering algorithm from a deterministic process to a stochastic process, adding three major advantages. First, in deciding the merging cluster pair, the influences of all clusters are quantified by probabilities, estimated by kernel functions based on their relative distances. Second, the proposed algorithm property resolve the "tie" problem, which often occurs for integer distances as in the case of protein interaction data. Third, clustering can be undone to improve the clustering performance when the algorithm detects objects which don't have good probabilities inside the cluster and moves them outside. The test results on colon cancer gene-expression data show that SMPC performs better than the deterministic MPC.

Original languageEnglish (US)
Title of host publicationAssociation for Information Systems - 11th Americas Conference on Information Systems, AMCIS 2005
Subtitle of host publicationA Conference on a Human Scale
Pages2662-2671
Number of pages10
StatePublished - Dec 1 2005
Event11th Americas Conference on Information Systems, AMCIS 2005 - Omaha, NE, United States
Duration: Aug 11 2005Aug 15 2005

Publication series

NameAssociation for Information Systems - 11th Americas Conference on Information Systems, AMCIS 2005: A Conference on a Human Scale
Volume6

Conference

Conference11th Americas Conference on Information Systems, AMCIS 2005
CountryUnited States
CityOmaha, NE
Period8/11/058/15/05

Fingerprint

Message passing
Merging
Clustering algorithms
cancer
Random processes
Gene expression
interaction
Proteins
performance

Keywords

  • Clustering
  • Hierarchical clustering
  • Kernel functions
  • Message passing clustering
  • Stochastic processes

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Networks and Communications
  • Information Systems
  • Library and Information Sciences

Cite this

Geng, H., Deng, X., & Ali, H. H. (2005). Message passing clustering with stochastic merging based on kernel functions. In Association for Information Systems - 11th Americas Conference on Information Systems, AMCIS 2005: A Conference on a Human Scale (pp. 2662-2671). (Association for Information Systems - 11th Americas Conference on Information Systems, AMCIS 2005: A Conference on a Human Scale; Vol. 6).

Message passing clustering with stochastic merging based on kernel functions. / Geng, Huimin; Deng, Xutao; Ali, Hesham H.

Association for Information Systems - 11th Americas Conference on Information Systems, AMCIS 2005: A Conference on a Human Scale. 2005. p. 2662-2671 (Association for Information Systems - 11th Americas Conference on Information Systems, AMCIS 2005: A Conference on a Human Scale; Vol. 6).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Geng, H, Deng, X & Ali, HH 2005, Message passing clustering with stochastic merging based on kernel functions. in Association for Information Systems - 11th Americas Conference on Information Systems, AMCIS 2005: A Conference on a Human Scale. Association for Information Systems - 11th Americas Conference on Information Systems, AMCIS 2005: A Conference on a Human Scale, vol. 6, pp. 2662-2671, 11th Americas Conference on Information Systems, AMCIS 2005, Omaha, NE, United States, 8/11/05.
Geng H, Deng X, Ali HH. Message passing clustering with stochastic merging based on kernel functions. In Association for Information Systems - 11th Americas Conference on Information Systems, AMCIS 2005: A Conference on a Human Scale. 2005. p. 2662-2671. (Association for Information Systems - 11th Americas Conference on Information Systems, AMCIS 2005: A Conference on a Human Scale).
Geng, Huimin ; Deng, Xutao ; Ali, Hesham H. / Message passing clustering with stochastic merging based on kernel functions. Association for Information Systems - 11th Americas Conference on Information Systems, AMCIS 2005: A Conference on a Human Scale. 2005. pp. 2662-2671 (Association for Information Systems - 11th Americas Conference on Information Systems, AMCIS 2005: A Conference on a Human Scale).
@inproceedings{4be72788d9e441e891eb0dac2467cb70,
title = "Message passing clustering with stochastic merging based on kernel functions",
abstract = "In this paper, we propose a new Stochastic Message Passing Clustering (SMPC) algorithm for clustering biological data based on the Message Passing Clustering (MPC) algorithm, which we introduced in earlier work. MPC has shown its advantage when applied to describing parallel and spontaneous biological processes. SMPC, as a generalized version of MPC, extends the clustering algorithm from a deterministic process to a stochastic process, adding three major advantages. First, in deciding the merging cluster pair, the influences of all clusters are quantified by probabilities, estimated by kernel functions based on their relative distances. Second, the proposed algorithm property resolve the {"}tie{"} problem, which often occurs for integer distances as in the case of protein interaction data. Third, clustering can be undone to improve the clustering performance when the algorithm detects objects which don't have good probabilities inside the cluster and moves them outside. The test results on colon cancer gene-expression data show that SMPC performs better than the deterministic MPC.",
keywords = "Clustering, Hierarchical clustering, Kernel functions, Message passing clustering, Stochastic processes",
author = "Huimin Geng and Xutao Deng and Ali, {Hesham H}",
year = "2005",
month = "12",
day = "1",
language = "English (US)",
isbn = "9781604235531",
series = "Association for Information Systems - 11th Americas Conference on Information Systems, AMCIS 2005: A Conference on a Human Scale",
pages = "2662--2671",
booktitle = "Association for Information Systems - 11th Americas Conference on Information Systems, AMCIS 2005",

}

TY - GEN

T1 - Message passing clustering with stochastic merging based on kernel functions

AU - Geng, Huimin

AU - Deng, Xutao

AU - Ali, Hesham H

PY - 2005/12/1

Y1 - 2005/12/1

N2 - In this paper, we propose a new Stochastic Message Passing Clustering (SMPC) algorithm for clustering biological data based on the Message Passing Clustering (MPC) algorithm, which we introduced in earlier work. MPC has shown its advantage when applied to describing parallel and spontaneous biological processes. SMPC, as a generalized version of MPC, extends the clustering algorithm from a deterministic process to a stochastic process, adding three major advantages. First, in deciding the merging cluster pair, the influences of all clusters are quantified by probabilities, estimated by kernel functions based on their relative distances. Second, the proposed algorithm property resolve the "tie" problem, which often occurs for integer distances as in the case of protein interaction data. Third, clustering can be undone to improve the clustering performance when the algorithm detects objects which don't have good probabilities inside the cluster and moves them outside. The test results on colon cancer gene-expression data show that SMPC performs better than the deterministic MPC.

AB - In this paper, we propose a new Stochastic Message Passing Clustering (SMPC) algorithm for clustering biological data based on the Message Passing Clustering (MPC) algorithm, which we introduced in earlier work. MPC has shown its advantage when applied to describing parallel and spontaneous biological processes. SMPC, as a generalized version of MPC, extends the clustering algorithm from a deterministic process to a stochastic process, adding three major advantages. First, in deciding the merging cluster pair, the influences of all clusters are quantified by probabilities, estimated by kernel functions based on their relative distances. Second, the proposed algorithm property resolve the "tie" problem, which often occurs for integer distances as in the case of protein interaction data. Third, clustering can be undone to improve the clustering performance when the algorithm detects objects which don't have good probabilities inside the cluster and moves them outside. The test results on colon cancer gene-expression data show that SMPC performs better than the deterministic MPC.

KW - Clustering

KW - Hierarchical clustering

KW - Kernel functions

KW - Message passing clustering

KW - Stochastic processes

UR - http://www.scopus.com/inward/record.url?scp=84870045415&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84870045415&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84870045415

SN - 9781604235531

T3 - Association for Information Systems - 11th Americas Conference on Information Systems, AMCIS 2005: A Conference on a Human Scale

SP - 2662

EP - 2671

BT - Association for Information Systems - 11th Americas Conference on Information Systems, AMCIS 2005

ER -