Sciweavers

354 search results - page 70 / 71
» Top-k learning to rank: labeling, ranking and evaluation
Sort
View
BMCBI
2007
145views more  BMCBI 2007»
13 years 5 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 5 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
SIGIR
2005
ACM
13 years 10 months ago
Linear discriminant model for information retrieval
This paper presents a new discriminative model for information retrieval (IR), referred to as linear discriminant model (LDM), which provides a flexible framework to incorporate a...
Jianfeng Gao, Haoliang Qi, Xinsong Xia, Jian-Yun N...
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
13 years 10 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
BMCBI
2010
102views more  BMCBI 2010»
13 years 5 months ago
Peptide binding predictions for HLA DR, DP and DQ molecules
Background: MHC class II binding predictions are widely used to identify epitope candidates in infectious agents, allergens, cancer and autoantigens. The vast majority of predicti...
Peng Wang, John Sidney, Yohan Kim, Alessandro Sett...