A New Modeling Technique Based on Markov Chains to Mine Behavioral Patterns in Event Based Time Series
暂无分享,去创建一个
[1] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[2] Adrian F. M. Smith,et al. Sampling-Based Approaches to Calculating Marginal Densities , 1990 .
[3] W. K. Hastings,et al. Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .
[4] Ronald A. Howard,et al. Dynamic Programming and Markov Processes , 1960 .
[5] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.
[6] Steven F. Arnold. 18 Gibbs sampling , 1993, Computational Statistics.
[7] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[8] Heikki Mannila,et al. Efficient Algorithms for Discovering Association Rules , 1994, KDD Workshop.
[9] Ramakrishnan Srikant,et al. Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.
[10] P. Diaconis,et al. Geometric Bounds for Eigenvalues of Markov Chains , 1991 .
[11] Donald Geman,et al. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[12] Heikki Mannila,et al. Finding interesting rules from large sets of discovered association rules , 1994, CIKM '94.
[13] S. Chib,et al. Understanding the Metropolis-Hastings Algorithm , 1995 .