Sciweavers

131 search results - page 4 / 27
» Two new regularized AdaBoost algorithms
Sort
View
PR
2006
108views more  PR 2006»
13 years 10 months ago
Boosted discriminant projections for nearest neighbor classification
In this paper we introduce a new embedding technique to find the linear projection that best projects labeled data samples into a new space where the performance of a Nearest Neig...
David Masip, Jordi Vitrià
PAMI
2011
13 years 5 months ago
Cost-Sensitive Boosting
—A novel framework is proposed for the design of cost-sensitive boosting algorithms. The framework is based on the identification of two necessary conditions for optimal cost-sen...
Hamed Masnadi-Shirazi, Nuno Vasconcelos
PKDD
2009
Springer
117views Data Mining» more  PKDD 2009»
14 years 5 months ago
New Regularized Algorithms for Transductive Learning
Abstract. We propose a new graph-based label propagation algorithm for transductive learning. Each example is associated with a vertex in an undirected graph and a weighted edge be...
Partha Pratim Talukdar, Koby Crammer
IPL
2007
105views more  IPL 2007»
13 years 10 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk
HCI
2007
14 years 9 days ago
A New Method for Multi-finger Detection Using a Regular Diffuser
In this paper, we developed a fingertip finding algorithm working with a regular diffuser. The proposed algorithm works on images captured by infra-red cameras, settled on one side...
Li-Wei Chan, Yi-Fan Chuang, Yi-Wei Chia, Yi-Ping H...