Deconvolutive clustering of Markov states

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4212 LNAI, Issue , 2006, Pages 246-257

  Kabán, Ata ^a   Wang, Xin ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; DATA STRUCTURES; DATABASE SYSTEMS; LEARNING ALGORITHMS; PROBABILITY; SIGNAL PROCESSING;

DECONVOLUTIVE CLUSTERING; INTERNET RELAY CHAT PARTICIPATION;

MARKOV PROCESSES;

EID: 33750325168     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11871842_26     Document Type: Conference Paper

References (21)

1. S.R Adke and S.R Deshmukh. Limit Distribution of a Higher Order Markov Chain. Journal of the Royal Statistical Society B, 1988, 105-108.
2. H Attias and C.E Schreiner. Blind Source Separation and Deconvolution: The Dynamic Component Analysis. Neural Computation, 10(6): 1373-1424, 1998.
3. A.J Bell and T Sejnowski. An information Maximisation Approach to Blind Separation and Blind Deconvolution. Neural Computation, 7:1129-1159, 1995.
4. A Berchtold and A.E Raftery. The Mixture Transition Distribution Model for High-Order Markov Chains and Non-Gaussian Time Series. Statistical Science, 17(3):328-356, 2002.
5. E Bingham, A Kaban and M Girolami. Topic Identification in Dynamical Text by Complexity Pursuit, Neural Processing Letters 17: 1-15, 2003, pp. 69-83.
6. C Cortes, D Pregibon and C Volinsky. Communities of interest. Lecture Notes in Computer Science 2189. 2001.
7. D. Cohn and H. Chang. Learning to Probabilistically Identify Authoritative Documents. Proc. of 17th Int. Conf. on Machine Learning, pp. 167-174, 2000.
8. A.P Dempster, N.M Laird and D.B Rubin. Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal of the Royal Statistical Society. Series B (Methodological), Vol. 39, No. 1. (1977), pp. 1-38.
9. N.J Dingle, P.G Harrison and W.J Knottenbelt. Uniformization and Hypergraph Partitioning for the Distributed Computation of Response Time Densities in Very Large Markov Models. Journal of Parallel and Distributed Computing, 64, 2004, pp. 908-920.
10. L Danon, A Diaz-Guilera, J Duch and A Arenas. Comparing Community Structure Identifications. Journal of Statistical Mechanics, 2005. P09008.
11. D Gildea, T Hofmann. Topic-Based Language Models Using EM. Proc. of the 6th European Conference on Speech Communication and Technology, pp 2167-2170, 1999.
12. R.H Lambert. Multi-channel blind deconvolution: FIR matrix algebra and separation of multipath mixtures, Ph.D. Thesis, Univ. of Southern California, 1996.
13. M.E.J Newman. Detecting community structure in networks. Euro. Phys. Journal B, 38: 321-330, 2004.
14. A.E Raftery. A Model for High-order Markov Chains. Journal of the Royal Statistical Society, series B, 47:528-539. 1985.
15. P Sarkar and A Moore. Dynamic Social Network Analysis using Latent Space Models. Proc. Neural Information Processing Systems, 2005.
16. L.K Saul and M.I Jordan. Mixed Memory Markov Models: Decomposing Complex Stochastic Processes as Mixtures of Simpler Ones. Machine Learning, 37(1):75-87, 1999.
17. L. Saul and F. Pereira. Aggregate and Mixed-Order Markov Models for Statistical Language Processing. Proc. of the Second Conference on Empirical Methods in Natural Language Processing, pp. 81-89, 1997.
18. J.V. Stone: Blind deconvolution using temporal predictability. Neurocomputing 49(1-4): 79-86 (2002)
19. L.R Rabiner. A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition. Proc. of the IEEE, 77(2): 257-286, 1989.
20. B. Ripley. Pattern Recognition in Neural Networks. Cambridge Univ. Press, 1996.
21. K Rose. E. Gurewitz and G.C Fox. Statistical Mechanics and Phase Transitions in Clustering. Phys. Rev. Letters, vol. 65, no. 8, pp.945-948.