Density-Based Subspace Clustering in Heterogeneous Networks
Lists
Only you see this
Abstract
Many real-world data sets, like data from social media or bibliographic data, can be represented as heterogeneous networks with several vertex types. Often additional attributes are available for the vertices, such as keywords for a paper. Clustering vertices in such networks, and analyzing the complex interactions between clusters of different types, can provide useful insights into the structure of the data. To exploit the full information content of the data, clustering approaches should consider the connections in the network as well as the vertex attributes. We propose the density-based clustering model TCSC for the detection of clusters in heterogeneous networks that are densely connected in the network as well as in the attribute space. Unlike previous approaches for clustering heterogeneous networks, TCSC enables the detection of clusters that show similarity only in a subset of the attributes, which is more effective in the presence of a large number of attributes.
BibTeX
@inproceedings{boden2014density,
author = {Brigitte Boden and Martin Ester and Thomas Seidl},
title = {{Density-Based Subspace Clustering in Heterogeneous Networks}},
booktitle = {ECML/PKDD},
year = {2014},
doi = {10.1007/978-3-662-44848-9\_10},
}Loading related content...