Mining frequent closed unordered trees through natural representations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4604 LNAI, Issue , 2007, Pages 347-359

  Balcázar, José L ^a   Bifet, Albert ^a   Lozano, Antoni ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; DATA MINING; DECISION TREES;

COMBINATORIAL CHARACTERIZATION; UNORDERED TREES;

KNOWLEDGE REPRESENTATION;

EID: 37349032961     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73681-3_26     Document Type: Conference Paper

References (23)

1. Arimura, H., Uno, T.: An output-polyunomial time algorithm for mining frequent closed attribute trees. In: Kramer, S., Pfahringer, B. (eds.) ILP 2005. LNCS (LNAI), vol. 3625, pp. 1-19. Springer, Heidelberg (2005)
2. Asai, T., Abe, K., Kawasoe, S., Arimura, H., Sakamoto, H., Arikawa, S.: Efficient substructure discovery from large semi-structured data. In: SDM (2002)
3. Asai, T., Arimura, H., Uno, T., Nakano, S.-I.: Discovering frequent substructures in large unordered trees. Discovery Science, 47-61 (2003)
4. Baixeries, J., Balcázar, J.L.: Discrete deterministic data mining as knowledge compilation. In: Workshop on Discrete Math. and Data Mining at SIAM DM Conference (2003)
5. Balcázar, J.L., Bifet, A., Lozano, A.: Intersection algorithms and a closure operator on unordered trees. In: MLG 2006, 4th International Workshop on Mining and Learning with Graphs (2006)
6. Balcázar, J.L., Bifet, A., Lozano, A.: Mining frequent closed rooted trees, 2007 (submitted)
7. Balcázar, J.L., Garriga, G.C.: On Horn axiomatizations for sequential data. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, pp. 215-229. Springer, Heidelberg (2004)
8. Chi, Y., Yang, Y., Muntz, R.R.: HybridTreeMiner: An efficient algorithm for mining frequent rooted trees and free trees using canonical forms. In: Chi, Y., Yang, Y., Muntz, R.R. (eds.) SSDBM '04: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM'04), Washington, DC, USA, 2004, p. 11. IEEE Computer Society Press, Los Alamitos (2004)
9. Chi, Y., Muntz, R., Nijssen, S., Kok, J.: Frequent subtree mining - an overview. Fundamenta Informaticae XXI, 1001-1038 (2001)
10. Chi, Y., Xia, Y., Yang, Y., Muntz, R.: Mining closed and maximal frequent subtrees from databases of labeled rooted trees. Fundamenta Informaticae XXI, 1001-1038 (2001)
11. Chi, Y., Yang, Y., Muntz, R.R.: Indexing and mining free trees. In: ICDM '03: Proceedings of the Third IEEE International Conference on Data Mining, Washington, DC, USA, 2003, p. 509. IEEE Computer Society, Los Alamitos (2003)
12. Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Heidelberg (1999)
13. Garriga, G.C.: Formal methods for mining structured objects. PhD Thesis (2006)
14. Kohavi, R., Brodley, C., Frasca, B., Mason, L., Zheng, Z.: KDD-Cup 2000 organizers report: Peeling the onion. SIGKDD Explorations 2(2), 86-98 (2000)
15. Nijssen, S., Kok, J.N.: Efficient discovery of frequent unordered trees. In: First International Workshop on Mining Graphs, Trees and Sequences, pp. 55-64 (2003)
16. Termier, A., Rousset, M.-C., Sebag, M.: DRYADE: a new approach for discovering closed frequent trees in heterogeneous tree databases. In: Perner, P. (ed.) ICDM 2004. LNCS (LNAI), vol. 3275, pp. 543-546. Springer, Heidelberg (2004)
17. Valiente, G.: Algorithms on Trees and Graphs. Springer, Heidelberg (2002)
18. Xiao, Y., Yao, J.-F., Li, Z., Dunham, M.H.: Efficient data mining for maximal frequent subtrees. In: ICDM '03: Proceedings of the Third IEEE International Conference on Data Mining, Washington, DC, USA, 2003, p. 379. IEEE Computer Society, Los Alamitos (2003)
19. Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: ICDM '02: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02), Washington, DC, USA, 2002, p. 721. IEEE Computer Society, Los Alamitos (2002)
20. Yan, X., Han, J.: CloseGraph: mining closed frequent graph patterns. In: KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 286-295. ACM Press, New York, NY, USA (2003)
21. Yan, X., Han, J., Afshar, R.: CloSpan: Mining closed sequential patterns in large databases. In: SDM (2003)
22. Zaki, M.J.: Efficiently mining frequent trees in a forest. In: 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2002)
23. Zaki, M.J.: Efficiently mining frequent embedded unordered trees. Fundam. Inform. 66(1-2), 33-52 (2005)