Sciweavers

4 search results - page 1 / 1
» Sampling Adsorbing Staircase Walks Using a New Markov Chain ...
Sort
View
CSDA
2010
118views more  CSDA 2010»
14 years 10 months ago
Grapham: Graphical models with adaptive random walk Metropolis algorithms
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...
Matti Vihola
STOC
2009
ACM
136views Algorithms» more  STOC 2009»
15 years 10 months ago
Random walks on polytopes and an affine interior point method for linear programming
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
Ravi Kannan, Hariharan Narayanan
SDM
2009
SIAM
157views Data Mining» more  SDM 2009»
15 years 7 months ago
MUSK: Uniform Sampling of k Maximal Patterns.
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
Mohammad Al Hasan, Mohammed Javeed Zaki