Mannila H, Meek C. Global Partial Orders from Sequential Data // Proc of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Boston, USA, 2000: 161168
Goldenberg A, Moore A. Tractable Learning of Large Bayes Net Structures from Sparse Data [EB/OL]. [20040420]. www.autonlab.org/autonweb/14644/version/61part/s/data/goldenbergtractable.pdf?branch=main&language=en
Goldenberg A Q, Moore A W. Bayes Net Graphs to Understand CoAuthorship Networks? // Proc of the 3rd International Workshop on Link Discovery. Chicago, USA, 2005: 18
Dempster A P, Laird N M, Rubin D B. Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal of the Royal Statistical Society, 1977, B(39):138
Agrawal R, Srikant R. Fast Algorithms for Mining Association Rules in Large Databases // Proc of the International Conference on Very Large Data Bases. Santiago de Chile, Chile, 1994: 487499
Han Jiawei, Pei Jian, Yin Yiwen. Mining Frequent Patterns without Candidate Generation // Proc of the ACM SIGMOD International Conference on Management of Data. Dallas, USA, 2000: 112
Srikant R, Agrawal R. Mining Sequential Patterns: Generalizations and Performance Improvements // Proc of the 5th International Conference on Extending Database Technology. Avignon, France, 1996: 317
Pei Jian, Wang Haixun, Liu Jian, et al. Discovering Frequent Closed Partial Orders from Strings. IEEE Trans on Knowledge and Data Engineering, 2006, 18(11): 14671481
CasasGarriga C. Summarizing Sequential Data with Closed Partial Orders // Proc of the SIAM International Conference on Data Mining. Newport Beach, USA, 2005: 380391
