Sciweavers

779 search results - page 112 / 156
» Information-theoretic Competitive Learning
Sort
View
JMLR
2008
133views more  JMLR 2008»
13 years 8 months ago
Algorithms for Sparse Linear Classifiers in the Massive Data Setting
Classifiers favoring sparse solutions, such as support vector machines, relevance vector machines, LASSO-regression based classifiers, etc., provide competitive methods for classi...
Suhrid Balakrishnan, David Madigan
JMLR
2006
135views more  JMLR 2006»
13 years 8 months ago
Quantile Regression Forests
Random forests were introduced as a machine learning tool in Breiman (2001) and have since proven to be very popular and powerful for high-dimensional regression and classificatio...
Nicolai Meinshausen
JCAL
2002
39views more  JCAL 2002»
13 years 8 months ago
A preliminary evaluation of a web-mediated 'School for All'
School for All in the EduCities programme is an innovative project funded by both the Ministry of Education and the National Science Council of Taiwan. The project aims to challeng...
S. S. C. Young, T. W. Chan, C. B. Lin
PRL
1998
93views more  PRL 1998»
13 years 8 months ago
A connectionist method for pattern classification with diverse features
A novel connectionist method is proposed to simultaneously use diverse features in an optimal way for pattern classification. Unlike methods of combining multiple classifiers, a m...
Ke Chen 0001
LPAR
2010
Springer
13 years 7 months ago
Partitioning SAT Instances for Distributed Solving
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...