Giatsidis, C.; Thilikos, D. M. & Vazirgiannis, M.
(2011):
Evaluating Cooperation in Communities with the k-Core Structure.
In: Advances in Social Networks Analysis and Mining (ASONAM), 2011 International Conference on,
[Volltext]
[Kurzfassung] [BibTeX][Endnote]
Community sub graphs 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.
@inproceedings{giatsidis2011evaluating,
author = {Giatsidis, Christos and Thilikos, Dimitrios M. and Vazirgiannis, Michalis},
title = {Evaluating Cooperation in Communities with the k-Core Structure},
booktitle = {Advances in Social Networks Analysis and Mining (ASONAM), 2011 International Conference on},
year = {2011},
pages = {87-93},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5992567&tag=1},
doi = {10.1109/ASONAM.2011.65},
keywords = {community, core, k-core},
abstract = {Community sub graphs 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.}
}
%0 = inproceedings
%A = Giatsidis, Christos and Thilikos, Dimitrios M. and Vazirgiannis, Michalis
%B = Advances in Social Networks Analysis and Mining (ASONAM), 2011 International Conference on
%D = 2011
%T = Evaluating Cooperation in Communities with the k-Core Structure
%U = http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5992567&tag=1