Sciweavers

510 search results - page 13 / 102
» Sparse probabilistic projections
Sort
View
CORR
2012
Springer
220views Education» more  CORR 2012»
12 years 3 months ago
Sparse Topical Coding
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic t...
Jun Zhu, Eric P. Xing
NIPS
2007
13 years 9 months ago
Sparse Overcomplete Latent Variable Decomposition of Counts Data
An important problem in many fields is the analysis of counts data to extract meaningful latent components. Methods like Probabilistic Latent Semantic Analysis (PLSA) and Latent ...
Madhusudana V. S. Shashanka, Bhiksha Raj, Paris Sm...
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
13 years 9 months ago
Learning incoherent sparse and low-rank patterns from multiple tasks
We consider the problem of learning incoherent sparse and lowrank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the spa...
Jianhui Chen, Ji Liu, Jieping Ye
VLDB
2007
ACM
95views Database» more  VLDB 2007»
14 years 7 months ago
Matching Twigs in Probabilistic XML
Evaluation of twig queries over probabilistic XML is investigated. Projection is allowed and, in particular, a query may be Boolean. It is shown that for a well-known model of pro...
Benny Kimelfeld, Yehoshua Sagiv
HVC
2007
Springer
108views Hardware» more  HVC 2007»
14 years 1 months ago
How Fast and Fat Is Your Probabilistic Model Checker? An Experimental Performance Comparison
Abstract. This paper studies the efficiency of several probabilistic model checkers by comparing verification times and peak memory usage for a set of standard case studies. The s...
David N. Jansen, Joost-Pieter Katoen, Marcel Olden...