Sciweavers

627 search results - page 63 / 126
» Learning from Logged Implicit Exploration Data
Sort
View
106
Voted
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
15 years 2 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
111
Voted
AMAI
2004
Springer
15 years 6 months ago
Using the Central Limit Theorem for Belief Network Learning
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...
Ian Davidson, Minoo Aminian
ICML
2009
IEEE
16 years 1 months ago
Identifying suspicious URLs: an application of large-scale online learning
This paper explores online learning approaches for detecting malicious Web sites (those involved in criminal scams) using lexical and host-based features of the associated URLs. W...
Justin Ma, Lawrence K. Saul, Stefan Savage, Geoffr...
113
Voted
IEAAIE
2010
Springer
14 years 10 months ago
A Study of Detecting Computer Viruses in Real-Infected Files in the n-Gram Representation with Machine Learning Methods
Abstract. Machine learning methods were successfully applied in recent years for detecting new and unseen computer viruses. The viruses were, however, detected in small virus loade...
Thomas Stibor
101
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Exploiting active-learning strategies for annotating prosodic events with limited labeled data
Many applications of spoken-language systems can benefit from having access to annotations of prosodic events. Unfortunately, obtaining human annotations of these events, even se...
Raul Fernandez, Bhuvana Ramabhadran