Sciweavers

1950 search results - page 256 / 390
» Informative sampling for large unbalanced data sets
Sort
View
147
Voted
STACS
2007
Springer
15 years 9 months ago
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
Artur Czumaj, Christian Sohler
135
Voted
BMCBI
2008
117views more  BMCBI 2008»
15 years 3 months ago
New resampling method for evaluating stability of clusters
Background: Hierarchical clustering is a widely applied tool in the analysis of microarray gene expression data. The assessment of cluster stability is a major challenge in cluste...
Irina Gana Dresen, Tanja Boes, Johannes Hüsin...
132
Voted
PR
2006
83views more  PR 2006»
15 years 3 months ago
Optimal convex error estimators for classification
A cross-validation error estimator is obtained by repeatedly leaving out some data points, deriving classifiers on the remaining points, computing errors for these classifiers on ...
Chao Sima, Edward R. Dougherty
147
Voted
ADMA
2008
Springer
186views Data Mining» more  ADMA 2008»
15 years 10 months ago
A Distributed Privacy-Preserving Association Rules Mining Scheme Using Frequent-Pattern Tree
Association rules mining is a frequently used technique which finds interesting association and correlation relationships among large set of data items which occur frequently toge...
Chunhua Su, Kouichi Sakurai
PKDD
2009
Springer
153views Data Mining» more  PKDD 2009»
15 years 10 months ago
Subspace Regularization: A New Semi-supervised Learning Method
Most existing semi-supervised learning methods are based on the smoothness assumption that data points in the same high density region should have the same label. This assumption, ...
Yan-Ming Zhang, Xinwen Hou, Shiming Xiang, Cheng-L...