Spectral Clustering: Left-Right-Oscillate Algorithm for Detecting Communities

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F13%3A86089078" target="_blank" >RIV/61989100:27240/13:86089078 - isvavai.cz</a>

Result on the web

<a href="http://link.springer.com/chapter/10.1007/978-3-642-32518-2_27" target="_blank" >http://link.springer.com/chapter/10.1007/978-3-642-32518-2_27</a>

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Spectral Clustering: Left-Right-Oscillate Algorithm for Detecting Communities

Original language description

Detection of communities in the complex networks is an actual problem solved in research area. The paper describes a new algorithm for this purpose. Left-Right-Oscillate algorithm (LRO) is based on spectral ordering of graph vertices. This approach allows us to detect a desired community - either by the size of the smallest communities or by the level of modularity. Since the LRO algorithm detects efficiently communities in large network even when these are not sharply partitioned, it turns to be specially suitable for the analysis of social, complex or coauthor networks. In this paper, proposed algorithm is used for finding communities in a large coauthor network - DBLP.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

IN - Informatics

OECD FORD branch

—

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2013

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Advances in Intelligent Systems and Computing

ISBN

978-3-642-32517-5

ISSN

2194-5357

e-ISSN

—

Number of pages

10

Pages from-to

285-294

Publisher name

Springer

Place of publication

Berlin

Event location

Poznaň

Event date

Sep 17, 2012

Type of event by nationality

EUR - Evropská akce

UT code for WoS article

000312972300027