An Algorithm for Mining Weighted Negative Sequence Pattern

Article Preview

Abstract:

. For the purpose of showing the importance of certain items in the negative sequences and make negative sequences have more practicality, this paper presents a method for mining weighted negative sequence pattern. Set the weight value to calculate the weighted support and prune the weighted negative sequences which don’t meet conditions. We use IRIS data set which belongs to UCI data sets to verify the new algorithm. Comparing with Neg-GSP algorithm, showing the benefit of the weighted concept.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1717-1720

Citation:

Online since:

September 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Agrawal, R., Srikant, R.: Mining Sequential Pat-terns. In: Yu, P.S., Chen, A.L.P. (eds. ): 11th Inter-national Conference on Data Engineering. IEEE, Computer Soc Press, Taipei, Taiwan (1995) 3-14.

Google Scholar

[2] R. Srikant and R. Agrawal. Mining sequential patterns: Generalizations and performance improvements. In EDBT '96: Proc. of the 5th International Conference on Extending Database Technology, London, UK, 1996. Springer-Verlag , p.3–17.

DOI: 10.1007/bfb0014140

Google Scholar

[3] J. Han, J. Pei, B. Mortazavi-Asl, Q. Chen, U. Dayal, and M. -C. Hsu. Freespan: frequent pattern-projected sequential pattern mining. In KDD '00: Proc. Of the 6th ACM SIGKDD international conference on Knowledge discovery and data mining, New York, NY, USA, 2000. ACM, p.355.

DOI: 10.1145/347090.347167

Google Scholar

[4] J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M. -C. Hsu. Prefixspan: Mining sequential patterns efficiently by prefix-projected pattern growth. In ICDE '01: Proc. of the 17th International Conference on Data Engineering, Washington, DC, USA, 2001. IEEE Computer Society, p.215.

DOI: 10.1109/icde.2001.914830

Google Scholar

[5] M. J. Zaki. Spade: An efficient algorithm for mining frequent sequences. Machine Learning, 42(1-2), 2001, p.31–60.

Google Scholar

[6] J. Ayres, J. Flannick, J. Gehrke, and T. Yiu. Sequential pattern mining using a bitmap representation. In KDD'02: Proc. of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA, 2002. ACM, p.429–435.

DOI: 10.1145/775047.775109

Google Scholar

[7] Weijie Wei, Mingwei Zhang. The algorithm for mining weighted sequential pattern based on the minimum weighted support[J]. Journal of Jilin University (Engineering and Technology Edition), 2008, 38( 2) : 178~ 183.

Google Scholar

[8] Linglei Sun, Yun Li, Jiang Yin, Ling Chen, An improved algorithm for mining weighted negative sequence pattern[J]. Computer and Digital Engineering, 2010, 38(11): 4~9.

Google Scholar

[9] S.C. Hsueh M.Y. Lin C.L. Chen. Mining Negative Sequential Patterns for E-commerce Recommendations [A]. 2008 IEEE Asia-Pacific Services Computing Conference[C]. Yilan, Taiwan: IEEE Computer Society, 2008. 1213-1218.

DOI: 10.1109/apscc.2008.183

Google Scholar

[10] Z. Zheng,Y. Zhao,Z. Zuo,L. Cao: Negative-GSP: An Efficient Method for Mining Negative Sequential Patterns [A]. The 8th Australian Data Mining Conferenc[C]. Melbourne, Australian: Data Mining and Analytics, 2009. 63-67.

DOI: 10.1007/978-3-642-13657-3_30

Google Scholar