4009 search results - page 187 / 802 » Clustering on Complex Graphs |
128
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...
142
Voted
CANDC
2006
ACM
15 years 4 months ago
2006
ACM
Large-scale experiments and data integration have provided the opportunity to systematically analyze and comprehensively understand the topology of biological networks and biochem...
178
click to vote
PODC
2011
ACM
14 years 7 months ago
2011
ACM
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
134
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
159
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
Data streams are often locally correlated, with a subset of streams exhibiting coherent patterns over a subset of time points. Subspace clustering can discover clusters of objects...