119 search results - page 2 / 24 » Pruning Training Samples Using a Supervised Clustering Algor... |
128
Voted
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper we propose a new clustering algorithm which combines the FCM clustering algorithm with the supervised learning normal mixture model; we call the algorithm as the FCM...
95
Voted
ICCAD
2007
IEEE
15 years 11 months ago
2007
IEEE
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
130
Voted
ICML
1998
IEEE
16 years 2 months ago
1998
IEEE
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
144
Voted
ICIP
2003
IEEE
16 years 3 months ago
2003
IEEE
In this paper, we study unsupervised image segmentation using wavelet-domain hidden Markov models (HMMs). We first review recent supervised Bayesian image segmentation algorithms ...
146
click to vote
IMCSIT
2010
14 years 11 months ago
2010
Word Sense Disambiguation in text is still a difficult problem as the best supervised methods require laborious and costly manual preparation of training data. Thus, this work focu...