3949 search results - page 568 / 790 » Machine Learning and Data Mining |
157
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
We propose mixtures of hidden Markov models for modelling clickstreams of web surfers. Hence, the page categorization is learned from the data without the need for a (possibly cumb...
200
click to vote
KDD
2010
ACM
15 years 5 months ago
2010
ACM
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
170
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Sparsity is a desirable property in high dimensional learning. The 1-norm regularization can lead to primal sparsity, while max-margin methods achieve dual sparsity. Combining the...
176
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
The supremacy of n-gram models in statistical language modelling has recently been challenged by parametric models that use distributed representations to counteract the difficult...
170
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
We propose Laplace max-margin Markov networks (LapM3 N), and a general class of Bayesian M3 N (BM3 N) of which the LapM3 N is a special case with sparse structural bias, for robus...