Sciweavers

716 search results - page 85 / 144
» Optimizing Sorting with Machine Learning Algorithms
Sort
View
IDEAL
2009
Springer
14 years 12 months ago
Optimizing Data Transformations for Classification Tasks
Many classification algorithms use the concept of distance or similarity between patterns. Previous work has shown that it is advantageous to optimize general Euclidean distances (...
José María Valls, Ricardo Aler
120
Voted
ECML
2006
Springer
15 years 5 months ago
Combinatorial Markov Random Fields
Abstract. A combinatorial random variable is a discrete random variable defined over a combinatorial set (e.g., a power set of a given set). In this paper we introduce combinatoria...
Ron Bekkerman, Mehran Sahami, Erik G. Learned-Mill...
FUIN
2011
358views Cryptology» more  FUIN 2011»
14 years 5 months ago
Unsupervised and Supervised Learning Approaches Together for Microarray Analysis
In this article, a novel concept is introduced by using both unsupervised and supervised learning. For unsupervised learning, the problem of fuzzy clustering in microarray data as ...
Indrajit Saha, Ujjwal Maulik, Sanghamitra Bandyopa...
113
Voted
ICML
2005
IEEE
16 years 3 months ago
Learning the structure of Markov logic networks
Markov logic networks (MLNs) combine logic and probability by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. In this pap...
Stanley Kok, Pedro Domingos
121
Voted
GECCO
2006
Springer
208views Optimization» more  GECCO 2006»
15 years 5 months ago
Comparing evolutionary and temporal difference methods in a reinforcement learning domain
Both genetic algorithms (GAs) and temporal difference (TD) methods have proven effective at solving reinforcement learning (RL) problems. However, since few rigorous empirical com...
Matthew E. Taylor, Shimon Whiteson, Peter Stone