[1] 朱扬勇, 熊 赟. DNA序列数据挖掘技术[J]. 软件学报, 2007, 18(11): 2766-2781. [2] Agrawal R, Srikant R. Mining Sequential Patterns[C]//Proc. of ICDE’95. [S. l.]: IEEE Computer Society, 1995. [3] Agrawal R, Srikant R. Mining Quantitative Association Rules in Large Relational Tables[C]//Proc. of the ACM SIGMOD Conference Management of Data. Montreal, Canada: [s. n.], 1996. [4] Agrawal R, Srikant R. Mining Sequential Patterns: Generalizations and Performance Improvements[C]//Proc. of EDBT’96. Avignon, France: [s. n.], 1996. [5] Zaki M J. SPADE: An Efficient Algorithm for Mining Frequent Sequences[J]. Machine Learning, 2001, 42(1): 31-60. [6] Han Jiawei, Pei Jian, Mortazavi-Asl B. FreeSpan: Frequent Pa- ttern-projected Sequential Pattern Mining[C]//Proc. of KDD’00. Boston, USA: [s. n.], 2000. [7] Pei Jian, Han Jiawei, Mortazavi-Asl B, et al. Mining Sequential Patterns by Patten-growth: The Prefix Span Approach[J]. IEEE Trans. on Knowledge and Data Engineering, 2004, 16(11): 1424-1440. [8] Ayres J, Gehrkeetal J. Sequential Pattern Mining Using a Bitmap Representation[C]//Proc. of the 8th ACM SIGKDD International Conf. on Knowledge Discovery and Data Mining. Edmonton, Alberta, Canada: [s. n.], 2002. [9] Afshar R. Mining Frequent Max and Closed Sequential Pa- tterns[D]. Burnaby, Canada: School of Computing Science, Simon Fraser University, 2002. [10] Yan Xifeng, Han Jiawei, Afshar R. CloSPan: Mining Closed Sequential Patterns in Large Datasets[C]//Proc. of SDM’03. San Fransisco, USA: [s. n.], 2003. [11] Wang Jianyong, Han Jiawei. BIDE: Efficient Mining of Frequent Closed Sequences[C]//Proc. of ICDE’04. Boston, USA: [s. n.], 2004. [12] Zhu Tian, Bai Sixue. A Parallel Mining Algorithm for Closed Sequential Patterns[C]//Proc. of AINAW’07. Niagara Falls, Canada: [s. n.], 2007. [13] Cong Shengnan, Han Jiawei, Padua D. Parallel Mining of Closed Sequential Patterns[C]//Proc. of KDD’05. [S. l.]: ACM Press, 2005. [14] Zhu Tian, Bai Sixue. A Parallel Mining Algorithm for Closed Sequential Patterns[C]//Proc. of the 21st International Conf. on Advanced Information Networking and Applications Workshops. [S. l.]: IEEE Computer Society, 2007. [15] Tatikonda S, Parthasarathy S. Mining Tree-structured Data on Multicore Systems[C]//Proc. of VLDB’09. Lyon, France: [s. n.], 2009. [16] Negrevergne B, Termier A, Me?haut J, et al. Discovering Closed Frequent Itemsets on Multicore: Parallelizing Computations and Optimizing Memory Accesses[C]//Proc. of HPCS’10, Toronto, USA: [s. n.], 2010. [17] 王 鹏, 孟 丹, 詹剑锋, 等. 数据密集型计算编程模型研究进展[J]. 计算机研究与发展, 2010, 47(11): 1993-2002.
|