{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:08:54Z","timestamp":1767236934216,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161070"},{"type":"electronic","value":"9783642161087"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16108-7_10","type":"book-chapter","created":{"date-parts":[[2010,8,31]],"date-time":"2010-08-31T12:58:37Z","timestamp":1283259517000},"page":"74-88","source":"Crossref","is-referenced-by-count":3,"title":["A Spectral Approach for Probabilistic Grammatical Inference on Trees"],"prefix":"10.1007","author":[{"given":"Rapha\u00ebl","family":"Bailly","sequence":"first","affiliation":[]},{"given":"Amaury","family":"Habrard","sequence":"additional","affiliation":[]},{"given":"Fran\u00e7ois","family":"Denis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1023\/A:1010836331703","volume":"44","author":"R. Carrasco","year":"2001","unstructured":"Carrasco, R., Oncina, J., Calera-Rubio, J.: Stochastic inference of regular tree languages. Machine Learning\u00a044, 185\u2013197 (2001)","journal-title":"Machine Learning"},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.3233\/FUN-2008-861-203","volume":"86","author":"F. Denis","year":"2008","unstructured":"Denis, F., Esposito, Y.: On rational stochastic languages. Fundamenta Informaticae\u00a086, 41\u201377 (2008)","journal-title":"Fundamenta Informaticae"},{"key":"10_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-540-75225-7_21","volume-title":"Algorithmic Learning Theory","author":"F. Denis","year":"2007","unstructured":"Denis, F., Habrard, A.: Learning rational stochastic tree languages. In: Hutter, M., Servedio, R.A., Takimoto, E. (eds.) ALT 2007. LNCS (LNAI), vol.\u00a04754, pp. 242\u2013256. Springer, Heidelberg (2007)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-540-88009-7_5","volume-title":"Grammatical Inference: Algorithms and Applications, 9th International Colloquium","author":"F. Denis","year":"2008","unstructured":"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\u201370. Springer, Heidelberg (2008)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"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\u00e9al, Canada, pp. 33\u201340. Omnipress (2009)","DOI":"10.1145\/1553374.1553379"},{"key":"10_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/11871842_13","volume-title":"Machine Learning: ECML 2006","author":"A. Clark","year":"2006","unstructured":"Clark, A., Costa Flor\u00eancio, C., Watkins, C.: Languages as hyperplanes: grammatical inference with string kernels. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol.\u00a04212, pp. 90\u2013101. Springer, Heidelberg (2006)"},{"key":"10_CR7","volume-title":"Proceedings of COLT 2009","author":"D. Hsu","year":"2009","unstructured":"Hsu, D., Kakade, S., Zhang, T.: A spectral algorithm for learning hidden markov models. In: Proceedings of COLT 2009, Springer, Heidelberg (2009)"},{"key":"10_CR8","unstructured":"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"},{"key":"10_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-27819-1_9","volume-title":"Learning Theory","author":"F. Denis","year":"2004","unstructured":"Denis, F., Esposito, Y.: Learning classes of probabilistic automata. In: Shawe-Taylor, J., Singer, Y. (eds.) COLT 2004. LNCS (LNAI), vol.\u00a03120, pp. 124\u2013139. Springer, Heidelberg (2004)"},{"key":"10_CR10","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., L\u00f6ding, C., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), http:\/\/tata.gforge.inria.fr\/ (release October 12, 2007)"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0304-3975(82)90019-6","volume":"18","author":"J. Berstel","year":"1982","unstructured":"Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theorical computer science\u00a018, 115\u2013148 (1982)","journal-title":"Theorical computer science"},{"issue":"1-2","key":"10_CR12","doi-asserted-by":"crossref","first-page":"103","DOI":"10.3233\/FI-2009-0068","volume":"92","author":"J. H\u00f6gberg","year":"2009","unstructured":"H\u00f6gberg, J., Maletti, A., Vogler, H.: Bisimulation minimisation of weighted automata on unranked trees. Fundam. Inform.\u00a092(1-2), 103\u2013130 (2009)","journal-title":"Fundam. Inform."},{"key":"10_CR13","unstructured":"Borchardt, B.: The Theory of Recognizable Tree Series. PhD thesis, TU Dresden (2004)"},{"key":"10_CR14","first-page":"148","volume-title":"Surveys in Combinatorics","author":"C. McDiarmid","year":"1989","unstructured":"McDiarmid, C.: On the method of bounded differences. In: Surveys in Combinatorics, pp. 148\u2013188. Cambridge University Press, Cambridge (1989)"},{"key":"10_CR15","volume-title":"Matrix Perturbation Theory","author":"G. Stewart","year":"1990","unstructured":"Stewart, G., Sun, J.G.: Matrix Perturbation Theory. Academic Press, London (1990)"},{"key":"10_CR16","unstructured":"Zwald, L., Blanchard, G.: On the convergence of eigenspaces in kernel principal component analysis. In: Proceedings of NIPS 2005 (2006)"},{"key":"10_CR17","first-page":"511","volume-title":"Proc. of NIPS","author":"J. Shawe-Taylor","year":"2001","unstructured":"Shawe-Taylor, J., Cristianini, N., Kandola, J.: On the concentration of spectral properties. In: Proc. of NIPS, vol.\u00a014, pp. 511\u2013517. MIT Press, Cambridge (2001)"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-75225-7_5","volume-title":"18th International Conference on Algorithmic Learning Theory","author":"A. Smola","year":"2007","unstructured":"Smola, A., Gretton, A., Song, L., Sch\u00f6lkopf, B.: A hilbert space embedding for distributions. In: 18th International Conference on Algorithmic Learning Theory, pp. 13\u201331. Springer, Heidelberg (2007)"},{"key":"10_CR19","unstructured":"Song, L., Boots, B., Saddiqi, S., Gordon, G., Smola, A.: Hilbert space embeddings of Hidden Markov Models. In: Proceedings of ICML 2010 (2010)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16108-7_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T08:21:30Z","timestamp":1740471690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16108-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161070","9783642161087"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16108-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}