Sciweavers

1110 search results - page 1 / 222
» Clustering with the Connectivity Kernel
Sort
View
73
Voted
NIPS
2003
15 years 9 days ago
Clustering with the Connectivity Kernel
Clustering aims at extracting hidden structure in dataset. While the problem of finding compact clusters has been widely studied in the literature, extracting arbitrarily formed ...
Bernd Fischer, Volker Roth, Joachim M. Buhmann
IADIS
2004
15 years 10 days ago
Speculative TCP Connection Admission Using Connection Migration in Cluster-Based Servers
This paper presents speculative TCP connection admission, a mechanism for improving sub-optimal request distribution decisions in cluster-based servers. Overloaded server nodes in...
Vlad Olaru, Walter F. Tichy
82
Voted
NIPS
2007
15 years 10 days ago
Discriminative K-means for Clustering
We present a theoretical study on the discriminative clustering framework, recently proposed for simultaneous subspace selection via linear discriminant analysis (LDA) and cluster...
Jieping Ye, Zheng Zhao, Mingrui Wu
ICML
2005
IEEE
15 years 11 months ago
Semi-supervised graph clustering: a kernel approach
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Ray...
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
15 years 11 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis