Sciweavers

695 search results - page 7 / 139
» The structure of intrinsic complexity of learning
Sort
View
COLT
2001
Springer
13 years 12 months ago
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...
Peter L. Bartlett, Shahar Mendelson
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 3 days ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
NIPS
2003
13 years 8 months ago
Learning with Local and Global Consistency
We consider the general problem of learning from labeled and unlabeled data, which is often called semi-supervised learning or transductive inference. A principled approach to sem...
Dengyong Zhou, Olivier Bousquet, Thomas Navin Lal,...
COMPLEXITY
2010
124views more  COMPLEXITY 2010»
13 years 4 months ago
Spatially embedded dynamics and complexity
To gain a deeper understanding of the impact of spatial embedding on the dynamics of complex systems we employ a measure of interaction complexity developed within neuroscience us...
Christopher L. Buckley, Seth Bullock, Lionel Barne...
CCIA
2008
Springer
13 years 9 months ago
On the Dimensions of Data Complexity through Synthetic Data Sets
Abstract. This paper deals with the characterization of data complexity and the relationship with the classification accuracy. We study three dimensions of data complexity: the len...
Núria Macià, Ester Bernadó-Ma...