Discovering cluster dynamics using kernel spectral methods

Rocco Langone, RaghvenPhDa Mall, Joos Vandewalle, Johan A.K. Suykens

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Networks represent patterns of interactions between components of complex systems present in nature, science, technology and society. Furthermore, graph theory allows to perform insightful analysis for different kinds of data by representing the instances as nodes of a weighted network, where the weights characterize similarity between the data points. In this chapter we describe a number of algorithms to perform cluster analysis, that is finding groups of similar items (called clusters or communities) and understand their evolution over time. These algorithms are designed in a kernel-based framework: the original data are mapped into an high dimensional feature space; linear models are designed in this space; complex nonlinear relationships between the data in the original input space can then be detected. Applications like fault detection in industrial machines, community detection of static and evolving networks, image segmentation, incremental time-series clustering and text clustering are considered.

Original languageEnglish
Pages (from-to)1-24
Number of pages24
JournalUnderstanding Complex Systems
Volume73
DOIs
Publication statusPublished - 1 Jan 2016
Externally publishedYes

Fingerprint

Graph theory
Cluster analysis
Image segmentation
Fault detection
Large scale systems
Time series

ASJC Scopus subject areas

  • Software
  • Computational Mechanics
  • Artificial Intelligence

Cite this

Discovering cluster dynamics using kernel spectral methods. / Langone, Rocco; Mall, RaghvenPhDa; Vandewalle, Joos; Suykens, Johan A.K.

In: Understanding Complex Systems, Vol. 73, 01.01.2016, p. 1-24.

Research output: Contribution to journalArticle

Langone, Rocco ; Mall, RaghvenPhDa ; Vandewalle, Joos ; Suykens, Johan A.K. / Discovering cluster dynamics using kernel spectral methods. In: Understanding Complex Systems. 2016 ; Vol. 73. pp. 1-24.
@article{73d63e626ecc425ebdd646ff8387cbe1,
title = "Discovering cluster dynamics using kernel spectral methods",
abstract = "Networks represent patterns of interactions between components of complex systems present in nature, science, technology and society. Furthermore, graph theory allows to perform insightful analysis for different kinds of data by representing the instances as nodes of a weighted network, where the weights characterize similarity between the data points. In this chapter we describe a number of algorithms to perform cluster analysis, that is finding groups of similar items (called clusters or communities) and understand their evolution over time. These algorithms are designed in a kernel-based framework: the original data are mapped into an high dimensional feature space; linear models are designed in this space; complex nonlinear relationships between the data in the original input space can then be detected. Applications like fault detection in industrial machines, community detection of static and evolving networks, image segmentation, incremental time-series clustering and text clustering are considered.",
author = "Rocco Langone and RaghvenPhDa Mall and Joos Vandewalle and Suykens, {Johan A.K.}",
year = "2016",
month = "1",
day = "1",
doi = "10.1007/978-3-662-47824-0_1",
language = "English",
volume = "73",
pages = "1--24",
journal = "Understanding Complex Systems",
issn = "1860-0840",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Discovering cluster dynamics using kernel spectral methods

AU - Langone, Rocco

AU - Mall, RaghvenPhDa

AU - Vandewalle, Joos

AU - Suykens, Johan A.K.

PY - 2016/1/1

Y1 - 2016/1/1

N2 - Networks represent patterns of interactions between components of complex systems present in nature, science, technology and society. Furthermore, graph theory allows to perform insightful analysis for different kinds of data by representing the instances as nodes of a weighted network, where the weights characterize similarity between the data points. In this chapter we describe a number of algorithms to perform cluster analysis, that is finding groups of similar items (called clusters or communities) and understand their evolution over time. These algorithms are designed in a kernel-based framework: the original data are mapped into an high dimensional feature space; linear models are designed in this space; complex nonlinear relationships between the data in the original input space can then be detected. Applications like fault detection in industrial machines, community detection of static and evolving networks, image segmentation, incremental time-series clustering and text clustering are considered.

AB - Networks represent patterns of interactions between components of complex systems present in nature, science, technology and society. Furthermore, graph theory allows to perform insightful analysis for different kinds of data by representing the instances as nodes of a weighted network, where the weights characterize similarity between the data points. In this chapter we describe a number of algorithms to perform cluster analysis, that is finding groups of similar items (called clusters or communities) and understand their evolution over time. These algorithms are designed in a kernel-based framework: the original data are mapped into an high dimensional feature space; linear models are designed in this space; complex nonlinear relationships between the data in the original input space can then be detected. Applications like fault detection in industrial machines, community detection of static and evolving networks, image segmentation, incremental time-series clustering and text clustering are considered.

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

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

U2 - 10.1007/978-3-662-47824-0_1

DO - 10.1007/978-3-662-47824-0_1

M3 - Article

VL - 73

SP - 1

EP - 24

JO - Understanding Complex Systems

JF - Understanding Complex Systems

SN - 1860-0840

ER -