140 search results - page 9 / 28 » icml 2005 |
103
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...
81
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
Supervised clustering is the problem of training a clustering algorithm to produce desirable clusterings: given sets of items and complete clusterings over these sets, we learn ho...
116
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
We derive algorithms for finding a nonnegative n-dimensional tensor factorization (n-NTF) which includes the non-negative matrix factorization (NMF) as a particular case when n = ...
108
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...
106
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
Classifiers that refrain from classification in certain cases can significantly reduce the misclassification cost. However, the parameters for such abstaining classifiers are ofte...