Sciweavers

3050 search results - page 281 / 610
» On-line Algorithms in Machine Learning
Sort
View
ALT
2007
Springer
16 years 1 months ago
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
Lev Reyzin, Nikhil Srivastava
ECML
2006
Springer
15 years 8 months ago
Learning Stochastic Tree Edit Distance
Trees provide a suited structural representation to deal with complex tasks such as web information extraction, RNA secondary structure prediction, or conversion of tree structured...
Marc Bernard, Amaury Habrard, Marc Sebban
ICML
2010
IEEE
15 years 5 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...
ML
2007
ACM
108views Machine Learning» more  ML 2007»
15 years 4 months ago
Unconditional lower bounds for learning intersections of halfspaces
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
Adam R. Klivans, Alexander A. Sherstov
ICIAP
2005
ACM
16 years 4 months ago
A Neural Adaptive Algorithm for Feature Selection and Classification of High Dimensionality Data
In this paper, we propose a novel method which involves neural adaptive techniques for identifying salient features and for classifying high dimensionality data. In particular a ne...
Elisabetta Binaghi, Ignazio Gallo, Mirco Boschetti...