4009 search results - page 134 / 802 » Clustering on Complex Graphs |
121
click to vote
SDM
2003
SIAM
15 years 5 months ago
2003
SIAM
This paper presents a general framework for adapting any generative (model-based) clustering algorithm to provide balanced solutions, i.e., clusters of comparable sizes. Partition...
135
click to vote
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
116
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...
160
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
170
click to vote
JCB
2002
15 years 3 months ago
2002
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...