Sciweavers

459 search results - page 11 / 92
» Average Case Analysis of Conjunctive Learning Algorithms
Sort
View
STACS
2004
Springer
14 years 29 days ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...
PKDD
2004
Springer
102views Data Mining» more  PKDD 2004»
14 years 29 days ago
Improving the Performance of the RISE Algorithm
Ideally, a multi-strategy learning algorithm performs better than its component approaches. RISE is a multi-strategy algorithm that combines rule induction and instance-based learn...
Aloísio Carlos de Pina, Gerson Zaverucha
COLT
2010
Springer
13 years 5 months ago
Principal Component Analysis with Contaminated Data: The High Dimensional Case
We consider the dimensionality-reduction problem (finding a subspace approximation of observed data) for contaminated data in the high dimensional regime, where the number of obse...
Huan Xu, Constantine Caramanis, Shie Mannor
SIGIR
2010
ACM
13 years 11 months ago
Extending average precision to graded relevance judgments
Evaluation metrics play a critical role both in the context of comparative evaluation of the performance of retrieval systems and in the context of learning-to-rank (LTR) as objec...
Stephen E. Robertson, Evangelos Kanoulas, Emine Yi...
SIGOPS
2010
162views more  SIGOPS 2010»
13 years 6 months ago
Visual and algorithmic tooling for system trace analysis: a case study
Despite advances in the application of automated statistical and machine learning techniques to system log and trace data there will always be a need for human analysis of machine...
Wim De Pauw, Steve Heisig