Sciweavers

612 search results - page 3 / 123
» Using Data Compressors to Construct Rank Tests
Sort
View
KDD
2004
ACM
112views Data Mining» more  KDD 2004»
15 years 10 months ago
A rank sum test method for informative gene discovery
Finding informative genes from microarray data is an important research problem in bioinformatics research and applications. Most of the existing methods rank features according t...
Lin Deng, Jian Pei, Jinwen Ma, Dik Lun Lee
JMLR
2012
13 years 16 days ago
Bayesian Comparison of Machine Learning Algorithms on Single and Multiple Datasets
We propose a new method for comparing learning algorithms on multiple tasks which is based on a novel non-parametric test that we call the Poisson binomial test. The key aspect of...
Alexandre Lacoste, François Laviolette, Mar...
ICML
2005
IEEE
15 years 11 months ago
Learning to rank using gradient descent
We investigate using gradient descent methods for learning ranking functions; we propose a simple probabilistic cost function, and we introduce RankNet, an implementation of these...
Christopher J. C. Burges, Tal Shaked, Erin Renshaw...
ICPR
2002
IEEE
15 years 3 months ago
Uniformity Testing Using Minimal Spanning Tree
Testing for uniformity of multivariate data is the initial step in exploratory pattern analysis. We propose a new uniformity testing method, which first computes the maximum (sta...
Anil K. Jain, Xiaowei Xu, Tin Kam Ho, Fan Xiao
77
Voted
BMCBI
2007
128views more  BMCBI 2007»
14 years 10 months ago
Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assess
Background: Similarity of sequences is a key mathematical notion for Classification and Phylogenetic studies in Biology. It is currently primarily handled using alignments. Howeve...
Paolo Ferragina, Raffaele Giancarlo, Valentina Gre...