Sciweavers

246 search results - page 47 / 50
» On Optimal Learning Algorithms for Multiplicity Automata
Sort
View
CIKM
2010
Springer
13 years 6 months ago
Improved index compression techniques for versioned document collections
Current Information Retrieval systems use inverted index structures for efficient query processing. Due to the extremely large size of many data sets, these index structures are u...
Jinru He, Junyuan Zeng, Torsten Suel
ICDE
2011
IEEE
200views Database» more  ICDE 2011»
12 years 11 months ago
Deriving probabilistic databases with inference ensembles
— Many real-world applications deal with uncertain or missing data, prompting a surge of activity in the area of probabilistic databases. A shortcoming of prior work is the assum...
Julia Stoyanovich, Susan B. Davidson, Tova Milo, V...
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
14 years 27 days ago
Combining partitions by probabilistic label aggregation
Data clustering represents an important tool in exploratory data analysis. The lack of objective criteria render model selection as well as the identification of robust solutions...
Tilman Lange, Joachim M. Buhmann
BMCBI
2006
100views more  BMCBI 2006»
13 years 7 months ago
Using the nucleotide substitution rate matrix to detect horizontal gene transfer
Background: Horizontal gene transfer (HGT) has allowed bacteria to evolve many new capabilities. Because transferred genes perform many medically important functions, such as conf...
Micah Hamady, M. D. Betterton, Rob Knight
KDD
2012
ACM
205views Data Mining» more  KDD 2012»
11 years 9 months ago
Rank-loss support instance machines for MIML instance annotation
Multi-instance multi-label learning (MIML) is a framework for supervised classification where the objects to be classified are bags of instances associated with multiple labels....
Forrest Briggs, Xiaoli Z. Fern, Raviv Raich