Skip to main navigation Skip to search Skip to main content

Evaluating cooperation in communities with the k-core structure

  • Laboratoire d'Informatique (LIX)
  • Department of Mathematics
  • University of Athens
  • Athens Univ. of Econ. and Business

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

105 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings - 2011 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011
PublisherIEEE Computer Society
Pages87-93
Number of pages7
ISBN (Print)9780769543758
DOIs
Publication statusPublished - 1 Jan 2011
Externally publishedYes

Publication series

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

Keywords

  • Co-authorship graphs
  • Community evaluation
  • Graph mining
  • K-core

Fingerprint

Dive into the research topics of 'Evaluating cooperation in communities with the k-core structure'. Together they form a unique fingerprint.

Cite this