Sciweavers

836 search results - page 118 / 168
» Online EM Algorithm for Latent Data Models
Sort
View
107
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Maximum marginal likelihood estimation for nonnegative dictionary learning
We describe an alternative to standard nonnegative matrix factorisation (NMF) for nonnegative dictionary learning. NMF with the Kullback-Leibler divergence can be seen as maximisa...
Onur Dikmen, Cédric Févotte
AAAI
2012
13 years 3 months ago
Sparse Probabilistic Relational Projection
Probabilistic relational PCA (PRPCA) can learn a projection matrix to perform dimensionality reduction for relational data. However, the results learned by PRPCA lack interpretabi...
Wu-Jun Li, Dit-Yan Yeung
106
Voted
MONET
2006
141views more  MONET 2006»
15 years 16 days ago
An Energy-Optimal Algorithm for Neighbor Discovery in Wireless Sensor Networks
We consider sensor networks in which individual nodes with on-board sensing and low-power transmitters and receivers establish connections with neighboring nodes. The overall objec...
Ritesh Madan, Sanjay Lall
CIKM
2008
Springer
15 years 2 months ago
The query-flow graph: model and applications
Query logs record the queries and the actions of the users of search engines, and as such they contain valuable information about the interests, the preferences, and the behavior ...
Paolo Boldi, Francesco Bonchi, Carlos Castillo, De...
94
Voted
SDM
2007
SIAM
198views Data Mining» more  SDM 2007»
15 years 2 months ago
Learning from Time-Changing Data with Adaptive Windowing
We present a new approach for dealing with distribution change and concept drift when learning from data sequences that may vary with time. We use sliding windows whose size, inst...
Albert Bifet, Ricard Gavaldà