Sciweavers

2391 search results - page 224 / 479
» A Portfolio Approach to Algorithm Selection
Sort
View
246
Voted
ICDE
2012
IEEE
246views Database» more  ICDE 2012»
13 years 9 months ago
HiCS: High Contrast Subspaces for Density-Based Outlier Ranking
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
Fabian Keller, Emmanuel Müller, Klemens B&oum...
SIGIR
2012
ACM
13 years 9 months ago
Inferring missing relevance judgments from crowd workers via probabilistic matrix factorization
In crowdsourced relevance judging, each crowd worker typically judges only a small number of examples, yielding a sparse and imbalanced set of judgments in which relatively few wo...
Hyun Joon Jung, Matthew Lease
AIMSA
2008
Springer
16 years 1 months ago
Prototypes Based Relational Learning
Relational instance-based learning (RIBL) algorithms offer high prediction capabilities. However, they do not scale up well, specially in domains where there is a time bound for c...
Rocío García-Durán, Fernando ...
CIKM
2011
Springer
14 years 7 months ago
Factorization-based lossless compression of inverted indices
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
George Beskales, Marcus Fontoura, Maxim Gurevich, ...
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
16 years 19 days ago
Evolving neural network ensembles for control problems
In neuroevolution, a genetic algorithm is used to evolve a neural network to perform a particular task. The standard approach is to evolve a population over a number of generation...
David Pardoe, Michael S. Ryoo, Risto Miikkulainen