Sciweavers

3411 search results - page 590 / 683
» Adaptive Transfer Learning
Sort
View
123
Voted
FOCS
1995
IEEE
15 years 7 months ago
Tracking the Best Disjunction
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
Peter Auer, Manfred K. Warmuth
KDD
1995
ACM
129views Data Mining» more  KDD 1995»
15 years 7 months ago
Feature Extraction for Massive Data Mining
Techniques for learning from data typically require data to be in standard form. Measurements must be encoded in a numerical format such as binary true-or-false features, numerica...
V. Seshadri, Raguram Sasisekharan, Sholom M. Weiss
FLAIRS
2007
15 years 5 months ago
Managing Dynamic Contexts Using Failure-Driven Stochastic Models
We describe an architecture for representing and managing context shifts that supports dynamic data interpretation. This architecture utilizes two layers of learning and three lay...
Nikita A. Sakhanenko, George F. Luger, Carl R. Ste...
CEAS
2008
Springer
15 years 5 months ago
Exploiting Transport-Level Characteristics of Spam
We present a novel spam detection technique that relies on neither content nor reputation analysis. This work investigates the discriminatory power of email transport-layer charac...
Robert Beverly, Karen R. Sollins
ALT
2010
Springer
15 years 5 months ago
Inferring Social Networks from Outbreaks
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
Dana Angluin, James Aspnes, Lev Reyzin