3068 search results - page 57 / 614 » Clustering with Multiple Graphs |
LATIN
2010
Springer
15 years 7 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...
83
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
We present a novel unsupervised learning scheme that simultaneously clusters variables of several types (e.g., documents, words and authors) based on pairwise interactions between...
91
Voted
COCOON
2009
Springer
15 years 7 months ago
2009
Springer
We introduce overlap cluster graph modification problems where, other than in most previous work, the clusters of the target graph may overlap. More precisely, the studied graph p...
116
Voted
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 ...
112
click to vote
MCS
2010
Springer
15 years 2 months ago
2010
Springer
Selecting a set of good and diverse base classifiers is essential for building multiple classifier systems. However, almost all commonly used procedures for selecting such base cla...