3096 search results - page 133 / 620 » Theory and Use of the EM Algorithm |
253
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
141
click to vote
SDM
2003
SIAM
15 years 6 months ago
2003
SIAM
We study the interaction between global and local techniques in data mining. Specifically, we study the collections of frequent sets in clusters produced by a probabilistic clust...
156
click to vote
WWW
2009
ACM
16 years 5 months ago
2009
ACM
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages ...
156
click to vote
ICML
1999
IEEE
16 years 5 months ago
1999
IEEE
We present a learning algorithm for non-parametric hidden Markov models with continuous state and observation spaces. All necessary probability densities are approximated using sa...
141
click to vote
HSNMC
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Performance of real-time applications on network communication channels are strongly related to losses and temporal delays. Several studies showed that these network feat...