Sciweavers

1078 search results - page 108 / 216
» Using Machine Learning to Support Debugging with Tarantula
Sort
View
COLT
2001
Springer
15 years 7 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
CJ
1998
118views more  CJ 1998»
15 years 2 months ago
Least-Squares Structuring, Clustering and Data Processing Issues
Approximation structuring clustering is an extension of what is usually called square-error clustering" onto various cluster structures and data formats. It appears to be not...
Boris Mirkin
IPPS
1999
IEEE
15 years 7 months ago
A Structured Approach to Parallel Programming: Methodology and Models
Parallel programming continues to be difficult, despite substantial and ongoing research aimed at making it tractable. Especially dismaying is the gulf between theory and the pract...
Berna L. Massingill
IUI
2005
ACM
15 years 8 months ago
Intelligent data entry assistant for XML using ensemble learning
XML has emerged as the primary standard of data representation and data exchange [13]. Although many software tools exist to assist the XML implementation process, data must be ma...
Danico Lee, Costas Tsatsoulis
JMLR
2002
135views more  JMLR 2002»
15 years 2 months ago
Covering Number Bounds of Certain Regularized Linear Function Classes
Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In many of these theoretical stud...
Tong Zhang