576 search results - page 35 / 116 » Structured metric learning for high dimensional problems |
164
click to vote
UAI
2008
15 years 6 months ago
2008
Identifying co-varying causal elements in very high dimensional feature space with internal structures, e.g., a space with as many as millions of linearly ordered features, as one...
143
click to vote
ESANN
2004
15 years 6 months ago
2004
Standard pattern recognition provides effective and noise-tolerant tools for machine learning tasks; however, most approaches only deal with real vectors of a finite and fixed dime...
150
Voted
CORR
2012
Springer
14 years 8 days ago
2012
Springer
We show that the log-likelihood of several probabilistic graphical models is Lipschitz continuous with respect to the p-norm of the parameters. We discuss several implications ...
149
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of pr...
173
click to vote
SIGMOD
2001
ACM
16 years 4 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....