A spectral approach for probabilistic grammatical inference on trees

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

Volumn 6331 LNAI, Issue , 2010, Pages 74-88

  Bailly, Raphaël ^a   Habrard, Amaury ^a   Denis, François ^a  

^a AIX MARSEILLE UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CLASS OF DISTRIBUTIONS; DIMENSIONAL VECTORS; GRAMMATICAL INFERENCES; PRINCIPAL COMPONENTS ANALYSIS; PROBABILISTIC TREES; TREE LANGUAGES; VECTOR SUBSPACE; WEIGHTED AUTOMATA;

ALGORITHMS; PRINCIPAL COMPONENT ANALYSIS; QUERY LANGUAGES; VECTORS;

PROBABILITY DISTRIBUTIONS;

EID: 78249286199     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16108-7_10     Document Type: Conference Paper

References (19)

1. Carrasco, R., Oncina, J., Calera-Rubio, J.: Stochastic inference of regular tree languages. Machine Learning 44, 185-197 (2001) (Pubitemid 32543252)
2. Denis, F., Esposito, Y.: On rational stochastic languages. Fundamenta Informaticae 86, 41-77 (2008)
3. Denis, F., Habrard, A.: Learning rational stochastic tree languages. In: Hutter, M., Servedio, R.A., Takimoto, E. (eds.) ALT 2007. LNCS (LNAI), vol. 4754, pp. 242-256. Springer, Heidelberg (2007)
4. Denis, F., Gilbert, E., Habrard, A., Ouardi, F., Tommasi, M.: Relevant representations for the inference of rational stochastic tree languages. In: Grammatical Inference: Algorithms and Applications, 9th International Colloquium, pp. 57-70. Springer, Heidelberg (2008)
5. Bailly, R., Denis, F., Ralaivola, L.: Grammatical inference as a principal component analysis problem. In: Proceedings of the 26th International Conference on Machine Learning, Montréal, Canada, pp. 33-40. Omnipress (2009)
6. Clark, A., Costa Florêncio, C., Watkins, C.: Languages as hyperplanes: grammatical inference with string kernels. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 90-101. Springer, Heidelberg (2006)
7. Hsu, D., Kakade, S., Zhang, T.: A spectral algorithm for learning hidden markov models. In: Proceedings of COLT 2009, Springer, Heidelberg (2009)
8. Hsu, D., Kakade, S., Zhang, T.: A spectral algorithm for learning hidden markov models. Technical report, Arxiv archive (2009), http://arxiv.org/abs/ 0811.4413
9. Denis, F., Esposito, Y.: Learning classes of probabilistic automata. In: Shawe-Taylor, J., Singer, Y. (eds.) COLT 2004. LNCS (LNAI), vol. 3120, pp. 124-139. Springer, Heidelberg (2004)
10. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Löding, C., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), http://tata.gforge.inria.fr/ (release October 12, 2007)
11. Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theorical computer science 18, 115-148 (1982)
12. Högberg, J., Maletti, A., Vogler, H.: Bisimulation minimisation of weighted automata on unranked trees. Fundam. Inform. 92(1-2), 103-130 (2009)
13. Borchardt, B.: The Theory of Recognizable Tree Series. PhD thesis, TU Dresden (2004)
14. McDiarmid, C.: On the method of bounded differences. In: Surveys in Combinatorics, pp. 148-188. Cambridge University Press, Cambridge (1989)
15. Stewart, G., Sun, J.G.: Matrix Perturbation Theory. Academic Press, London (1990)
16. Zwald, L., Blanchard, G.: On the convergence of eigenspaces in kernel principal component analysis. In: Proceedings of NIPS 2005 (2006)
17. Shawe-Taylor, J., Cristianini, N., Kandola, J.: On the concentration of spectral properties. In: Proc. of NIPS, vol. 14, pp. 511-517. MIT Press, Cambridge (2001)
18. Smola, A., Gretton, A., Song, L., Schölkopf, B.: A hilbert space embedding for distributions. In: 18th International Conference on Algorithmic Learning Theory, pp. 13-31. Springer, Heidelberg (2007)
19. Song, L., Boots, B., Saddiqi, S., Gordon, G., Smola, A.: Hilbert space embeddings of Hidden Markov Models. In: Proceedings of ICML 2010 (2010)