R. Agrawal and R. Srikant, Fast Algorithms for Mining Association Rules in Large Databases, Proceedings of the 20th International Conference on Very Large Data Bases, VLDB'94, pp.487-499, 1994.

H. Arimura and T. Uno, An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees, Proceedings of the 15th International Conference on Inductive Logic Programming, ILP'05, pp.1-19, 2005.
DOI : 10.1007/11536314_1

L. Candillier, I. Tellier, and F. Torre, Transforming XML Trees for Efficient Classification and Clustering, Proceedings of the 4th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX'05, 2006.
DOI : 10.1109/TKDE.2004.1264824

L. Candillier, I. Tellier, F. Torre, and O. Bousquet, SSC: Statistical Subspace Clustering, Proceedings of the 4th International Conference on Machine Learning and Data Mining in Pattern Recognition, MLDM'05, pp.100-109, 2005.
DOI : 10.1007/11510888_11
URL : https://hal.archives-ouvertes.fr/inria-00536697

G. Costa, G. Manco, R. Ortale, and A. Tagarelli, A Tree-Based Approach to Clustering XML Documents by Structure, Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD'04, pp.137-148, 2004.
DOI : 10.1007/978-3-540-30116-5_15

Y. Chi, Y. Yang, Y. Xia, and R. R. Muntz, CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees, Proceedings of the 8th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD'04, 2004.
DOI : 10.1007/978-3-540-24775-3_9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.1675

L. Denoyer and P. Gallinari, Bayesian Network Model for Semi-Structured Document Classification. Information Processing and Management, Information Processing and Management: an International Journal, Special issue: Bayesian networks and information retrieval, pp.807-827, 2004.
DOI : 10.1016/j.ipm.2004.04.009
URL : https://hal.archives-ouvertes.fr/hal-01172241

L. Denoyer, G. Wisniewski, and P. Gallinari, Document structure matching for heterogeneous corpora, Workshop on XML and Information Retrieval, 2004.
URL : https://hal.archives-ouvertes.fr/hal-01357592

A. Doucet and H. Ahonen-myka, Naïve clustering of a large XML document collection, Proceedings of the 1st ERCIM Workshop of the Initiative for the Evaluation of XML Retrieval, INEX'02, pp.81-88, 2002.

S. Flesca, G. Manco, E. Masciari, L. Pontieri, and A. Pugliese, Detecting structural similarities between xml documents, Proceedings of the 5th International Workshop on the Web and Databases, p.2, 2002.

A. Inokuchi, T. Washio, and H. Motoda, An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data, Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery, pp.13-23, 1910.
DOI : 10.1007/3-540-45372-5_2

Z. Ji, W. Wei, L. Han, and Z. Sheng, X-warehouse: building query pattern-driven data, International World Wide Web Conference (Special interest tracks and posters, pp.896-897, 2005.

P. Kilpeläinen, Tree Matching Problems with Applications to Structured Text Databases, 1992.

W. Lian, D. W. Cheung, N. Mamoulis, and S. Yiu, An Efficient and Scalable Algorithm for Clustering XML Documents by Structure, IEEE Transactions and Knowledge Data Engineering, pp.82-96, 2004.

J. Liu, J. T. Wang, W. Hsu, and K. G. Herbert, XML Clustering by Principal Component Analysis, Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence, ICTAI'04, pp.658-662, 2004.

A. Nierman and H. V. Jagadish, Evaluating Structural Similarity in XML Documents, Proceedings of the 5th International Workshop on the Web and Databases, WebDB'02, 2002.

S. Nijssen and J. N. Kok, Efficient discovery of frequent unordered trees, Proceedings of the first International Workshop on Mining Graphs, Trees and Sequences, MGTS'03, 2003.

G. Plotkin, A note on inductive generalisation, Machine Intelligence, pp.153-163, 1970.

R. Quinlan, Data mining tools see5 and c5.0, 1998.

A. Termier, M. Rousset, and M. Sebag, TreeFinder: a first step towards XML data mining, 2002 IEEE International Conference on Data Mining, 2002. Proceedings., pp.450-457, 2002.
DOI : 10.1109/ICDM.2002.1183987

A. Termier, M. Rousset, and M. Sebag, DRYADE: A New Approach for Discovering Closed Frequent Trees in Heterogeneous Tree Databases, Fourth IEEE International Conference on Data Mining (ICDM'04), pp.543-546, 2004.
DOI : 10.1109/ICDM.2004.10078

T. Uno, M. Kiyomiet, and H. Arimura, LCM v2.0: Efficient mining algorithms for frequent/closed/maximal itemsets, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, FIMI'04, 2004.

A. Vercoustre, M. Fegas, S. Gul, and Y. Lechevallier, A flexible structuredbased representation for XML document mining, Proceedings of the 4th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX'05, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00000839

J. Yi and N. Sundaresan, A classifier for semi-structured documents, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '00, pp.340-344, 2000.
DOI : 10.1145/347090.347164

J. P. Yoon, V. Raghavan, V. Chakilam, and L. Kerschberg, BitCube: a three-dimensional bitmap indexing for XML documents, Proceedings Thirteenth International Conference on Scientific and Statistical Database Management. SSDBM 2001, pp.241-254, 2001.
DOI : 10.1109/SSDM.2001.938548

M. J. Zaki and C. Aggarwal, XRules, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.316-325, 2003.
DOI : 10.1145/956750.956787

K. Zang and D. Shasha, Simple Fast Algorithms for the Editing Distance between Trees and Related Problems, SIAM Journal on Computing, vol.18, issue.6, pp.1245-1262, 1989.
DOI : 10.1137/0218082