| [1] Oasis. Business process execution language(bpel) v2.0. Burlington: Oasis, 2007. http://docs. oasis-open. org/wsbpel/2.0/wsbpel-v2.0.pdf.
[2] Cheng Bo, Lin Xiangtao, Hu Xiaoxiao, et al. Formal analysis for multimedia conferencing communication services orchestration//Proceedings of 2009 ICWS. NJ: IEEE, 2009: 1010-1011.
[3] Chi Yun, Yang Yirong, Richard R Muntz. HybridTreeMiner: an efficient algorithm for mining frequent rooted trees and free trees using canonical forms//Proceedings of the 16th SSDBM. Washington: IEEE Computer Society, 2004: 11-20.
[4] Zaki M J. Efficiently mining frequent trees in a forest//Proceedings of SIGKDD’02. New York: ACM, 2002: 71-80.
[5] Tatsuya A. Efficient substructure discovery from large semi-structured data[J]. IEICE Transactions on Information and Systems, 2004, E87-D(12): 2754-2763.
[6] Fedja H, Henry T, Dillon T S. UNI3-efficient algorithm for mining unordered induced subtrees using TMG candidate generation//Proceedings of CIDM 2007. NJ: IEEE Computer Society, 2007: 568-575.
[7] Tan H, Hadzic F, Dillon T S, et al. Tree model guided candidate generation for mining frequent subtrees from XML documents[J]. ACM Transactions on Knowledge Discovery, 2008, 2(2): 1-43.
[8] Deng Na, Chen Junliang, Cheng Bo, et al. A recommendation method of BPEL activity based on association rules mining//Proceedings of CiSE 2010. NJ: IEEE Computer Society, 2010: 1-4. |
