Sciweavers

2421 search results - page 97 / 485
» Measuring independence of datasets
Sort
View
ICDM
2003
IEEE
109views Data Mining» more  ICDM 2003»
16 years 3 days ago
Comparing Pure Parallel Ensemble Creation Techniques Against Bagging
We experimentally evaluate randomization-based approaches to creating an ensemble of decision-tree classifiers. Unlike methods related to boosting, all of the eight approaches co...
Lawrence O. Hall, Kevin W. Bowyer, Robert E. Banfi...
BMCBI
2008
71views more  BMCBI 2008»
15 years 7 months ago
Examining the significance of fingerprint-based classifiers
Background: Experimental examinations of biofluids to measure concentrations of proteins or their fragments or metabolites are being explored as a means of early disease detection...
Brian T. Luke, Jack R. Collins
TNN
2010
155views Management» more  TNN 2010»
15 years 1 months ago
Incorporating the loss function into discriminative clustering of structured outputs
Clustering using the Hilbert Schmidt independence criterion (CLUHSIC) is a recent clustering algorithm that maximizes the dependence between cluster labels and data observations ac...
Wenliang Zhong, Weike Pan, James T. Kwok, Ivor W. ...
IMAGING
2000
15 years 8 months ago
Evaluation of Bispectral Spectrophotometry for Accurate Colorimetry of Printing Materials
During recent years the need for accurate color measurements has been increasing to achieve proper color management in a number of industries. One of the most wide spread techniqu...
Sergio Gonzalez, Mark D. Fairchild
TIT
2008
89views more  TIT 2008»
15 years 6 months ago
Joint Fixed-Rate Universal Lossy Coding and Identification of Continuous-Alphabet Memoryless Sources
Abstract--The problem of joint universal source coding and density estimation is considered in the setting of fixed-rate lossy coding of continuous-alphabet memoryless sources. For...
Maxim Raginsky