Sciweavers

1766 search results - page 185 / 354
» Classifier Selection Based on Data Complexity Measures
Sort
View
COMPSAC
2010
IEEE
14 years 11 months ago
Minimising the Preparation Cost of Runtime Testing Based on Testability Metrics
Abstract--Test cost minimisation approaches have traditionally been devoted to minimising "execution costs", while maximising coverage or reliability. However, in a runti...
Alberto González-Sanchez, Éric Piel,...
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
16 years 2 months ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel
92
Voted
ISBI
2008
IEEE
16 years 2 months ago
Deconvolution of 3D fluorescence micrographs with automatic risk minimization
We investigate the problem of automatic tuning of a deconvolution algorithm for three-dimensional (3D) fluorescence microscopy; specifically, the selection of the regularization p...
Sathish Ramani, Cédric Vonesch, Michael Uns...
ICDE
2000
IEEE
82views Database» more  ICDE 2000»
16 years 3 months ago
Similarity Search for Multidimensional Data Sequences
Time-series data, which are a series of one-dimensional real numbers, have been studied in various database applications. In this paper, we extend the traditional similarity searc...
Seok-Lyong Lee, Seok-Ju Chun, Deok-Hwan Kim, Ju-Ho...
ICML
2004
IEEE
16 years 2 months ago
Predictive automatic relevance determination by expectation propagation
In many real-world classification problems the input contains a large number of potentially irrelevant features. This paper proposes a new Bayesian framework for determining the r...
Yuan (Alan) Qi, Thomas P. Minka, Rosalind W. Picar...