Sciweavers

5463 search results - page 467 / 1093
» Evaluating algorithms that learn from data streams
Sort
View
CVPR
2009
IEEE
17 years 1 months ago
Global Connectivity Potentials for Random Field Models
Markov random field (MRF, CRF) models are popular in computer vision. However, in order to be computationally tractable they are limited to incorporate only local interactions a...
Sebastian Nowozin, Christoph H. Lampert
WSOM
2009
Springer
16 years 1 months ago
Approaching the Time Dependent Cocktail Party Problem with Online Sparse Coding Neural Gas
Abstract. We show how the “Online Sparse Coding Neural Gas” algorithm can be applied to a more realistic model of the “Cocktail Party Problem”. We consider a setting where ...
Kai Labusch, Erhardt Barth, Thomas Martinetz
BROADNETS
2006
IEEE
16 years 26 days ago
A Statistical Approach to Anomaly Detection in Interdomain Routing
Abstract— A number of events such as hurricanes, earthquakes, power outages can cause large-scale failures in the Internet. These in turn cause anomalies in the interdomain routi...
Shivani Deshpande, Marina Thottan, Tin Kam Ho, Bip...
NIPS
2007
15 years 8 months ago
Learning Bounds for Domain Adaptation
Empirical risk minimization offers well-known learning guarantees when training and test data come from the same domain. In the real world, though, we often wish to adapt a classi...
John Blitzer, Koby Crammer, Alex Kulesza, Fernando...
TCBB
2011
15 years 1 months ago
Data Mining on DNA Sequences of Hepatitis B Virus
: Extraction of meaningful information from large experimental datasets is a key element of bioinformatics research. One of the challenges is to identify genomic markers in Hepatit...
Kwong-Sak Leung, Kin-Hong Lee, Jin Feng Wang, Eddi...