Proceedings Article10.1109/CICN.2012.44
An Efficient Technique on Cluster Based Master Slave Architecture Design
Neha Saxena,Niket Bhargava,Urmila Mahor,Nitin Dixit +3 more
- 03 Nov 2012
- pp 561-565
5
TL;DR: This paper describes new technique cluster based Master-Slave architecture that uses Hybrid technique, the grouping of bottom up and top down technique for search repetitive item sets, and reduces the time in use to get out the support count of the item sets.
read more
Abstract: We are in an age repeatedly referred to the information age. In this age, because we suppose that information leads to power and achievement, and credit to sophisticated techniques such as computers, satellites etc. we include collecting large amount of information similar to business transaction, scientific data, medical data satellite data, surveillance video a pictures world wide web and many more. With the enormous amount of data stored in files, data base and this technique hold large amount of data is called data mining. Data mining is the method of extracting valuable information from the enormous amount of data saved in the database and files. At that time basically two important reasons that are used in data mining. First our capacity to accumulate and store the large amount of data is fast increase day by day, and second but the most imperative basis is the need to turn such data into useful information and knowledge. Association rule mining is a vital procedure to find out hidden interaction with items in the transaction. This paper describes new technique cluster based Master-Slave architecture. It uses Hybrid technique, the grouping of bottom up and top down technique for search repetitive item sets. It reduces the time in use to get out the support count of the item sets. The Prime number show present offers the give for verify rules and provides decrease in the data complexity.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Algorithm and approaches to handle large Data- A Survey
TL;DR: This paper presents a review of various algorithms from 1994-2013 necessary for handling such large data set, and lists various tool that were developed for analyzing them.
Algorithm and Approaches to Handle Big Data
Uzma Shafaque,Parag D. Thakare +1 more
- 05 Sep 2014
TL;DR: A review of various algorithms necessary for handling such large data set is given and these algorithms give us various methods implemented to handle Big Data.
A Survey of approaches for mining large data sets
Shweta Mishra,Vivek Badhe +1 more
TL;DR: These algorithms define various structures and methods implemented to handle Big Data, also in the paper are listed various tool that were developed for analyzing them.
2
A Study on Different Mining Operations on RFID Dataset
Jagpreet Singh,Meghna Sharma +1 more
- 01 Jan 2013
TL;DR: The presented paper is the study of different dataset filtration approaches such as association mining, apriori algorithm etc. on large RFID dataset to perform the cleaning and classification.
References
•Journal Article
Research of an improved Apriori algorithm in mining association rules
TL;DR: An enhanced Apriori algorithm which directly used the row vectors of boolean matrix for transaction databases to find out the frequent item sets and has the virtues in high speed, less memory cost and handling with large item set dimensions is presented.
17
•Journal Article
An Association Mining Algorithm Based on Matrix
TL;DR: The result of the experiment shows that this algorithm can achieve better performance than Apriori and is more feasible especially when the degree of the frequent itemset is high.
9
•Journal Article
Incremental updating algorithm based on matrix for mining association rules
TL;DR: It’s proved that the time complexity and space complexity of the algorithm are effectively reduced.
3
An Optimized Distributed Association Rule Mining Algorithm in Parallel and Distributed Data Mining with XML Data for Improved Response Time
TL;DR: An Optimized Distributed Association Rule mining algorithm for geographically distributed data is used in parallel and distributed environment so that it reduces communication costs.
Related Papers (5)
Zili Zhang,Chengqi Zhang +1 more
- 01 Jan 2004
Wenliang Cao,Xuanzi Hu,Chongjie Dong +2 more
- 26 Jul 2011