Sciweavers

683 search results - page 61 / 137
» Generalization Bounds for Learning Kernels
Sort
View
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
14 years 4 months ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar
WWW
2007
ACM
14 years 10 months ago
Web page classification with heterogeneous data fusion
Web pages are more than text and they contain much contextual and structural information, e.g., the title, the meta data, the anchor text, etc., each of which can be seen as a dat...
Zenglin Xu, Irwin King, Michael R. Lyu
MM
2010
ACM
137views Multimedia» more  MM 2010»
13 years 10 months ago
Unsupervised summarization of rushes videos
This paper proposes a new framework to formulate the problem of rushes video summarization as an unsupervised learning problem. We pose the problem of video summarization as one o...
Yang Liu, Feng Zhou, Wei Liu, Fernando De la Torre...
ICML
2010
IEEE
13 years 11 months ago
On the Interaction between Norm and Dimensionality: Multiple Regimes in Learning
A learning problem might have several measures of complexity (e.g., norm and dimensionality) that affect the generalization error. What is the interaction between these complexiti...
Percy Liang, Nati Srebro
ICML
2007
IEEE
14 years 10 months ago
Discriminative learning for differing training and test distributions
We address classification problems for which the training instances are governed by a distribution that is allowed to differ arbitrarily from the test distribution--problems also ...
Michael Brückner, Steffen Bickel, Tobias Sche...