705 search results - page 9 / 141 » Proximity Cluster Trees |
INFOCOM
2003
IEEE
14 years 25 days ago
2003
IEEE
Abstract— We perform spectral analysis of the Internet topology at the AS level, by adapting the standard spectral filtering method of examining the eigenvectors corresponding t...
ECML
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Constrained clustering investigates how to incorporate domain knowledge in the clustering process. The domain knowledge takes the form of constraints that must hold on th...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. The presence of noise renders the classical factorization method almost impractical for real-world multi-body motion tracking problems. The main problem stems from the ef...
WADS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...
ICTAI
2006
IEEE
14 years 1 months ago
2006
IEEE
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...