30 search results - page 2 / 6 » An extended version of the k-means method for overlapping cl... |
JUCS
2010
13 years 2 months ago
2010
: Visualizing and understanding large conceptual schemas requires the use of specific methods. These methods generate clustered, summarized, or focused schemas that are easier to v...
MST
2010
13 years 2 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
We consider the problem of quantizing data generated from disparate sources, e.g. subjects performing actions with different styles, movies with particular genre bias, various con...
COLT
2003
Springer
14 years 17 days ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
ICPR
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper, we propose a new algorithm for extending the hierarchical clustering methods and introduce a Multi-View Agglomerative Clustering approach to handle multi-view repre...