Combining email models for false positive reduction
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Nonstochastic bandits: Countable decision set, unbounded costs and reactive environments
Theoretical Computer Science
Rank minimization via online learning
Proceedings of the 25th international conference on Machine learning
Meta methods for model sharing in personal information systems
ACM Transactions on Information Systems (TOIS)
Consistency of discrete Bayesian learning
Theoretical Computer Science
A simpler unified analysis of budget perceptrons
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Reading the markets: forecasting public opinion of political candidates by news analysis
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
On Fixed Convex Combinations of No-Regret Learners
MLDM '09 Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition
Feature selection via Boolean independent component analysis
Information Sciences: an International Journal
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Information and Computation
Distributed algorithms for approximating wireless network capacity
INFOCOM'10 Proceedings of the 29th conference on Information communications
Probably approximately correct learning
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 2
Online multiple kernel learning: algorithms and mistake bounds
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Editorial: Classifying text streams by keywords using classifier ensemble
Data & Knowledge Engineering
Adaptive boosting for transfer learning using dynamic updates
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part I
The missing consistency theorem for bayesian learning: stochastic model selection
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Learning to select negotiation strategies in multi-agent meeting scheduling
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
Multi-armed bandit algorithms and empirical evaluation
ECML'05 Proceedings of the 16th European conference on Machine Learning
Sensitive error correcting output codes
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Using restrictive classification and meta classification for junk elimination
ECIR'05 Proceedings of the 27th European conference on Advances in Information Retrieval Research
An online framework for learning novel concepts over multiple cues
ACCV'09 Proceedings of the 9th Asian conference on Computer Vision - Volume Part I
Automatic document organization in a p2p environment
ECIR'06 Proceedings of the 28th European conference on Advances in Information Retrieval
Over-Sampling from an auxiliary domain
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part I
Online Multiple Kernel Classification
Machine Learning
Online submodular minimization
The Journal of Machine Learning Research
Haplotype-based prediction of gene alleles using pedigrees and SNP genotypes
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Automated trading with performance weighted random forests and seasonality
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
The use of highly expanding bipartite multigraphs (called dispersers) to reduce greatly the error of probabilistic algorithms at the cost of few additional random bits is treated. Explicit constructions of such graphs are generalized and used to obtain ...