PUMA publications for /user/stephandoerfel/core%20k-corehttps://puma.uni-kassel.de/user/stephandoerfel/core%20k-corePUMA RSS feed for /user/stephandoerfel/core%20k-core2024-03-29T14:07:45+01:00Evaluating Cooperation in Communities with the k-Core Structurehttps://puma.uni-kassel.de/bibtex/2e635975e729c3aee7575db0485f3e853/stephandoerfelstephandoerfel2014-01-17T15:00:55+01:00community core k-core <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Christos Giatsidis" itemprop="url" href="/author/Christos%20Giatsidis"><span itemprop="name">C. Giatsidis</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Dimitrios M. Thilikos" itemprop="url" href="/author/Dimitrios%20M.%20Thilikos"><span itemprop="name">D. Thilikos</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Michalis Vazirgiannis" itemprop="url" href="/author/Michalis%20Vazirgiannis"><span itemprop="name">M. Vazirgiannis</span></a></span>. </span><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">Advances in Social Networks Analysis and Mining (ASONAM), 2011 International Conference on</span>, </em></span><em>Seite <span itemprop="pagination">87-93</span>. </em>(<em><span>2011<meta content="2011" itemprop="datePublished"/></span></em>)Fri Jan 17 15:00:55 CET 2014Advances in Social Networks Analysis and Mining (ASONAM), 2011 International Conference on87-93Evaluating Cooperation in Communities with the k-Core Structure2011community core k-core 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.IEEE Xplore - Evaluating Cooperation in Communities with the k-Core Structure