4009 search results - page 66 / 802 » Clustering on Complex Graphs |
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...
107
click to vote
SDM
2008
SIAM
15 years 1 months ago
2008
SIAM
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
CSE
2009
IEEE
15 years 4 months ago
2009
IEEE
—We apply a simple clustering algorithm to a large dataset of cellular telecommunication records, reducing the complexity of mobile phone users’ full trajectories and allowing ...
WWW
2010
ACM
15 years 6 months ago
2010
ACM
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
CLEF
2010
Springer
15 years 28 days ago
2010
Springer
In the third edition of WePS campaign we have undertaken the person name disambiguation problem referred to as a clustering task. Our aim was to make use of intrinsic link relation...