Generalized Stochastic Tree Automata for Multi-relational Data Mining

@inproceedings{Habrard2002GeneralizedST,
  title={Generalized Stochastic Tree Automata for Multi-relational Data Mining},
  author={Amaury Habrard and Marc Bernard and François Jacquenet},
  booktitle={ICGI},
  year={2002}
}
This paper addresses the problem of learning a statistical distribution of data in a relational database. Data we want to focus on are represented with trees which are a quite natural way to represent structured information. These trees are used afterwards to infer a stochastic tree automaton, using a well-known grammatical inference algorithm. We propose two extensions of this algorithm: use of sorts and generalization of the infered automaton according to a local criterion. We show on some… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 23 references

Calera - Rubio and R . C . Carrasco . Computing the relative entropy between regular tree languages

  • J. Oncina Carrasco
  • Information Processing Letters
  • 1998

University of California Irvine repository of machine learning databases

  • C. L. Blake, C. J. Merz
  • http://www.ics.uci.edu/∼mlearn/,
  • 1998
2 Excerpts

Similar Papers

Loading similar papers…