Sciweavers

187 search results - page 12 / 38
» Constrained 1-Spectral Clustering
Sort
View
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
16 years 2 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal
AAAI
2006
15 years 8 months ago
When Is Constrained Clustering Beneficial, and Why?
Several researchers have illustrated that constraints can improve the results of a variety of clustering algorithms. However, there can be a large variation in this improvement, e...
Kiri Wagstaff, Sugato Basu, Ian Davidson
ECCV
2010
Springer
15 years 10 months ago
Learning Shape Segmentation Using Constrained Spectral Clustering and Probabilistic Label Transfer
We propose a spectral learning approach to shape segmentation. The method is composed of a constrained spectral clustering algorithm that is used to supervise the segmentation of a...
CVPR
2009
IEEE
17 years 2 months ago
Appearance-based Keypoint Clustering
We present an algorithm for clustering sets of detected interest points into groups that correspond to visually dis- tinct structure. Through the use of a suitable colour and tex...
Francisco J. Estrada, Pascal Fua, Sabine Süss...
PAKDD
2004
ACM
183views Data Mining» more  PAKDD 2004»
16 years 24 days ago
Constraint-Based Graph Clustering through Node Sequencing and Partitioning
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...
Yu Qian, Kang Zhang, Wei Lai