Sciweavers

1290 search results - page 151 / 258
» New algorithms of the Q-learning type
Sort
View
ICML
2009
IEEE
14 years 9 months ago
Compositional noisy-logical learning
We describe a new method for learning the conditional probability distribution of a binary-valued variable from labelled training examples. Our proposed Compositional Noisy-Logica...
Alan L. Yuille, Songfeng Zheng
ICML
2004
IEEE
14 years 9 months ago
Decision trees with minimal costs
We propose a simple, novel and yet effective method for building and testing decision trees that minimizes the sum of the misclassification and test costs. More specifically, we f...
Charles X. Ling, Qiang Yang, Jianning Wang, Shicha...
KDD
2001
ACM
169views Data Mining» more  KDD 2001»
14 years 9 months ago
Hierarchical cluster analysis of SAGE data for cancer profiling
In this paper we present a method for clustering SAGE (Serial Analysis of Gene Expression) data to detect similarities and dissimilarities between different types of cancer on the...
Jörg Sander, Monica C. Sleumer, Raymond T. Ng
RECOMB
2005
Springer
14 years 9 months ago
Combinatorial Genetic Regulatory Network Analysis Tools for High Throughput Transcriptomic Data
: A series of genome-scale algorithms and high-performance implementations is described and shown to be useful in the genetic analysis of gene transcription. With them it is possib...
Elissa J. Chesler, Michael A. Langston
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 9 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang