Self-tuned kernel spectral clustering for large scale networks

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

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

22 Citations (Scopus)

Abstract

We propose a parameter-free kernel spectral clustering model for large scale complex networks. The kernel spectral clustering (KSC) method works by creating a model on a subgraph of the complex network. The model requires a kernel function which can have parameters and the number of communities k has be detected in the large scale network. We exploit the structure of the projections in the eigenspace to automatically identify the number of clusters. We use the concept of entropy and balanced clusters for this purpose. We show the effectiveness of the proposed approach by comparing the cluster memberships w.r.t. several large scale community detection techniques like Louvain, Infomap and Bigclam methods. We conducted experiments on several synthetic networks of varying size and mixing parameter along with large scale real world experiments to show the efficiency of the proposed approach.

Original languageEnglish
Title of host publicationProceedings - 2013 IEEE International Conference on Big Data, Big Data 2013
Pages385-393
Number of pages9
DOIs
Publication statusPublished - 1 Dec 2013
Externally publishedYes
Event2013 IEEE International Conference on Big Data, Big Data 2013 - Santa Clara, CA, United States
Duration: 6 Oct 20139 Oct 2013

Other

Other2013 IEEE International Conference on Big Data, Big Data 2013
CountryUnited States
CitySanta Clara, CA
Period6/10/139/10/13

Fingerprint

Complex networks
Entropy
Experiments

Keywords

  • kernel spectral clustering
  • number of clusters
  • parameter-free spectral clustering

ASJC Scopus subject areas

  • Software

Cite this

Mall, R., Langone, R., & Suykens, J. A. K. (2013). Self-tuned kernel spectral clustering for large scale networks. In Proceedings - 2013 IEEE International Conference on Big Data, Big Data 2013 (pp. 385-393). [6691599] https://doi.org/10.1109/BigData.2013.6691599

Self-tuned kernel spectral clustering for large scale networks. / Mall, RaghvenPhDa; Langone, Rocco; Suykens, Johan A.K.

Proceedings - 2013 IEEE International Conference on Big Data, Big Data 2013. 2013. p. 385-393 6691599.

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

Mall, R, Langone, R & Suykens, JAK 2013, Self-tuned kernel spectral clustering for large scale networks. in Proceedings - 2013 IEEE International Conference on Big Data, Big Data 2013., 6691599, pp. 385-393, 2013 IEEE International Conference on Big Data, Big Data 2013, Santa Clara, CA, United States, 6/10/13. https://doi.org/10.1109/BigData.2013.6691599
Mall R, Langone R, Suykens JAK. Self-tuned kernel spectral clustering for large scale networks. In Proceedings - 2013 IEEE International Conference on Big Data, Big Data 2013. 2013. p. 385-393. 6691599 https://doi.org/10.1109/BigData.2013.6691599
Mall, RaghvenPhDa ; Langone, Rocco ; Suykens, Johan A.K. / Self-tuned kernel spectral clustering for large scale networks. Proceedings - 2013 IEEE International Conference on Big Data, Big Data 2013. 2013. pp. 385-393
@inproceedings{420e747339ad4d80982596a43af0fbaa,
title = "Self-tuned kernel spectral clustering for large scale networks",
abstract = "We propose a parameter-free kernel spectral clustering model for large scale complex networks. The kernel spectral clustering (KSC) method works by creating a model on a subgraph of the complex network. The model requires a kernel function which can have parameters and the number of communities k has be detected in the large scale network. We exploit the structure of the projections in the eigenspace to automatically identify the number of clusters. We use the concept of entropy and balanced clusters for this purpose. We show the effectiveness of the proposed approach by comparing the cluster memberships w.r.t. several large scale community detection techniques like Louvain, Infomap and Bigclam methods. We conducted experiments on several synthetic networks of varying size and mixing parameter along with large scale real world experiments to show the efficiency of the proposed approach.",
keywords = "kernel spectral clustering, number of clusters, parameter-free spectral clustering",
author = "RaghvenPhDa Mall and Rocco Langone and Suykens, {Johan A.K.}",
year = "2013",
month = "12",
day = "1",
doi = "10.1109/BigData.2013.6691599",
language = "English",
isbn = "9781479912926",
pages = "385--393",
booktitle = "Proceedings - 2013 IEEE International Conference on Big Data, Big Data 2013",

}

TY - GEN

T1 - Self-tuned kernel spectral clustering for large scale networks

AU - Mall, RaghvenPhDa

AU - Langone, Rocco

AU - Suykens, Johan A.K.

PY - 2013/12/1

Y1 - 2013/12/1

N2 - We propose a parameter-free kernel spectral clustering model for large scale complex networks. The kernel spectral clustering (KSC) method works by creating a model on a subgraph of the complex network. The model requires a kernel function which can have parameters and the number of communities k has be detected in the large scale network. We exploit the structure of the projections in the eigenspace to automatically identify the number of clusters. We use the concept of entropy and balanced clusters for this purpose. We show the effectiveness of the proposed approach by comparing the cluster memberships w.r.t. several large scale community detection techniques like Louvain, Infomap and Bigclam methods. We conducted experiments on several synthetic networks of varying size and mixing parameter along with large scale real world experiments to show the efficiency of the proposed approach.

AB - We propose a parameter-free kernel spectral clustering model for large scale complex networks. The kernel spectral clustering (KSC) method works by creating a model on a subgraph of the complex network. The model requires a kernel function which can have parameters and the number of communities k has be detected in the large scale network. We exploit the structure of the projections in the eigenspace to automatically identify the number of clusters. We use the concept of entropy and balanced clusters for this purpose. We show the effectiveness of the proposed approach by comparing the cluster memberships w.r.t. several large scale community detection techniques like Louvain, Infomap and Bigclam methods. We conducted experiments on several synthetic networks of varying size and mixing parameter along with large scale real world experiments to show the efficiency of the proposed approach.

KW - kernel spectral clustering

KW - number of clusters

KW - parameter-free spectral clustering

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

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

U2 - 10.1109/BigData.2013.6691599

DO - 10.1109/BigData.2013.6691599

M3 - Conference contribution

SN - 9781479912926

SP - 385

EP - 393

BT - Proceedings - 2013 IEEE International Conference on Big Data, Big Data 2013

ER -