CFP last date
20 June 2024
Call for Paper
July Edition
IJCA solicits high quality original research papers for the upcoming July edition of the journal. The last date of research paper submission is 20 June 2024

Submit your paper
Know more
Reseach Article

Efficient Mining of High Utility Sequential Pattern from Incremental Sequential Dataset

by Uma Dave, Jayna Shah
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 122 - Number 12
Year of Publication: 2015
Authors: Uma Dave, Jayna Shah
10.5120/21752-5031

Uma Dave, Jayna Shah . Efficient Mining of High Utility Sequential Pattern from Incremental Sequential Dataset. International Journal of Computer Applications. 122, 12 ( July 2015), 22-28. DOI=10.5120/21752-5031

@article{ 10.5120/21752-5031,
author = { Uma Dave, Jayna Shah },
title = { Efficient Mining of High Utility Sequential Pattern from Incremental Sequential Dataset },
journal = { International Journal of Computer Applications },
issue_date = { July 2015 },
volume = { 122 },
number = { 12 },
month = { July },
year = { 2015 },
issn = { 0975-8887 },
pages = { 22-28 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume122/number12/21752-5031/ },
doi = { 10.5120/21752-5031 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:10:22.430608+05:30
%A Uma Dave
%A Jayna Shah
%T Efficient Mining of High Utility Sequential Pattern from Incremental Sequential Dataset
%J International Journal of Computer Applications
%@ 0975-8887
%V 122
%N 12
%P 22-28
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Frequent Pattern mining is modified by Sequential Pattern Mining to consider time regularity which is further enhanced to high utility sequential pattern mining (HUS) by incorporating utility into sequential pattern mining for business value and impact. In the process of mining HUS, when new sequences are added into the existing database the whole procedure of mining HUS starts from the scratch, in spite of mining HUS only from incremental sequences. This results in excess of time as well as efforts. So in this paper an incremental algorithm is proposed to mine HUS from the Incremental Database. Experimental results show that the proposed algorithm executes faster than existing PHUS algorithm resulting in saving of time as well as efforts.

References
  1. J. Pei, J. Han, B. Mortazavi-As1, H. Pinto, Q. Chen , U. Dayal, M. Hsu ,"Prefixspan,: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth", In Natural Sciences and Engineering Research Council of Canada (grant NSERC-A3723), the Net works of Centres of Excellence of Canada (grant NCWIRIS-3). and the Hewlett-Packard Lab, U. S. A. , pp. 215-220. IEEE,2001.
  2. C. Lina,T. Hong, W. Lua, "An effective tree structure for mining high utility itemsets" Expert Systems with Applications,vol. 38(6),PP. 7419-7424. ELSEVIER,2010.
  3. T. P. Hong, C. H. Lee, and S. L. Wang,"Mining high average-utility itemsets," In Systems, Man and Cybernetics, 2009. SMC 2009. IEEE International Conference on, pp. 2526-2530. IEEE, 2009.
  4. S. Shankar, T. Purusothaman, S. Jayanthi, and N. Babu , "A Fast Algorithm for Mining High Utility Itemsets," In Advance Computing Conference, 2009. IACC 2009. IEEE International, pp. 1459-1464. IEEE, 2009.
  5. C. Lin, T. Hong , G. Lan, H. Chen, H. Kao "Incrementally Mining High Utility Itemsets in Dynamic Database", In IEEE International Conference on Granular Computing PP. 303-307. IEEE 2010
  6. J. Yin, Z. Zheng, and L. Cao, "USpan: An efficient algorithm for mining high utility sequential patterns, "In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 660-668. ACM, 2012.
  7. G. Lan , T. Hong , V. Tseng , S. Wang , "An Improved Approach for Sequential Utility Pattern Mining" , In 2012 IEEE International Conference on Granular Computing PP. 226-230. IEEE,2012.
  8. G. Lan ,T. Hong , V. Tseng , S. Wang , "Applying maximum utility measure in high utility Sequential Pattern", Expert Systems with Applications,vol. 41 pp. 5071-5081. ELSEVIER, 2014.
  9. D. Parmar , Y. Rathod , M. Patel , "Survey on High Utility oriented Sequential Pattern Mining ", IEEE International Conference on computational Intelligence and and computing Research ,IEEE, 2013.
  10. S. Londhe1, R. Mahajan2, B. Bhoyar3 , "Overview on Methods for Mining High Utility Itemset from Transactional Database "International Journal of Scientific Engineering and Research (IJSER) , Volume 1 Issue 4, pp. -15-19, IJSER , 2013.
  11. S. Bhattacharya1, D. Dubey2, "High Utility Itemset Mining" , In International Journal of Emerging Technology and Advanced Engineering , Volume 2, Issue 8, pp. 476-481. IJETAE ,2012
  12. Vinutha C, Yogish H. K , "Survey On: Mining High Utility Itemsets from Transactional Database ", In IOSR Journal of Computer Engineering (IOSR-JCE), Volume 16, Issue 2, pp. -91-93, IOSR , 2014.
  13. C. Chand, A. Thakkar, A. Ganatra, ""Sequential Pattern Mining: Survey and Current Research Challenges", International Journal of Soft Computing and Engineering (IJSCE) , Volume-2, Issue-1. pp-185-193, IJSCE, 2012.
  14. Mabroukeh. n. r and Ezeife. c. i, 2010 "A Taxonomy of Sequential Pattern Mining Algorithms, "ACM Computing Surveys, Vol. 43, No. 1, Article 3,pp. 3-1 to 3-43, ACM.
  15. S. Vijayarani , S. Deepa, "Sequential Pattern Mining – A Study", International Conference on Research Trends in Computer Technologies (ICRTCT ),Proceedings published in International Journal of Computer Applications® (IJCA) pp. 14-18. ICRTCT-2013.
  16. C. Mooney , J. Roddick "Sequential Pattern Mining – Approaches and Algorithms " Vol. V, No. N, M 20YY, ACM , pp. 1–46.
  17. J. Pillai , O. P. Vyas, "Overview of Itemset Utility Mining and its Applications " International Journal of Computer Applications Volume 5– No. 11, pp. 9-13. IJCA -2010.
Index Terms

Computer Science
Information Sciences

Keywords

QSD su suub asu hus