Sciweavers

296 search results - page 56 / 60
» Weighted nonnegative matrix factorization
Sort
View
UAI
2003
13 years 9 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
BMCBI
2005
89views more  BMCBI 2005»
13 years 7 months ago
Theme discovery from gene lists for identification and viewing of multiple functional groups
Background: High throughput methods of the genome era produce vast amounts of data in the form of gene lists. These lists are large and difficult to interpret without advanced com...
Petri Pehkonen, Garry Wong, Petri Töröne...
WSDM
2012
ACM
301views Data Mining» more  WSDM 2012»
12 years 3 months ago
Learning evolving and emerging topics in social media: a dynamic nmf approach with temporal regularization
As massive repositories of real-time human commentary, social media platforms have arguably evolved far beyond passive facilitation of online social interactions. Rapid analysis o...
Ankan Saha, Vikas Sindhwani
BMCBI
2007
105views more  BMCBI 2007»
13 years 7 months ago
Finding regulatory elements and regulatory motifs: a general probabilistic framework
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
Erik van Nimwegen
SWAT
2010
Springer
302views Algorithms» more  SWAT 2010»
14 years 21 days ago
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
Imran A. Pirwani, Mohammad R. Salavatipour