{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:13:41Z","timestamp":1725484421957},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442394"},{"type":"electronic","value":"9783540457909"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45790-9_10","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T02:46:02Z","timestamp":1179283562000},"page":"120-133","source":"Crossref","is-referenced-by-count":4,"title":["Generalized Stochastic Tree Automata for Multi-relational Data Mining"],"prefix":"10.1007","author":[{"given":"Amaury","family":"Habrard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Bernard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Jacquenet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,5]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1023\/A:1007477814995","volume":"29","author":"N. Abe","year":"1997","unstructured":"N. Abe and H. Mamitsuka. Predicting protein secondary structure using stochastic tree grammars. Machine Learning, 29:275\u2013301, 1997.","journal-title":"Machine Learning"},{"key":"10_CR2","unstructured":"R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In J. B. Bocca, M.s Jarke, and C. Zaniolo, editors, Proc. 20th Int. Conf. Very Large Data Bases, VLDB, pages 487\u2013499. Morgan Kaufmann, 12\u201315 1994."},{"issue":"3\u20134","key":"10_CR3","first-page":"375","volume":"14","author":"M. Bernard","year":"2000","unstructured":"M. Bernard and C. de la Higuera. Apprentissage de programmes logiques par Inf\u00e9rence Grammaticale. Revue d\u2019Intelligence Artificielle, 14(3\u20134):375\u2013396, 2000. Hermes Sciences.","journal-title":"Revue d\u2019Intelligence Artificielle"},{"key":"10_CR4","unstructured":"C.L. Blake and C.J. Merz. University of California Irvine repository of machine learning databases. http:\/\/www.ics.uci.edu\/~mlearn\/ , 1998."},{"issue":"6","key":"10_CR5","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0020-0190(98)00172-0","volume":"68","author":"J. Calera-Rubio","year":"1998","unstructured":"J. Calera-Rubio and R. C. Carrasco. Computing the relative entropy between regular tree languages. Information Processing Letters, 68(6):283\u2013289, 1998.","journal-title":"Information Processing Letters"},{"issue":"1\/2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1023\/A:1010836331703","volume":"44","author":"R. C. Carrasco","year":"2001","unstructured":"R. C. Carrasco, J. Oncina, and J. Calera. Stochastic Inference of Regular Tree Languages. Machine Learning, 44(1\/2):185\u2013197, 2001.","journal-title":"Machine Learning"},{"issue":"4","key":"10_CR7","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1145\/6490.214099","volume":"33","author":"R. Chaudhuri","year":"1986","unstructured":"R. Chaudhuri and A. N. V. Rao. Approximating grammar probabilities: Solution of a conjecture. Journal of the Association for Computing Machinery, 33(4):702\u2013705, 1986.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10_CR8","unstructured":"H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. Available on: http:\/\/www.grappa.univ-lille3.fr\/tata , 1997."},{"key":"10_CR9","first-page":"309","volume":"9","author":"G. F. Cooper","year":"1992","unstructured":"G. F. Cooper and E. Herskovits. A bayesian method for the induction of probabilistic networks from data. Machine Learning, 9:309\u2013347, 1992.","journal-title":"Machine Learning"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"V. Crestana-Jensen and N. Soparkar. Frequent itemset counting across multiple tables. In 4th Pacific-Asian conference on Knowledge Discovery and Data Mining (PAKDD 2000), pages 49\u201361, April 2000.","DOI":"10.1007\/3-540-45571-X_8"},{"key":"10_CR11","unstructured":"L. De Raedt. Data mining in multi-relational databases. In 4th European Conference on Principles and Practice of Knowledge, 2000. Invited talk."},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1009863704807","volume":"3","author":"L. Dehaspe","year":"1999","unstructured":"L. Dehaspe and H. Toivonen. Discovery of frequent DATALOG patterns. Data Mining and Knowledge Discovery, 3(1):7\u201336, 1999.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"10_CR13","unstructured":"N. Friedman, L. Getoor, D. Koller, and A. Pfeffer. Learning probabilistic relational models. In 16th International Joint Conference on Artificial Intelligence (IJCAI), pages 1300\u20131307. Morgan Kaufmann, 1999."},{"key":"10_CR14","unstructured":"P. Garcia and J. Oncina. Inference of recognizable tree sets. Research Report DSIC-II\/47\/93, Departamento de Sistemas Inform\u00e1ticos y Computaci\u00f3n, Universidad Polit\u00e9cnica de Valencia, 1993."},{"key":"10_CR15","volume-title":"Tree Automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"F. G\u00e9cseg and M. Steinby. Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest, 1984."},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"L. Getoor, N. Friedman, D. Koller, and B. Taskar. Learning probabilistic models of relational structure. In 18th International Conference on Machine Learning, pages 170\u2013177, Williamston, MA, June 2001. Morgan Kaufmann.","DOI":"10.1007\/978-3-662-04599-2_13"},{"issue":"n5","key":"10_CR17","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. M. Gold","year":"1967","unstructured":"E. M. Gold. Language identification in the limit. Information and Control, 10(n5):447\u2013474, 1967.","journal-title":"Information and Control"},{"issue":"301","key":"10_CR18","doi-asserted-by":"publisher","first-page":"13","DOI":"10.2307\/2282952","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"W. Hoeffding. Probabilities inequalities for sums or bounded random variables. Journal of the American Association, 58(301):13\u201330, 1963.","journal-title":"Journal of the American Association"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0304-3975(94)90033-7","volume":"129","author":"T. Knuutila","year":"1994","unstructured":"T. Knuutila and M. Steinby. Inference of tree languages from a finite sample: an algebraic approach. Theoretical Computer Science, 129:337\u2013367, 1994.","journal-title":"Theoretical Computer Science"},{"key":"10_CR20","unstructured":"H. Mannila, H. Toivonen, and A. I. Verkamo. Efficient algorithms for discovering association rules. In U. M. Fayyad and R. Uthurusamy, editors, AAAI Workshop on Knowledge Discovery in Databases (KDD-94), pages 181\u2013192, Seattle, Washington, 1994. AAAI Press."},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19","author":"S. Muggleton","year":"1994","unstructured":"S. Muggleton and L. De Raedt. Inductive Logic Programming: Theory and Methods. Journal of Logic Programming, 19\u201320:629\u2013679, 1994.","journal-title":"Journal of Logic Programming"},{"key":"10_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/978-3-540-45257-7_18","volume-title":"5th International Colloquium on Grammatical Inference (ICGI 2000), Lisbon (Portugal)","author":"J. R. Rico-Juan","year":"2000","unstructured":"J. R. Rico-Juan, J. Calera, and R. C. Carrasco. Probabilistic k-Testable Tree-Languages. In A. L. Oliveira, editor, 5th International Colloquium on Grammatical Inference (ICGI 2000), Lisbon (Portugal), volume 1891 of Lecture Notes in Computer Science, pages 221\u2013228, Berlin, September 2000. Springer."},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"A. Stolcke and S. Omohundro. Inducing probabilistic grammars by bayesian model merging. In 2nd International Colloquium on Grammatical Inference (ICGI\u201994), volume 862 of Lecture Notes in Artificial Intelligence, pages 106\u2013118, Alicante, Spain, 1994. Springer Verlag.","DOI":"10.1007\/3-540-58473-0_141"}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference: Algorithms and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45790-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T21:33:01Z","timestamp":1683840781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45790-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442394","9783540457909"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-45790-9_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}