Sciweavers

3934 search results - page 352 / 787
» A monothetic clustering method
Sort
View
JUCS
2007
118views more  JUCS 2007»
15 years 7 months ago
Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
Gabriel Istrate
CVPR
2009
IEEE
17 years 2 months ago
Constrained Clustering via Spectral Regularization
We propose a novel framework for constrained spectral clustering with pairwise constraints which specify whether two objects belong to the same cluster or not. Unlike previous m...
Zhenguo Li (The Chinese University of Hong Kong), ...
CVPR
2007
IEEE
16 years 9 months ago
Fiber Tract Clustering on Manifolds With Dual Rooted-Graphs
We propose a manifold learning approach to fiber tract clustering using a novel similarity measure between fiber tracts constructed from dual-rooted graphs. In particular, to gene...
Andy Tsai, Carl-Fredrik Westin, Alfred O. Hero, Al...
ICDE
2004
IEEE
120views Database» more  ICDE 2004»
16 years 9 months ago
Substructure Clustering on Sequential 3d Object Datasets
In this paper, we will look at substructure clustering of sequential 3d objects. A sequential 3d object is a set of points located in a three dimensional space that are linked up ...
Zhenqiang Tan, Anthony K. H. Tung
ICML
2007
IEEE
16 years 8 months ago
Graph clustering with network structure indices
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
Matthew J. Rattigan, Marc Maier, David Jensen