XTRACT: Learning Document Type Descriptors from XML Document Collections

Data Mining and Knowledge Discovery

Volumn 7, Issue 1, 2003, Pages 23-56

  Garofalakis, Minos ^a   Gionis, Aristides ^b   Rastogi, Rajeev ^a   Seshadri, S ^c   Shim, Kyuseok ^d  

^a LUCENT TECHNOLOGIES   (United States)

^b Stanford University   (United States)

^c Strand Genomics ^*  (India)

^d Seoul National University   (South Korea)

Author keywords

Document Type Descriptor (DTD); Extensible Markup Language (XML); MDL principle; Regular expressions

Indexed keywords

DATA TRANSFER; DATABASE SYSTEMS; ELECTRONIC DATA INTERCHANGE; SEMANTICS; WORLD WIDE WEB;

DOCUMENT TYPE DESCRIPTORS (DTD); MINIMUM DESCRIPTION LENGTH (MDL);

XML;

EID: 0037240906     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021560618289     Document Type: Article

References (28)

1. Ahonen, H. 1996. Generating grammars for structured documents using grammatical inference methods. Ph.D. Thesis, University of Helsinki.
2. Ahonen, H., Mannila, H., and Nikunen, E. 1994. Forming grammars for structured documents: An application of grammatical inference. In Proceedings of the 2nd Intl. Colloquium on Grammatical Inference and Applications, pp. 153-167.
3. Angluin, D. 1978. On the complexity of minimum inference of regular sets. Information and Control, 39(3):337-350.
4. Brayton, R.K. and McMullen, C. 1982. The decomposition and factorization of boolean expressions. In International Symposium on Circuits and Systems, pp. 49-54.
5. Bray, T., Paoli, J., and Sperberg-McQueen, C.M. Extensible markup language (XML). Available at http://vrow.w3.org/TR/REC-xml.
6. Brazma, A. 1993. Efficient identification of regular expressions from representative examples. COLT, 236-242.
7. Charikar, M. and Guha, S. 1999. Improved combinatorial algorithms for the facility location and k-median problems. In 40th Annual Symposium on Foundations of Computer Science.
8. Deutsch, A., Fernandez, M., and Suciu, D. 1999. Storing semistructured data with stored. In Proc. of the ACM SIGMOD Conference on Management of Data.
9. Fernandez, M. and Suciu, D. 1997. Optimizing regular path expressions using graph schemas. In Proceedings of the International Conference on Database Theory (ICDT).
10. Goldman, R., McHugh, J., and Widom, J. 1999. From semistructured data to XML: Migrating the lore data model and query language. In Proceedings of the 2nd International Workshop on the Web and Databases (WebDB '99), pp. 25-30.
11. Gold, E.M. 1967. Language identification in the limit. Information and Control, 10(5):447-474.
12. Gold, E.M. 1978. Complexity of automaton identification from given data. Information and Control, 37(3):302-320.
13. Goldman, R. and Widom, J. 1997. Dataguides: Enabling query formulation and optimization in semistructured databases. In Proceedings of the 23rd International Conference on Very Large Data Bases, Athens, Greece.
14. Hochbaum, D.S. 1982. Heuristics for the fixed cost median problem.Mthematical Programming, 22:148-162.
15. Hopcroft, J.E. and Ullman, J.D. 1979. Introduction to Automaton Theory, Languages, and Computation. Addison-Wesley, Reading, MA.
16. Kilpeläinen, P., Mannila, H., and Ukkonen, E. 1995. MDL learning of unions of simple pattern languages from positive examples. In Second European Conference on Computational Learning Theory, EuroCOLT, pp. 252-260, Barcelona.
17. Lawler, E. 1964. An approach to multilevel boolean minimization. Journal of the ACM, 11(3):283-295.
18. Mehta, M., Rissanen, J., and Agrawal, R. 1995. MDL-based decision tree pruning. In Int'l Conference on Knowledge Discovery in Databases and Data Mining (KDD-95), Montreal, Canada.
19. Nestorov, S., Abiteboul, S., and Motwani, R. 1998. Extracting schema from semistructured data. In Proceedings of the ACM SIGMOD Conference on Management of Data, pp. 295-306.
20. Pitt, L. 1989. Inductive inference, DFAs, and computational complexity. Analogical and Inductive Inference. In Proceedings of the 1989 Intl. Workshop on Analogical and Inductive Inference, Reinhardsbrunn Castle, GDR, pp. 18-44.
21. Quinlan, J.R. and Rivest, R.L. 1989. Inferring decision trees using the minimum description length principle. Information and Computation, 80:227-248.
22. Rissanen, J. 1978. Modeling by shortest data description. Automatica, 14:465-471.
23. Rissanen, J. 1989. Stochastic Complexity in Statistical Inquiry. World Scientific Publ. Co: Singapore.
24. Shafer, K.E. 1995. Creating dtds via the gb-engine and fred. In Proceedings of the SGML'95 Conference, Boston, MA. Available at http://www.oclc.org/fred/docs/sgml95.html.
25. Shanmugasundaram, J., He, G., Tufte, K., Zhang, C., DeWitt, D., and Naughton, J. 1999. Relational databases for querying XML documents: Limitations and opportunities. In Proc. of the Int'l Conf. on Very Large Data Bases, Edinburgh, Scotland.
26. Wang, A.R.R. 1989. Algorithms for multi-level logic optimization. Ph.D. Thesis, The University of California, Berkeley.
27. Widom, J. 1999. Data management for XML: Research directions. IEEE Data Engineering Bulletin, 22(3): 44-52.
28. Young-Lai, M. and Tompa, F.W.M. 2000. Stochastic grammatical inference of text database structure. Machine Learning, 40(2): 111-137.