Evaluating cooperation in communities with the k-core structure

Christos Giatsidis; Dimitrios M. Thilikos; Michalis Vazirgiannis

doi:10.1109/ASONAM.2011.65

Evaluating cooperation in communities with the k-core structure

Christos Giatsidis, Dimitrios M. Thilikos, Michalis Vazirgiannis

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Community subgraphs are characterized by dense connections or interactions among its nodes. Community detection and evaluation is an important task in graph mining. A variety of measures have been proposed to evaluate the quality of such communities. In this paper, we evaluate communities based on the k-core concept, as means of evaluating their collaborative nature - a property not captured by the single node metrics or by the established community evaluation metrics. Based on the k-core, which essentially measures the robustness of a community under degeneracy, we extend it to weighted graphs, devising a novel concept of k-cores on weighted graphs. We applied the k-core approach on large real world graphs - such as DBLP and report interesting results.

Original language	English (US)
Title of host publication	Proceedings - 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011
Publisher	IEEE Computer Society
Pages	87-93
Number of pages	7
ISBN (Print)	9780769543758
DOIs	https://doi.org/10.1109/ASONAM.2011.65
State	Published - 2011

Publication series

Name	Proceedings - 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011

Keywords

Co-authorship graphs
Community evaluation
Graph mining
K-core

ASJC Scopus subject areas

Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1109/ASONAM.2011.65

Cite this

Giatsidis, C., Thilikos, D. M., & Vazirgiannis, M. (2011). Evaluating cooperation in communities with the k-core structure. In Proceedings - 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011 (pp. 87-93). Article 5992567 (Proceedings - 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011). IEEE Computer Society. https://doi.org/10.1109/ASONAM.2011.65

Evaluating cooperation in communities with the k-core structure. / Giatsidis, Christos; Thilikos, Dimitrios M.; Vazirgiannis, Michalis.
Proceedings - 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011. IEEE Computer Society, 2011. p. 87-93 5992567 (Proceedings - 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Giatsidis, C, Thilikos, DM & Vazirgiannis, M 2011, Evaluating cooperation in communities with the k-core structure. in Proceedings - 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011., 5992567, Proceedings - 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011, IEEE Computer Society, pp. 87-93. https://doi.org/10.1109/ASONAM.2011.65

Giatsidis C, Thilikos DM, Vazirgiannis M. Evaluating cooperation in communities with the k-core structure. In Proceedings - 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011. IEEE Computer Society. 2011. p. 87-93. 5992567. (Proceedings - 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011). doi: 10.1109/ASONAM.2011.65

Giatsidis, Christos ; Thilikos, Dimitrios M. ; Vazirgiannis, Michalis. / Evaluating cooperation in communities with the k-core structure. Proceedings - 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011. IEEE Computer Society, 2011. pp. 87-93 (Proceedings - 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011).

@inproceedings{93c417f685b84c96ad15f655646f914b,

title = "Evaluating cooperation in communities with the k-core structure",

abstract = "Community subgraphs are characterized by dense connections or interactions among its nodes. Community detection and evaluation is an important task in graph mining. A variety of measures have been proposed to evaluate the quality of such communities. In this paper, we evaluate communities based on the k-core concept, as means of evaluating their collaborative nature - a property not captured by the single node metrics or by the established community evaluation metrics. Based on the k-core, which essentially measures the robustness of a community under degeneracy, we extend it to weighted graphs, devising a novel concept of k-cores on weighted graphs. We applied the k-core approach on large real world graphs - such as DBLP and report interesting results.",

keywords = "Co-authorship graphs, Community evaluation, Graph mining, K-core",

author = "Christos Giatsidis and Thilikos, {Dimitrios M.} and Michalis Vazirgiannis",

year = "2011",

doi = "10.1109/ASONAM.2011.65",

language = "English (US)",

isbn = "9780769543758",

series = "Proceedings - 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011",

publisher = "IEEE Computer Society",

pages = "87--93",

booktitle = "Proceedings - 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011",

}

TY - GEN

T1 - Evaluating cooperation in communities with the k-core structure

AU - Giatsidis, Christos

AU - Thilikos, Dimitrios M.

AU - Vazirgiannis, Michalis

PY - 2011

Y1 - 2011

N2 - Community subgraphs are characterized by dense connections or interactions among its nodes. Community detection and evaluation is an important task in graph mining. A variety of measures have been proposed to evaluate the quality of such communities. In this paper, we evaluate communities based on the k-core concept, as means of evaluating their collaborative nature - a property not captured by the single node metrics or by the established community evaluation metrics. Based on the k-core, which essentially measures the robustness of a community under degeneracy, we extend it to weighted graphs, devising a novel concept of k-cores on weighted graphs. We applied the k-core approach on large real world graphs - such as DBLP and report interesting results.

AB - Community subgraphs are characterized by dense connections or interactions among its nodes. Community detection and evaluation is an important task in graph mining. A variety of measures have been proposed to evaluate the quality of such communities. In this paper, we evaluate communities based on the k-core concept, as means of evaluating their collaborative nature - a property not captured by the single node metrics or by the established community evaluation metrics. Based on the k-core, which essentially measures the robustness of a community under degeneracy, we extend it to weighted graphs, devising a novel concept of k-cores on weighted graphs. We applied the k-core approach on large real world graphs - such as DBLP and report interesting results.

KW - Co-authorship graphs

KW - Community evaluation

KW - Graph mining

KW - K-core

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

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

U2 - 10.1109/ASONAM.2011.65

DO - 10.1109/ASONAM.2011.65

M3 - Conference contribution

AN - SCOPUS:80052765481

SN - 9780769543758

T3 - Proceedings - 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011

SP - 87

EP - 93

BT - Proceedings - 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011

PB - IEEE Computer Society

ER -

Evaluating cooperation in communities with the k-core structure

Abstract

Publication series

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this