9th International Science Congress (ISC-2019).  International E-publication: Publish Projects, Dissertation, Theses, Books, Souvenir, Conference Proceeding with ISBN.  International E-Bulletin: Information/News regarding: Academics and Research

Approach to Recover CSGM Method with Higher Accuracy and Less Memory Consumption using Web Log Mining

Author Affiliations

  • 1IES IPS Academy, Indore, MP, INDIA
  • 2IES IPS Academy, Indore, MP, INDIA

Res. J. Engineering Sci., Volume 1, Issue (1), Pages 83-87, July,26 (2012)

Abstract

Sequential pattern mining is an important mining technique which discovers closed frequent sub sequence from a sequence database. However it is very difficult as it generates explosive number of sub sequence in candidate generator and test approach. Previous sequential pattern mining algorithm closed sequence-sequence generator mining (CSGM) mine full set of frequent sub sequence satisfying a min_sup and max_sup threshold in sequence database. This algorithm is not suitable for datasets that are too dense or too sparse, which is prohibitively expensive in both time and space. In this paper we analyze the existing methods of sequential pattern mining and after analysis we propose an enhance algorithm for sequential pattern mining. Thus the main purpose this method is aiming to solve is to develop new techniques based on the closure concept for effectively and efficiently discovering non-redundant sequential association rules from sequential datasets with higher accuracy, less memory and time consumption. After performance analysis we use modified algorithm for mining useful data from web log.

References

  1. Agrawal R. and Srikant R.,, Mining sequentialpatterns,, Proceedings of the Eleventh International Conference on Data Engineering (1995)
  2. Yan X., Han J. and Afshar R.,, CloSpan: Mining Closed Sequential Patterns in Large Datasets, (2003)
  3. Pei J., Han J., Mortazavi-Asl B., Pinto H., Chen Q., Dayal U. et al.,, PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth, (2001)
  4. Han J., Pei J. and Yin Y.,, Mining frequent patterns without candidate, (2000)
  5. Hao Zang and Yue Xu Yuefeng Li,, Non-Redundant Sequential Association Rule Mining and Application in Recommender Systems, Proceedings of IEEE International Conference on Data Mining (2010)
  6. Jon Starkweather may,, Cross validation technique, (2010)
  7. Han J., Pei J., Mortazavi-Asl B., Chen Q., Dayal U. and Hsu M.C.,, Free Span: frequent pattern-projected sequential pattern mining, (2000)
  8. Tzvetkov P., Yan X. and Han J.,, TSP: Mining top-k closed sequential patterns,, Knowledge and Information Systems, 7(4), 438-457 (2005)
  9. Xu Y. and Li Y.,, Generating concise association rules, (2007)
  10. Li J., Li H., Wong L., Pei J. and Dong G.,, Minimum description length principle: generators are preferable to closed patterns, (2006)
  11. Gaul W. and Schmidt-Thieme L.,, Mining Generalized Association Rules for Sequential and Path Data., Proceedings of the 2001 IEEE International Conference on Data Mining (2001)
  12. Xu Y. and Li Y.,, Concise representations for approximate association rules, (2008)