Sciweavers

6715 search results - page 1232 / 1343
» Learning from a Test Set
Sort
View
MLMI
2005
Springer
15 years 12 months ago
The AMI Meeting Corpus: A Pre-announcement
Abstract. The AMI Meeting Corpus is a multi-modal data set consisting of 100 hours of meeting recordings. It is being created in the context of a project that is developing meeting...
Jean Carletta, Simone Ashby, Sebastien Bourban, Mi...
CIDM
2009
IEEE
15 years 10 months ago
Empirical comparison of graph classification algorithms
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
Nikhil S. Ketkar, Lawrence B. Holder, Diane J. Coo...
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
15 years 7 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
BMCBI
2007
143views more  BMCBI 2007»
15 years 6 months ago
Gene selection for classification of microarray data based on the Bayes error
Background: With DNA microarray data, selecting a compact subset of discriminative genes from thousands of genes is a critical step for accurate classification of phenotypes for, ...
Ji-Gang Zhang, Hong-Wen Deng
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 3 months ago
The Non-Bayesian Restless Multi-Armed Bandit: a Case of Near-Logarithmic Regret
In the classic Bayesian restless multi-armed bandit (RMAB) problem, there are N arms, with rewards on all arms evolving at each time as Markov chains with known parameters. A play...
Wenhan Dai, Yi Gai, Bhaskar Krishnamachari, Qing Z...
« Prev « First page 1232 / 1343 Last » Next »