Subtree Testing and Closed Tree Mining Through Natural Representations

Several classical schemes exist to represent trees as strings over a fixed alphabet; these are useful in many algorithmic and conceptual studies. Our previous work has proposed a representation of unranked trees as strings over a countable alphabet, and has shown how this representation is useful for canonizing unordered trees and for mining closed frequent trees, whether ordered or unordered. Here we propose a similar, simpler alternative and adapt some basic algorithmics to it; then we show empirical evidence of the usefulness of this representation for mining frequent closed unordered trees on real-life data.

[1]  Yun Chi,et al.  Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees , 2005, IEEE Trans. Knowl. Data Eng..

[2]  Yan Wang,et al.  LITESET/A++: a new agent-assisted secure payment protocol , 2004, Proceedings. IEEE International Conference on e-Commerce Technology, 2004. CEC 2004..

[3]  Mehdi Jazayeri,et al.  A phase model for e-commerce business models and its application to security assessment , 2001, Proceedings of the 34th Annual Hawaii International Conference on System Sciences.

[4]  Kian-Lee Tan,et al.  PumaMart: a parallel and autonomous agents based internet marketplace , 2004, Electron. Commer. Res. Appl..

[5]  Carla E. Brodley,et al.  KDD-Cup 2000 organizers' report: peeling the onion , 2000, SKDD.

[6]  Marios D. Dikaiakos,et al.  Intermediary infrastructures for the World Wide Web , 2004, Comput. Networks.

[7]  Jose L. Muñoz,et al.  Secure brokerage mechanisms for mobile electronic commerce , 2006, Comput. Commun..

[8]  Hiroki Arimura,et al.  An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees , 2005, ILP.

[9]  Javier López,et al.  Practical Service Charge for P2P Content Distribution , 2003, ICICS.

[10]  Jiawei Han,et al.  CloseGraph: mining closed frequent graph patterns , 2003, KDD '03.

[11]  Vijay Varadharajan,et al.  A mobile autonomous agent-based secure payment protocol supporting multiple payments , 2005, IEEE/WIC/ACM International Conference on Intelligent Agent Technology.

[12]  Mohammed J. Zaki.  Efficiently mining frequent trees in a forest , 2002, KDD.

[13]  Gabriel Valiente,et al.  Algorithms on Trees and Graphs , 2002, Springer Berlin Heidelberg.

[14]  Jiawei Han,et al.  gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[15]  Javier López,et al.  Agent-mediated non-repudiation protocols , 2004, Electron. Commer. Res. Appl..

[16]  José L. Balcázar,et al.  Mining Frequent Closed Unordered Trees Through Natural Representations , 2007, ICCS.

[17]  Yun Chi,et al.  Frequent Subtree Mining - An Overview , 2004, Fundam. Informaticae.

[18]  Alexandre Termier,et al.  Dryade: a new approach for discovering closed frequent trees in heterogeneous tree databases , 2004, Fourth IEEE International Conference on Data Mining (ICDM'04).