Sciweavers

732 search results - page 83 / 147
» Strongly Non-U-Shaped Learning Results by General Techniques
Sort
View
KDD
2009
ACM
189views Data Mining» more  KDD 2009»
14 years 3 months ago
CoCo: coding cost for parameter-free outlier detection
How can we automatically spot all outstanding observations in a data set? This question arises in a large variety of applications, e.g. in economy, biology and medicine. Existing ...
Christian Böhm, Katrin Haegler, Nikola S. M&u...
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou
IUI
2005
ACM
14 years 2 months ago
Multimodal new vocabulary recognition through speech and handwriting in a whiteboard scheduling application
Our goal is to automatically recognize and enroll new vocabulary in a multimodal interface. To accomplish this our technique aims to leverage the mutually disambiguating aspects o...
Edward C. Kaiser
ILP
2003
Springer
14 years 2 months ago
A Comparative Evaluation of Feature Set Evolution Strategies for Multirelational Boosting
Boosting has established itself as a successful technique for decreasing the generalization error of classification learners by basing predictions on ensembles of hypotheses. Whil...
Susanne Hoche, Stefan Wrobel
ICIP
2003
IEEE
14 years 10 months ago
Boosting linear discriminant analysis for face recognition
In this paper, we propose a new algorithm to boost performance of traditional Linear Discriminant Analysis (LDA)-based face recognition (FR) methods in complex FR tasks, where hig...
Juwei Lu, Konstantinos N. Plataniotis, Anastasios ...