Sciweavers

836 search results - page 65 / 168
» Online EM Algorithm for Latent Data Models
Sort
View
105
Voted
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
15 years 6 months ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar
ICML
2005
IEEE
16 years 1 months ago
A model for handling approximate, noisy or incomplete labeling in text classification
We introduce a Bayesian model, BayesANIL, that is capable of estimating uncertainties associated with the labeling process. Given a labeled or partially labeled training corpus of...
Ganesh Ramakrishnan, Krishna Prasad Chitrapura, Ra...
81
Voted
NIPS
2007
15 years 2 months ago
Convex Clustering with Exemplar-Based Models
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
Danial Lashkari, Polina Golland
113
Voted
ICDM
2009
IEEE
137views Data Mining» more  ICDM 2009»
15 years 7 months ago
A Local Scalable Distributed Expectation Maximization Algorithm for Large Peer-to-Peer Networks
This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining...
Kanishka Bhaduri, Ashok N. Srivastava
IJCNN
2008
IEEE
15 years 7 months ago
Incremental Common Spatial Pattern algorithm for BCI
— A major challenge in applying machine learning methods to Brain-Computer Interfaces (BCIs) is to overcome the on-line non-stationarity of the data blocks. An effective BCI syst...
Qibin Zhao, Liqing Zhang, Andrzej Cichocki, Jie Li