Sciweavers

235 search results - page 19 / 47
» An empirical study into class testability
Sort
View
SIGSOFT
2010
ACM
13 years 7 months ago
The missing links: bugs and bug-fix commits
Empirical studies of software defects rely on links between bug databases and program code repositories. This linkage is typically based on bug-fixes identified in developer-enter...
Adrian Bachmann, Christian Bird, Foyzur Rahman, Pr...
AAAI
2008
13 years 12 months ago
Classification by Discriminative Regularization
Classification is one of the most fundamental problems in machine learning, which aims to separate the data from different classes as far away as possible. A common way to get a g...
Bin Zhang, Fei Wang, Ta-Hsin Li, Wen Jun Yin, Jin ...
ICPR
2008
IEEE
14 years 4 months ago
Harmonic mean for subspace selection
Under the homoscedastic Gaussian assumption, it has been shown that Fisher’s linear discriminant analysis (FLDA) suffers from the class separation problem when the dimensionalit...
Wei Bian, Dacheng Tao
MA
2011
Springer
285views Communications» more  MA 2011»
13 years 4 months ago
Dual divergence estimators and tests: Robustness results
The class of dual φ-divergence estimators (introduced in Broniatowski and Keziou (2009) [6]) is explored with respect to robustness through the influence function approach. For ...
Aida Toma, Michel Broniatowski
CP
2007
Springer
14 years 3 months ago
Hierarchical Hardness Models for SAT
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...
Lin Xu, Holger H. Hoos, Kevin Leyton-Brown