Sciweavers

1651 search results - page 126 / 331
» Measuring the Complexity of Classification Problems
Sort
View
TNN
2010
216views Management» more  TNN 2010»
13 years 2 months ago
Simplifying mixture models through function approximation
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
Kai Zhang, James T. Kwok
CVPR
2007
IEEE
14 years 10 months ago
Learning Object Material Categories via Pairwise Discriminant Analysis
In this paper, we investigate linear discriminant analysis (LDA) methods for multiclass classification problems in hyperspectral imaging. We note that LDA does not consider pairwi...
Zhouyu Fu, Antonio Robles-Kelly
ICML
2003
IEEE
14 years 8 months ago
Unsupervised Learning with Permuted Data
We consider the problem of unsupervised learning from a matrix of data vectors where in each row the observed values are randomly permuted in an unknown fashion. Such problems ari...
Sergey Kirshner, Sridevi Parise, Padhraic Smyth
DAGSTUHL
2009
13 years 9 months ago
Advances in Feature Selection with Mutual Information
The selection of features that are relevant for a prediction or classification problem is an important problem in many domains involving high-dimensional data. Selecting features h...
Michel Verleysen, Fabrice Rossi, Damien Fran&ccedi...
WWW
2007
ACM
14 years 8 months ago
Determining the user intent of web search engine queries
Determining the user intent of Web searches is a difficult problem due to the sparse data available concerning the searcher. In this paper, we examine a method to determine the us...
Bernard J. Jansen, Danielle L. Booth, Amanda Spink