EFFICIENT ALGORITHM FOR MINING FREQUENT ITEMSETS USING CLUSTERING TECHNIQUES
Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 3
Abstract
Now a days, Association rule plays an important role. The purchasing of one product when another product is purchased represents an association rule. The Apriori algorithm is the basic algorithm for mining association rules. This paper presents an efficient Partition Algorithm for Mining Frequent Itemsets(PAFI) using clustering. This algorithm finds the frequent itemsets by partitioning the database transactions into clusters. Clusters are formed based on the similarity measures between the transactions. Then it finds the frequent itemsets with the transactions in the clusters directly using improved Apriori algorithm which further reduces the number of scans in the database and hence improve the efficiency.
Authors and Affiliations
D. Kerana Hanirex , Dr. M. A. Dorai Rangaswamy
Keywords
Related Articles
- EP ID EP91912
- DOI -
- Views 133
- Downloads 0
Comparing Neural Network Approach with N-Gram Approach for Text Categorization
This paper compares Neural network Approach with N-gram approach, for text categorization, and demonstrates that Neural Network approach is similar to the N-gram approach but with much less judging time. Both methods dem...
Content Based Image Retrieval using Density Distribution and Mean of Binary Patterns of Walsh Transformed Color Images
This paper introduces a novel idea of Binary Pattern observation of column wise and Row wise Walsh transformed color images for feature vector generation. The density distribution of Sal, Cal components of Binary Pattern...
Bitwise Operations Based Encryption and Decryption
In this paper, variable block length based character/bit level ransformation has been proposed for encryption and cryption, where a block of characters /few bits has taken into account. he originated text is transfor...
A Comparative Analysis of Web Page Ranking Algorithms
Web is expending day by day and people generally rely on search engine to explore the web. In such a scenario it is the duty of service provider to provide proper, relevant and quality information to the internet user ag...
Fuzzy Shortest Path For Steiner Tree Problem
In this paper, a modification of the shortest path approximation based on the fuzzy shortest paths evaluations. The Steiner tree problem on a graph in which a fuzzy number instead of a real number is assigned to each edg...