Graph based Approach and Clustering of Patterns (GACP) for Sequential Pattern Mining
Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 4
Abstract
The sequential pattern mining generates the sequential patterns. It can be used as the input of another program for retrieving the information from the large collection of data. It requires a large amount of memory as well as numerous I/O operations. Multistage operations reduce the efficiency of the algorithm. The given GACP is based on graph representation and avoids recursively reconstructing intermediate trees during the mining process. The algorithm also eliminates the need of repeatedly scanning the database. A graph used in GACP is a data structure accessed starting at its first node called root and each node of a graph is either a leaf or an interior node. An interior node has one or more child nodes, thus from the root to any node in the graph defines a sequence. After construction of the graph the pruning technique called clustering is used to retrieve the records from the graph. The algorithm can be used to mine the database using compact memory based data structures and cleaver pruning methods.
Authors and Affiliations
Ashish Patel , Amisha Patel
Keywords
Related Articles
- EP ID EP113608
- DOI -
- Views 98
- Downloads 0
Trust Based Security Routing in Mobile Adhoc Networks
Abstract: Ad hoc networks are widely used in military and other scientific areas. With nodes which can move arbitrarily and connect to any nodes at will, it is impossible for Ad hoc network to own an fixed infrastructure...
Architecture for Mobile based Face Detection / Recognition
In this paper a novel description of Face Detection-Recognition architecture through mobile devices is presented. Since the face detection/recognition is of importance in real-life scenarios, such as for authentication a...
Load Balanced Routing using OSPF
Today’s Internet applications are in need of additional bandwidth. The Internet nature changes and its traffic are growing because of new applications. Initially when the file transfers dominated the internet we don’t re...
Frequent Pattern Mining using CATSIM Tree
Efficient algorithms to discover frequent patterns are essential in data mining research. Frequent pattern mining is emerging as powerful tool for many business applications such as e-commerce, recommender systems and su...
Effective Term Based Text Clustering Algorithms
Text clustering methods can be used to group large sets of text documents. Most of the text clustering methods do not address the problems of text clustering such as very high dimensionality of the data and understandabi...