direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Modelle neuronaler Systeme

Ausgewählte Abstracts

Towards community detection in k-partite k-uniform hypergraphs
Zitatschlüssel Neubauer2009a
Autor Neubauer, N. and Obermayer, K.
Buchtitel Workshop on Analyzing Networks and Learning with Graphs, NIPS
Jahr 2009
Zusammenfassung Recently, numerous applications have emerged that create data most naturally interpreted as k-partite k-uniform hypergraphs. We identify benefits and challenges of generalizing community detection algorithms to these structures. We propose an algorithm which handles some of these challenges and a hypergraph generalization of the “caveman” model for the generation of synthetic evaluation datasets. The proposed algorithm outperforms a standard community detection algorithm working on a reduced, graph-like version of the original data, in particular when different domains possess differing community structures.
Link zur Publikation Download Bibtex Eintrag

Zusatzinformationen / Extras

Direktzugang:

Schnellnavigation zur Seite über Nummerneingabe