Sciweavers

128 search results - page 4 / 26
» Comparing top k lists
Sort
View
PODS
2001
ACM
127views Database» more  PODS 2001»
16 years 1 months ago
Optimal Aggregation Algorithms for Middleware
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
Ronald Fagin, Amnon Lotem, Moni Naor
SCAM
2006
IEEE
15 years 7 months ago
Stop-List Slicing
Traditional program slicing requires two parameters: a program location and a variable, or perhaps a set of variables, of interest. Stop-list slicing adds a third parameter to the...
Keith Gallagher, David Binkley, Mark Harman
BMCBI
2008
181views more  BMCBI 2008»
15 years 5 days ago
Assessing batch effects of genotype calling algorithm BRLMM for the Affymetrix GeneChip Human Mapping 500 K array set using 270
Background: Genome-wide association studies (GWAS) aim to identify genetic variants (usually single nucleotide polymorphisms [SNPs]) across the entire human genome that are associ...
Huixiao Hong, Zhenqiang Su, Weigong Ge, Leming M. ...
ICB
2009
Springer
132views Biometrics» more  ICB 2009»
14 years 11 months ago
Fusion in Multibiometric Identification Systems: What about the Missing Data?
Many large-scale biometric systems operate in the identification mode and include multimodal information. While biometric fusion is a well-studied problem, most of the fusion schem...
Karthik Nandakumar, Anil K. Jain, Arun Ross
ICMLC
2010
Springer
14 years 11 months ago
A comparative study on two large-scale hierarchical text classification tasks' solutions
: Patent classification is a large scale hierarchical text classification (LSHTC) task. Though comprehensive comparisons, either learning algorithms or feature selection strategies...
Jian Zhang, Hai Zhao, Bao-Liang Lu