Efficient Association Rule Mining for Retrieving Frequent Itemsets in Big Data Sets

2018 ◽  
Vol 26 (1) ◽  
pp. 1-14
Author(s):  
Chandaka Babi ◽  
Mandapati Rao ◽  
Vedula Rao
Keyword(s):  
Big Data ◽  
Association Rule ◽  
Association Rule Mining ◽  
Frequent Itemsets ◽  
Data Sets ◽  
Rule Mining

The Novel Model of Construct Materials Science and Information Based on Association Rule Mining

2013 ◽  
Vol 327 ◽  
pp. 197-200
Author(s):  
Guo Fang Kuang ◽  
Ying Cun Cao
Keyword(s):  
Experimental Data ◽  
Data Mining ◽  
Association Rule ◽  
Association Rule Mining ◽  
Materials Science ◽  
Frequent Itemsets ◽  
Data Sets ◽  
The Novel ◽  
Rule Mining ◽  
Novel Model

The material is used by humans to manufacture the machines, components, devices and other products of substances. Association rules originated in the field of data mining, people use it to find large amounts of data between itemsets of the association. Apriori is a breadth-first algorithm to obtain the support is greater than the minimum support of frequent itemsets by repeatedly scanning the database. This paper presents the construction of materials science and information model based on association rule mining. Experimental data sets prove that the proposed algorithm is effective and reasonable.

scholarly journals Association Rule Mining on Big Data Sets

2020 ◽  
Author(s):  
Oguz Celik ◽  
Muruvvet Hasanbasoglu ◽  
Mehmet S. Aktas ◽  
Oya Kalipsiz
Keyword(s):  
Big Data ◽  
Association Rule ◽  
Association Rule Mining ◽  
Data Sets ◽  
Rule Mining

scholarly journals An improvement of FP-Growth association rule mining algorithm based on adjacency table

2018 ◽  
Vol 189 ◽  
pp. 10012 ◽  
Author(s):  
Ming Yin ◽  
Wenjie Wang ◽  
Yang Liu ◽  
Dan Jiang
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Hash Table ◽  
Frequent Itemsets ◽  
Frequent Pattern ◽  
Data Sets ◽  
Rule Mining ◽  
Mining Algorithm ◽  
Mining Frequent Itemsets ◽  
Improved Algorithm

FP-Growth algorithm is an association rule mining algorithm based on frequent pattern tree (FP-Tree), which doesn’t need to generate a large number of candidate sets. However, constructing FP-Tree requires two scansof the original transaction database and the recursive mining of FP-Tree to generate frequent itemsets. In addition, the algorithm can’t work effectively when the dataset is dense. To solve the problems of large memory usage and low time-effectiveness of data mining in this algorithm, this paper proposes an improved algorithm based on adjacency table using a hash table to store adjacency table, which considerably saves the finding time. The experimental results show that the improved algorithm has good performance especially for mining frequent itemsets in dense data sets.

Study of Various Parallel Implementations of Association Rule Mining Algorithm

2020 ◽  
Vol 1 (3) ◽  
pp. 1-7
Author(s):  
Sarbani Dasgupta ◽  
Banani Saha
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Parallel Implementation ◽  
Rule Learning ◽  
Frequent Itemsets ◽  
Rule Mining ◽  
Large Dataset ◽  
Transactional Databases ◽  
Frequent Itemsets Mining ◽  
Sequential Implementation

In data mining, Apriori technique is generally used for frequent itemsets mining and association rule learning over transactional databases. The frequent itemsets generated by the Apriori technique provides association rules which are used for finding trends in the database. As the size of the database increases, sequential implementation of Apriori technique will take a lot of time and at one point of time the system may crash. To overcome this problem, several algorithms for parallel implementation of Apriori technique have been proposed. This paper gives a comparative study on various parallel implementation of Apriori technique .It also focuses on the advantages of using the Map Reduce technology, the latest technology used in parallelization of large dataset mining.

scholarly journals Present State-of-The-Art of Association Rule Mining Algorithms

2019 ◽  
Vol 9 (1) ◽  
pp. 6398-6405
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Association Rule Mining ◽  
State Of The Art ◽  
Synthetic Data ◽  
Data Sets ◽  
Evolutionary Analysis ◽  
Rule Mining ◽  
Transaction Database ◽  
Mining Algorithms

A Data mining is the method of extracting useful information from various repositories such as Relational Database, Transaction database, spatial database, Temporal and Time-series database, Data Warehouses, World Wide Web. Various functionalities of Data mining include Characterization and Discrimination, Classification and prediction, Association Rule Mining, Cluster analysis, Evolutionary analysis. Association Rule mining is one of the most important techniques of Data Mining, that aims at extracting interesting relationships within the data. In this paper we study various Association Rule mining algorithms, also compare them by using synthetic data sets, and we provide the results obtained from the experimental analysis

scholarly journals Construction Search Engine Based on Formal Concept Analysis and Association Rule Mining

2012 ◽  
Vol 6-7 ◽  
pp. 625-630 ◽  
Author(s):  
Hong Sheng Xu
Keyword(s):  
Search Engine ◽  
Association Rule ◽  
Formal Concept Analysis ◽  
Association Rule Mining ◽  
High Efficiency ◽  
Concept Lattice ◽  
Concept Analysis ◽  
Frequent Itemsets ◽  
Formal Concept ◽  
Rule Mining

In the form of background in the form of concept partial relation to the corresponding concept lattice, concept lattice is the core data structure of formal concept analysis. Association rule mining process includes two phases: first find all the frequent itemsets in data collection, Second it is by these frequent itemsets to generate association rules. This paper analyzes the association rule mining algorithms, such as Apriori and FP-Growth. The paper presents the construction search engine based on formal concept analysis and association rule mining. Experimental results show that the proposed algorithm has high efficiency.

An Efficient Compression Technique for Vertical Mining Methods

2007 ◽  
pp. 143-173
Author(s):  
Mafruz Ashrafi ◽  
David Taniar ◽  
Kate Smith
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Frequent Itemsets ◽  
Main Memory ◽  
Rule Mining ◽  
Compression Technique ◽  
Efficient Manner ◽  
Handling Technique ◽  
Mining Methods ◽  
Mining Algorithms

Association rule mining is one of the most widely used data mining techniques. To achieve a better performance, many efficient algorithms have been proposed. Despite these efforts, many of these algorithms require a large amount of main memory to enumerate all frequent itemsets, especially when the dataset is large or the user-specified support is low. Thus, it becomes apparent that we need to have an efficient main memory handling technique, which allows association rule mining algorithms to handle larger datasets in the main memory. To achieve this goal, in this chapter we propose an algorithm for vertical association rule mining that compresses a vertical dataset in an efficient manner, using bit vectors. Our performance evaluations show that the compression ratio attained by our proposed technique is better than those of the other well-known techniques.

Sign in / Sign up

Export Citation Format

Share Document