Predictive modelling of heterogeneous sequence collections by topographic ordering of histories

Machine Learning

Volumn 68, Issue 1, 2007, Pages 63-95

  Kabán, Ata ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Data explanation; Data prediction; Generalisation across multiple sequences; Generative topographic mapping; Probabilistic modelling; Visualisation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA REDUCTION; GAUSSIAN DISTRIBUTION; NONLINEAR ANALYSIS; OPTIMIZATION; PROBABILITY;

DATA EXPLANATION; DATA PREDICTION; GENERALISATION ACROSS MULTIPLE SEQUENCES; GENERATIVE TOPOGRAPHIC MAPPING; PROBABILISTIC MODELLING;

CODES (SYMBOLS);

EID: 34249684237     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-007-5008-8     Document Type: Article

References (32)

1. Attias, H. (2001). Learning in high dimensions: Modular mixture models. In Proceedings of the 8th International Conference on Artificial Intelligence and Statistics (pp. 144-148).
2. Bengio, Y., Paiement, J.-F., & Vincent, P. (2004). Neural information processing systems (NIPS): Vol. 16. Out-of-sample extensions for LLE, isomap, MDS, eigenmaps, and spectral clustering. Cambridge: MIT Press.
3. Bernardo, J. M., & Smith, A. F. M. (2001). Bayesian theory. Cambridge: Wiley.
4. Bishop, C. M. (1995). Neural networks for pattern recognition, Oxford: Oxford University Press. Chap. 7
5. Bishop, C. M., Svensen, M., & & Williams, C. K. I. (1998a). The generative topographic mapping. Neural Computation, 70(1), 215-234.
6. Bishop, C. M., Svensen, M., & Williams, C. K. I. (1998b). Developments of the generative topographic mapping. Neurocomputing, 21, 203-224.
7. Blei, D. M., Ng, A. Y., & Jordan, M. I. (2003). Latent Dirichlet allocation. Journal of Machine Learning Research, 3(5), 993-1022.
8. Buntine, W. (2002). Variational extensions to EM and multinomial PCA. In Proc. of the 13-th European Conference on Machine Learning (ECML).
9. Cadez, I., Heckerman, D., Meek, C., Smyth, P., & White, S. (2003). Model-based clustering and visualisation of navigation patterns on a web site. Data Mining and Knowledge Discovery, 7(4), 499-242.
10. Carreira-Perpiñáa, M. Á., & Renals S. (1998). Experimental evaluation of latent variable models for dimensionality reduction. In Proc. IEEE Signal Processing Society Workshop on Neural Networks for Signal Processing (NNSP'98) (pp. 165-173).
11. Celeux, G., Chrétien, S., Forbes, F., & Mkhadri, A. (2001). A component-wise EM algorithm for mixtures. Journal of Computational & Graphical Statistics, 10(4), 697-712(16).
12. Cover, T., & Thomas, J. (1991). Elements of information theory. New York: Wiley.
13. Girolami, M., & Kabán, A. (2005). Sequential activity profiling: Latent Dirichlet allocation of Markov chains. Data Mining and Knowledge Discovery, 10, 175-196.
14. Hastie, T., Tibshirani, R., & Friedman, J. (2001). The elements of statistical learning. New York: Springer.
15. Hofmann, T. (2000). Probmap - A probabilistic approach for mapping large document collections. Journal for Intelligent Data Analysis, 4, 149-164.
16. Hofmann, T., & Buhmann, J. (1998). Competitive learning algorithms for robust vector quantization. IEEE Transactions on Signal Processing, 46(6), 1665-1675.
17. Hollmén, J., Tresp, V., & Simula, O. (1999). A self-organizing map algorithm for clustering probabilistic models. In Proc. of the 9-th International Conference on Artificial Neural Networks (ICANN):, Vol. 2 (pp. 946-951).
18. Iwata, T., Saito, K., Ueda, N., Stromsten, S., Griffiths, T. L., & Tennenbaum, J. B. (2005). Neural information processing systems (NIPS): Vol. 17. Parametric embedding for class visualisation. Cambridge: MIT Press.
19. Kabán, A. (2005). A scalable generative topographic mapping for sparse data sequences. In Proc. IEEE International Conference on Information Technology: Coding and Computing (ITCC) (pp. 51-56).
20. Kabán, A., & Girolami, M. (2001). A combined latent class and trait model for the analysis and visualisation of discrete data. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(8), 859-872.
21. Kaski, S., Kangas, J., & Kohonen, T. (1998). Bibliography of self-organizing map (SOM) papers: 1981-1997. In Neural computing surveys: Vol. 1 (pp. 102-350).
22. Keller, M., & Bengio, S. (2004). TTMM: a graphical model for document representation. In PASCAL Workshop on Text Mining and Understanding, Grenoble, France
23. Kelley, T. C. (1995). Iterative methods for optimization. Frontiers in Applied Mathematics, Philadelphia: SIAM.
24. Kohonen, T. (1999). Self-organising maps. Berlin: Springer.
25. McLachlan, G., & Krishnan, T. ( 1997). The EM algorithm and extensions. New York: Wiley.
26. Peterson, C., & Söderberg, B. (1989). A new method for mapping optimization problems onto neural networks. International Journal of Neural Systems, 1(1), 3-22.
27. Ramakrishnan, N., & Grama, A. (2001). Mining scientific data. Advances in Computers, 55, 119-169.
28. Roweis, S., Saul, L. K., & Hinton, G. (2002). Neural informationp wcessing systems (NIPS): Vol. 14. Global coordination of local linear models (pp. 889-896). Cambridge: MIT Press.
29. Salakhutdinov, R., Roweis, S., & Ghahramani, Z. (2003). Optimization with EM and expectation-conjugate-gradient. In Proc. of the 20-th International Conference on Machine Learning (ICML) (pp. 672-679).
30. Sarukkai, R. (2000). Link prediction and path analysis using Markov chains. Computer Networks, 33(1-6), 377-386.
31. Tiño, P., Kabán, A., & Sun, Y. (2004). A generative probabilistic approach to visualising sets of symbolic sequences. In Proc. of the 10-th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) (pp. 701-706). New York: ACM.
32. Wu, J. M., & Chiu, S. J. (2001). Independent component analysis using Potts models. IEEE Transactions on Neural Networks, 12(2), 202-211.