Sciweavers

5659 search results - page 164 / 1132
» Comparing Clusterings in Space
Sort
View
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
14 years 4 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
ICPR
2008
IEEE
14 years 4 months ago
Adaptive selection of non-target cluster centers for K-means tracker
Hua et al. have proposed a stable and efficient tracking algorithm called “K-means tracker”[2, 3, 5]. This paper describes an adaptive non-target cluster center selection met...
Hiroshi Oike, Haiyuan Wu, Toshikazu Wada
CCGRID
2007
IEEE
14 years 4 months ago
Virtual Clusters on the Fly - Fast, Scalable, and Flexible Installation
One of the advantages in virtualized computing clusters compared to traditional shared HPC environments is their ability to accommodate user-specific system customization. Howeve...
Hideo Nishimura, Naoya Maruyama, Satoshi Matsuoka
ECML
2007
Springer
14 years 4 months ago
Spectral Clustering and Embedding with Hidden Markov Models
Abstract. Clustering has recently enjoyed progress via spectral methods which group data using only pairwise affinities and avoid parametric assumptions. While spectral clustering ...
Tony Jebara, Yingbo Song, Kapil Thadani
GLOBECOM
2006
IEEE
14 years 4 months ago
Toposemantic Network Clustering
— We study the problem of building an optimal network-layer clustering hierarchy, where the optimality can be defined using three potentially conflicting metrics: state, delay ...
Leonid B. Poutievski, Kenneth L. Calvert, Jim Grif...