[BibTeX] [RIS]
Clustering on Dynamic Social Network Data
Type of publication: Inproceedings
Citation:
Year: 2012
Pages: 563-571
Crossref: kruse_synergies_2012:
DOI: 10.1007/978-3-642-33042-1_60
Abstract: This paper presents a reference data set along with a labeling for graph clustering algorithms, especially for those handling dynamic graph data. We implemented a modi cation of Iterative Conductance Cutting and a spectral clustering. As base data set we used a ltered part of the Enron corpus. Di erent cluster measurements, as intra-cluster density, inter-cluster sparseness, and Q-Modularity were calculated on the results of the clustering to be able to compare results from other algorithms.
Keywords:
Authors Held, Pascal
Dannies, Kai
Added by: []
Total mark: 0
Attachments
    Notes
      Topics