Sciweavers

65 search results - page 13 / 13
» The Monty Python method for generating random variables
Sort
View
BMCBI
2005
163views more  BMCBI 2005»
13 years 6 months ago
Rank-invariant resampling based estimation of false discovery rate for analysis of small sample microarray data
Background: The evaluation of statistical significance has become a critical process in identifying differentially expressed genes in microarray studies. Classical p-value adjustm...
Nitin Jain, HyungJun Cho, Michael O'Connell, Jae K...
AI
2008
Springer
13 years 6 months ago
Solving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
CIKM
2008
Springer
13 years 8 months ago
Modeling hidden topics on document manifold
Topic modeling has been a key problem for document analysis. One of the canonical approaches for topic modeling is Probabilistic Latent Semantic Indexing, which maximizes the join...
Deng Cai, Qiaozhu Mei, Jiawei Han, Chengxiang Zhai
BMCBI
2010
160views more  BMCBI 2010»
13 years 6 months ago
Annotation of gene promoters by integrative data-mining of ChIP-seq Pol-II enrichment data
Background: Use of alternative gene promoters that drive widespread cell-type, tissue-type or developmental gene regulation in mammalian genomes is a common phenomenon. Chromatin ...
Ravi Gupta, Priyankara Wikramasinghe, Anirban Bhat...
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
14 years 3 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...