Sciweavers

467 search results - page 38 / 94
» An Efficient Approach to Learning Inhomogeneous Gibbs Model
Sort
View
ICML
2009
IEEE
14 years 9 months ago
Approximate inference for planning in stochastic relational worlds
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...
Tobias Lang, Marc Toussaint
ICML
2009
IEEE
14 years 9 months ago
Convolutional deep belief networks for scalable unsupervised learning of hierarchical representations
There has been much interest in unsupervised learning of hierarchical generative models such as deep belief networks. Scaling such models to full-sized, high-dimensional images re...
Honglak Lee, Roger Grosse, Rajesh Ranganath, Andre...
KDD
2003
ACM
135views Data Mining» more  KDD 2003»
14 years 9 months ago
Efficiently handling feature redundancy in high-dimensional data
High-dimensional data poses a severe challenge for data mining. Feature selection is a frequently used technique in preprocessing high-dimensional data for successful data mining....
Lei Yu, Huan Liu
IJAIT
2006
121views more  IJAIT 2006»
13 years 9 months ago
An Efficient Feature Selection Algorithm for Computer-aided Polyp Detection
We present an efficient feature selection algorithm for computer aided detection (CAD) computed tomographic (CT) colonography. The algorithm 1) determines an appropriate piecewise...
Jiang Li, Jianhua Yao, Ronald M. Summers, Nicholas...
ICML
2007
IEEE
14 years 9 months ago
Exponentiated gradient algorithms for log-linear structured prediction
Conditional log-linear models are a commonly used method for structured prediction. Efficient learning of parameters in these models is therefore an important problem. This paper ...
Amir Globerson, Terry Koo, Xavier Carreras, Michae...