Sciweavers

994 search results - page 146 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
ICML
2010
IEEE
15 years 4 months ago
Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...
LACL
2001
Springer
15 years 7 months ago
Structural Equations in Language Learning
In categorial systems with a fixed structural component, the learning problem comes down to finding the solution for a set of typeassignment equations. A hard-wired structural co...
Michael Moortgat
DBWORKSHOPS
1992
15 years 4 months ago
An Incremental Concept Formation Approach for Learning from Databases
Godin, R. and R. Missaoui, An incremental concept formation approach for learning from databases, Theoretical Computer Science 133 (1994) 3533385. This paper describes a concept f...
Rokia Missaoui, Robert Godin
PAKDD
2004
ACM
131views Data Mining» more  PAKDD 2004»
15 years 8 months ago
A Tree-Based Approach to the Discovery of Diagnostic Biomarkers for Ovarian Cancer
Computational diagnosis of cancer is a classification problem, and it has two special requirements on a learning algorithm: perfect accuracy and small number of features used in t...
Jinyan Li, Kotagiri Ramamohanarao
ICCV
2007
IEEE
15 years 9 months ago
Contextual Distance for Data Perception
Structural perception of data plays a fundamental role in pattern analysis and machine learning. In this paper, we develop a new structural perception of data based on local conte...
Deli Zhao, Zhouchen Lin, Xiaoou Tang