OBJECT ORIENTED APPROACH TO PREFIX BASED FAST MINING OF CLOSED SEQUENTIAL PATTERNS

被引:0
作者
Kumar, L. Prasanna [1 ]
Kumar, S. Praveen [2 ]
Giri, D. Ratna [3 ]
Jayavani, V [4 ]
机构
[1] DIET Coll, Dept IT, Visakhapatnam, AP, India
[2] Gitam Univ, GIT, Dept IT, Visakhapatnam, AP, India
[3] SRKR Engn Coll, Dept IT, West Godavari, Andhra Pradesh, India
[4] Dr LB Coll Engn Women, Vishakapatnam, Andhra Pradesh, India
来源
2012 THIRD INTERNATIONAL CONFERENCE ON COMPUTING COMMUNICATION & NETWORKING TECHNOLOGIES (ICCCNT) | 2012年
关键词
Sequential Patterns; Data Mining; Worldwide web;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In recent years, mining of sequential patterns has been studied extensively in various domains. Most of the existing algorithms find patterns in transactional databases. This paper proposes a novel algorithm to mine closed sequential patterns using an inverted matrix and prefix based sequence element matrix. Inverted matrix minimizes the search space for discovering various sequential patterns of different items. We use a prefix based sequence element matrix to minimize the scans required at levels k and k+1 in the mining process. Our experimental results show the performance improvement of the new algorithm over the various algorithms.
引用
收藏
页数:6
相关论文
共 10 条
[1]   A tree projection algorithm for generation of frequent item sets [J].
Agarwal, RC ;
Aggarwal, CC ;
Prasad, VVV .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2001, 61 (03) :350-371
[2]  
AGRAWAL R, 1995, PROC INT CONF DATA, P3, DOI 10.1109/ICDE.1995.380415
[3]  
[Anonymous], DATA MINING KNOWLEDG
[4]  
[Anonymous], 2011, Pei. data mining concepts and techniques
[5]  
El-Hajj Mohammad, 2003, SIGKDD 03 AUG 24 27
[6]  
Lin Nancy P, 2008, WSEAS T COMPUTERS, V7
[7]  
Naidu M M, 2007, J CSI, V37, P30
[8]  
Pei Jian, PREFIXSPAN MINING SE
[9]  
Sivaselvan B., 2006, Information Technology Journal, V5, P1043
[10]  
Tzvetkov Petre, 2004, TSP MINING TOP K CLO