Sciweavers

521 search results - page 15 / 105
» Sparse probabilistic classifiers
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...
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...
IJDMB
2007
119views more  IJDMB 2007»
13 years 7 months ago
Simulation study in Probabilistic Boolean Network models for genetic regulatory networks
: Probabilistic Boolean Network (PBN) is widely used to model genetic regulatory networks. Evolution of the PBN is according to the transition probability matrix. Steady-state (lon...
Shuqin Zhang, Wai-Ki Ching, Michael K. Ng, Tatsuya...
KDD
2003
ACM
157views Data Mining» more  KDD 2003»
14 years 8 months ago
Cross-training: learning probabilistic mappings between topics
Classification is a well-established operation in text mining. Given a set of labels A and a set DA of training documents tagged with these labels, a classifier learns to assign l...
Sunita Sarawagi, Soumen Chakrabarti, Shantanu Godb...