Role discovery for graph clustering

Bin Hui Chou, Einoshin Suzuki

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

2 Citations (Scopus)

Abstract

Graph clustering is an important task of discovering the underlying structure in a network. Well-known methods such as the normalized cut and modularity-based methods are developed in the past decades. These methods may be called non-overlapping because they assume that a vertex belongs to one community. On the other hand, overlapping methods such as CPM, which assume that a vertex may belong to more than one community, have been drawing attention as the assumption fits the reality. We believe that existing overlapping methods are overly simple for a vertex located at the border of a community. That is, they lack careful consideration on the edges that link the vertex to its neighbors belonging to different communities. Thus, we propose a new graph clustering method, named RoClust, which uses three different kinds of roles, each of which represents a different kind of vertices that connect communities. Experimental results show that our method outperforms state-of-the-art methods of graph clustering.

Original languageEnglish
Title of host publicationWeb Technologies and Applications - 13th Asia-Pacific Web Conference, APWeb 2011, Proceedings
Pages17-28
Number of pages12
DOIs
Publication statusPublished - Apr 28 2011
Event13th Asia-Pacific Conference on Web Technology, APWeb 2011 - Beijing, China
Duration: Apr 18 2011Apr 20 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6612 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other13th Asia-Pacific Conference on Web Technology, APWeb 2011
CountryChina
CityBeijing
Period4/18/114/20/11

Fingerprint

Graph Clustering
Vertex of a graph
Overlapping
Modularity
Clustering Methods
Community
Experimental Results

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Chou, B. H., & Suzuki, E. (2011). Role discovery for graph clustering. In Web Technologies and Applications - 13th Asia-Pacific Web Conference, APWeb 2011, Proceedings (pp. 17-28). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6612 LNCS). https://doi.org/10.1007/978-3-642-20291-9_5

Role discovery for graph clustering. / Chou, Bin Hui; Suzuki, Einoshin.

Web Technologies and Applications - 13th Asia-Pacific Web Conference, APWeb 2011, Proceedings. 2011. p. 17-28 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6612 LNCS).

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

Chou, BH & Suzuki, E 2011, Role discovery for graph clustering. in Web Technologies and Applications - 13th Asia-Pacific Web Conference, APWeb 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6612 LNCS, pp. 17-28, 13th Asia-Pacific Conference on Web Technology, APWeb 2011, Beijing, China, 4/18/11. https://doi.org/10.1007/978-3-642-20291-9_5
Chou BH, Suzuki E. Role discovery for graph clustering. In Web Technologies and Applications - 13th Asia-Pacific Web Conference, APWeb 2011, Proceedings. 2011. p. 17-28. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-20291-9_5
Chou, Bin Hui ; Suzuki, Einoshin. / Role discovery for graph clustering. Web Technologies and Applications - 13th Asia-Pacific Web Conference, APWeb 2011, Proceedings. 2011. pp. 17-28 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{fd9c106b5e254baabf88f122a3cb851c,
title = "Role discovery for graph clustering",
abstract = "Graph clustering is an important task of discovering the underlying structure in a network. Well-known methods such as the normalized cut and modularity-based methods are developed in the past decades. These methods may be called non-overlapping because they assume that a vertex belongs to one community. On the other hand, overlapping methods such as CPM, which assume that a vertex may belong to more than one community, have been drawing attention as the assumption fits the reality. We believe that existing overlapping methods are overly simple for a vertex located at the border of a community. That is, they lack careful consideration on the edges that link the vertex to its neighbors belonging to different communities. Thus, we propose a new graph clustering method, named RoClust, which uses three different kinds of roles, each of which represents a different kind of vertices that connect communities. Experimental results show that our method outperforms state-of-the-art methods of graph clustering.",
author = "Chou, {Bin Hui} and Einoshin Suzuki",
year = "2011",
month = "4",
day = "28",
doi = "10.1007/978-3-642-20291-9_5",
language = "English",
isbn = "9783642202902",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "17--28",
booktitle = "Web Technologies and Applications - 13th Asia-Pacific Web Conference, APWeb 2011, Proceedings",

}

TY - GEN

T1 - Role discovery for graph clustering

AU - Chou, Bin Hui

AU - Suzuki, Einoshin

PY - 2011/4/28

Y1 - 2011/4/28

N2 - Graph clustering is an important task of discovering the underlying structure in a network. Well-known methods such as the normalized cut and modularity-based methods are developed in the past decades. These methods may be called non-overlapping because they assume that a vertex belongs to one community. On the other hand, overlapping methods such as CPM, which assume that a vertex may belong to more than one community, have been drawing attention as the assumption fits the reality. We believe that existing overlapping methods are overly simple for a vertex located at the border of a community. That is, they lack careful consideration on the edges that link the vertex to its neighbors belonging to different communities. Thus, we propose a new graph clustering method, named RoClust, which uses three different kinds of roles, each of which represents a different kind of vertices that connect communities. Experimental results show that our method outperforms state-of-the-art methods of graph clustering.

AB - Graph clustering is an important task of discovering the underlying structure in a network. Well-known methods such as the normalized cut and modularity-based methods are developed in the past decades. These methods may be called non-overlapping because they assume that a vertex belongs to one community. On the other hand, overlapping methods such as CPM, which assume that a vertex may belong to more than one community, have been drawing attention as the assumption fits the reality. We believe that existing overlapping methods are overly simple for a vertex located at the border of a community. That is, they lack careful consideration on the edges that link the vertex to its neighbors belonging to different communities. Thus, we propose a new graph clustering method, named RoClust, which uses three different kinds of roles, each of which represents a different kind of vertices that connect communities. Experimental results show that our method outperforms state-of-the-art methods of graph clustering.

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

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

U2 - 10.1007/978-3-642-20291-9_5

DO - 10.1007/978-3-642-20291-9_5

M3 - Conference contribution

AN - SCOPUS:79955081403

SN - 9783642202902

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 17

EP - 28

BT - Web Technologies and Applications - 13th Asia-Pacific Web Conference, APWeb 2011, Proceedings

ER -