Refine your search
Collections
Co-Authors
Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Selvadoss Thanamani, Antony
- ESWCA:An Efficient Algorithm for Mining Frequent Itemsets
Abstract Views :207 |
PDF Views:1
Authors
Affiliations
1 Department of Computer Science, NGM College, Pollachi, IN
1 Department of Computer Science, NGM College, Pollachi, IN
Source
Data Mining and Knowledge Engineering, Vol 3, No 5 (2011), Pagination: 300-306Abstract
The most significant tasks in data mining are the process of mining frequent itemsets over data streams. It should support the flexible trade-off between processing time and mining accuracy. The objective was to propose an effective algorithm which generates frequent itemsets in a very less time by avoiding multiple scans. In this paper, we present an improved algorithm ESWCA for mining frequent itemsets using sliding window model. The ESWCA algorithm processes on an on-line transactional data stream. In this approach, we handle continues transaction slides in a segment-based manner which produces the improved runtime and memory consumption. Also, by revising the fair-cutter in the novel algorithm, multiple scans of the entire datasets will be avoided. Our experiments show that our algorithm not only achieved effectively consumes less memory, but also runs in an efficient manner.Keywords
Data Stream, Data-Stream Mining, Frequent Itemset, and Sliding Window.- A Novel Association Rule Mining Algorithm to Enhance Confidentiality in Data Mining
Abstract Views :216 |
PDF Views:3
Authors
Affiliations
1 Department of Computer Applications, J.J. College of Arts and Science, Pudukkottai, Tamilnadu, IN
2 Department of Computer Science, NGM College, Pollachi, Coimbatore, Tamilnadu, IN
1 Department of Computer Applications, J.J. College of Arts and Science, Pudukkottai, Tamilnadu, IN
2 Department of Computer Science, NGM College, Pollachi, Coimbatore, Tamilnadu, IN
Source
Data Mining and Knowledge Engineering, Vol 3, No 5 (2011), Pagination: 307-313Abstract
Data mining is the process of extracting hidden patterns from data. As more data is gathered, with the amount of data increasing every year, data mining is becoming an increasingly important tool to transform this data into information. We focus on APRIORI algorithm, a popular data mining technique and analyze the performance of linked list based implementation as a basis for mining frequent item sequences in a transactional database. This algorithm has given us new capabilities to identify associations in large data sets. But an important issue, still not sufficiently scanned, is the need to balance the confidentiality of the disclosed data with the legitimate needs of the data users. We work with some association rule hiding algorithms and examine their performances in order to analyze their time complexity and the impact that they have in the original database. We work a side effect – the number of new rules generated during the hiding process.Keywords
Association Rule Mining, Apriori Algorithm, Privacy Issues, Hiding Strategies.- Knowledge Management System Architecture for Industrial Applications Using Web Mining Techniques
Abstract Views :174 |
PDF Views:3
Authors
Affiliations
1 Department of Computer Science, Yadava College, Madurai, IN
2 Department of Computer Science, NGM College, Coimbatore, IN
1 Department of Computer Science, Yadava College, Madurai, IN
2 Department of Computer Science, NGM College, Coimbatore, IN