Sciweavers

72 search results - page 5 / 15
» Consistency of Random Forests and Other Averaging Classifier...
Sort
View
SODA
2010
ACM
146views Algorithms» more  SODA 2010»
14 years 3 months ago
Classified Stable Matching
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
Chien-Chung Huang
ICASSP
2008
IEEE
14 years 21 days ago
A weighted subspace approach for improving bagging performance
Bagging is an ensemble method that uses random resampling of a dataset to construct models. In classification scenarios, the random resampling procedure in bagging induces some c...
Qu-Tang Cai, Chun-Yi Peng, Chang-Shui Zhang
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
14 years 6 months ago
Privacy-Preserving Sharing of Horizontally-Distributed Private Data for Constructing Accurate Classifiers
Data mining tasks such as supervised classification can often benefit from a large training dataset. However, in many application domains, privacy concerns can hinder the construc...
Vincent Yan Fu Tan, See-Kiong Ng
CIKM
2010
Springer
13 years 4 months ago
Online stratified sampling: evaluating classifiers at web-scale
Deploying a classifier to large-scale systems such as the web requires careful feature design and performance evaluation. Evaluation is particularly challenging because these larg...
Paul N. Bennett, Vitor R. Carvalho
ECCV
2004
Springer
14 years 8 months ago
Temporal Factorization vs. Spatial Factorization
The traditional subspace-based approaches to segmentation (often referred to as multi-body factorization approaches) provide spatial clustering/segmentation by grouping together po...
Lihi Zelnik-Manor, Michal Irani