scholarly journals Predicting the formation of tornadoes using association rule mining by studying a real life tornado event : Georgia, USA January, 2013

MAUSAM ◽  
2021 ◽  
Vol 72 (4) ◽  
pp. 813-820
Author(s):  
GURBRINDER KAUR ◽  
RATTAN K. DATTA
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Real Life ◽  
Weather Conditions ◽  
Lower Atmosphere ◽  
Rule Mining ◽  
Weather Variables ◽  
Satisfactory Explanation ◽  
Depth Analysis ◽  
Tornado Event

Tornadoes form in violent thunderstorms due to instability and wind shear present in the lower atmosphere. The spinning of a tornado is the result of the updrafts and downdrafts caused due to unstable air. The mystery that how and why tornadoes are formed are far away from a satisfactory explanation. In this paper, data is extracted from real time tornado event occurred at Georgia, USA in January, 2013. Then in-depth analysis has been done on each variable responsible to bring tornado and finally association rule mining has been applied to find association among all those weather variables. Our study produced interesting rules to predict non tornadic and tornadic weather conditions.

Association Rule Mining in Collaborative Filtering

2017 ◽  
pp. 159-179 ◽  
Author(s):  
Carson K.-S. Leung ◽  
Fan Jiang ◽  
Edson M. Dela Cruz ◽  
Vijay Sekar Elango
Keyword(s):  
Data Mining ◽  
Collaborative Filtering ◽  
Association Rules ◽  
Data Structures ◽  
Association Rule ◽  
Association Rule Mining ◽  
Real Life ◽  
Frequent Patterns ◽  
Rule Mining ◽  
Association Rule Miner

Collaborative filtering uses data mining and analysis to develop a system that helps users make appropriate decisions in real-life applications by removing redundant information and providing valuable to information users. Data mining aims to extract from data the implicit, previously unknown and potentially useful information such as association rules that reveals relationships between frequently co-occurring patterns in antecedent and consequent parts of association rules. This chapter presents an algorithm called CF-Miner for collaborative filtering with association rule miner. The CF-Miner algorithm first constructs bitwise data structures to capture important contents in the data. It then finds frequent patterns from the bitwise structures. Based on the mined frequent patterns, the algorithm forms association rules. Finally, the algorithm ranks the mined association rules to recommend appropriate merchandise products, goods or services to users. Evaluation results show the effectiveness of CF-Miner in using association rule mining in collaborative filtering.

A Survey on Fuzzy Association Rule Mining

2013 ◽  
Vol 9 (1) ◽  
pp. 1-27 ◽  
Author(s):  
Harihar Kalia ◽  
Satchidananda Dehuri ◽  
Ashish Ghosh
Keyword(s):  
Association Rules ◽  
Association Rule ◽  
Quantitative Data ◽  
Association Rule Mining ◽  
Real Life ◽  
Rule Mining ◽  
Fuzzy Association Rules ◽  
Fuzzy Association Rule ◽  
Mining Algorithms ◽  
Fuzzy Association Rule Mining

Association rule mining is one of the fundamental tasks of data mining. The conventional association rule mining algorithms, using crisp set, are meant for handling Boolean data. However, in real life quantitative data are voluminous and need careful attention for discovering knowledge. Therefore, to extract association rules from quantitative data, the dataset at hand must be partitioned into intervals, and then converted into Boolean type. In the sequel, it may suffer with the problem of sharp boundary. Hence, fuzzy association rules are developed as a sharp knife to solve the aforesaid problem by handling quantitative data using fuzzy set. In this paper, the authors present an updated survey of fuzzy association rule mining procedures along with a discussion and relevant pointers for further research.

A Comparative Study of Tree-Based and Apriori-Based Approaches for Incremental Data Mining

2016 ◽  
Vol 23 ◽  
pp. 120-130
Author(s):  
Manoj Kumar ◽  
Hemant Kumar Soni
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Future Research ◽  
Frequent Patterns ◽  
Rule Mining ◽  
Business Decisions ◽  
Depth Analysis ◽  
Intelligent Tools

Association rule mining is an iterative and interactive process of discovering valid, novel, useful, understandable and hidden associations from the massive database. The Colossal databases require powerful and intelligent tools for analysis and discovery of frequent patterns and association rules. Several researchers have proposed the many algorithms for generating item sets and association rules for discovery of frequent patterns, and minning of the association rules. These proposals are validated on static data. A dynamic database may introduce some new association rules, which may be interesting and helpful in taking better business decisions. In association rule mining, the validation of performance and cost of the existing algorithms on incremental data are less explored. Hence, there is a strong need of comprehensive study and in-depth analysis of the existing proposals of association rule mining. In this paper, the existing tree-based algorithms for incremental data mining are presented and compared on the baisis of number of scans, structure, size and type of database. It is concluded that the Can-Tree approach dominates the other algorithms such as FP-Tree, FUFP-Tree, FELINE Alorithm with CATS-Tree etc.This study also highlights some hot issues and future research directions. This study also points out that there is a strong need for devising an efficient and new algorithm for incremental data mining.

scholarly journals Highlighting the rules between diagnosis types and laboratory diagnostic tests for patients of an emergency department: Use of association rule mining

2019 ◽  
Vol 26 (2) ◽  
pp. 1177-1193
Author(s):  
Görkem Sarıyer ◽  
Ceren Öcal Taşar
Keyword(s):  
Emergency Department ◽  
Diagnostic Test ◽  
Association Rule ◽  
Emergency Departments ◽  
Diagnostic Tests ◽  
Association Rule Mining ◽  
Real Life ◽  
Rule Mining ◽  
International Classification Of Disease ◽  
Use Of Resources

Diagnostic tests are widely used in emergency departments to make detailed investigations on diagnosis and treat patients correctly. However, since these tests are expensive and time-consuming, ordering correct tests for patients is crucial for efficient use of hospital resources. Thus, understanding the relation between diagnosis and diagnostic test requirement becomes an important issue in emergency departments. Association rule mining was used to extract hidden patterns and relation between diagnosis and diagnostic test requirement in real-life medical data received from an emergency department. Apriori was used as an association rule mining algorithm. Diagnosis was grouped into 21 categories based on International Classification of Disease, and laboratory tests were grouped into four main categories (hemogram, biochemistry, cardiac enzyme, urine and human excrement related). Both positive and negative rules were discovered. Since the nature of the data had the dominance of negative values, higher number of negative rules with higher confidences were discovered compared to positive ones. The extracted rules were validated by emergency department experts and practitioners. It was concluded that understanding the association between patient’s diagnosis and diagnostic test requirement can improve decision-making and efficient use of resources in emergency departments. Association rules can also be used for supporting physicians to treat patients.

Dynamic Itemset Hiding Algorithm for Multiple Sensitive Support Thresholds

2018 ◽  
Vol 14 (2) ◽  
pp. 37-59 ◽  
Author(s):  
Ahmet Cumhur Öztürk ◽  
Belgin Ergenç
Keyword(s):  
Decision Making ◽  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Real Life ◽  
Information Loss ◽  
Rule Mining ◽  
Dynamic Algorithm ◽  
Data Owner ◽  
Transactional Databases

This article describes how association rule mining is used for extracting relations between items in transactional databases and is beneficial for decision-making. However, association rule mining can pose a threat to the privacy of the knowledge when the data is shared without hiding the confidential association rules of the data owner. One of the ways hiding an association rule from the database is to conceal the itemsets (co-occurring items) from which the sensitive association rules are generated. These sensitive itemsets are sanitized by the itemset hiding processes. Most of the existing solutions consider single support thresholds and assume that the databases are static, which is not true in real life. In this article, the authors propose a novel itemset hiding algorithm designed for the dynamic database environment and consider multiple itemset support thresholds. Performance comparisons of the algorithm is done with two dynamic algorithms on six different databases. Findings show that their dynamic algorithm is more efficient in terms of execution time and information loss and guarantees to hide all sensitive itemsets.

scholarly journals Analysis of the progressive sampling-based approach using real life datasets

2011 ◽  
Vol 1 (2) ◽  
Author(s):  
Venkatapathy Umarani ◽  
Muthusamy Punithavalli
Keyword(s):  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Real Life ◽  
Computation Time ◽  
Frequent Itemsets ◽  
Rule Mining ◽  
Large Databases ◽  
Very Large Databases ◽  
Progressive Sampling

AbstractThe discovery of association rules is an important and challenging data mining task. Most of the existing algorithms for finding association rules require multiple passes over the entire database, and I/O overhead incurred is extremely high for very large databases. An obvious approach to reduce the complexity of association rule mining is sampling. In recent times, several sampling-based approaches have been developed for speeding up the process of association rule mining. A proficient progressive sampling-based approach is presented for mining association rules from large databases. At first, frequent itemsets are mined from an initial sample and subsequently, the negative border is computed from the mined frequent itemsets. Based on the support computed for the midpoint itemset in the sorted negative border, the sample size is either increased or association rules are mined from it. In this paper, we have presented an extensive analysis of the progressive sampling-based approach with different real life datasets and, in addition, the performance of the approach is evaluated with the well-known association rule mining algorithm, Apriori. The experimental results show that accuracy and computation time of the progressive sampling-based approach is effectively improved in mining of association rules from the real life datasets.

Prediksi Code Defect Perangkat Lunak Dengan Metode Association Rule Mining dan Cumulative Support Thresholds

2015 ◽  
Vol 6 (2) ◽  
Author(s):  
Rizal Setya Perdana ◽  
Umi Laili Yuhana
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Rule Mining ◽  
Program Code

Kualitas perangkat lunak merupakan salah satu penelitian pada bidangrekayasa perangkat lunak yang memiliki peranan yang cukup besar dalamterbangunnya sistem perangkat lunak yang berkualitas baik. Prediksi defectperangkat lunak yang disebabkan karena terdapat penyimpangan dari prosesspesifikasi atau sesuatu yang mungkin menyebabkan kegagalan dalam operasionaltelah lebih dari 30 tahun menjadi topik riset penelitian. Makalah ini akandifokuskan pada prediksi defect yang terjadi pada kode program (code defect).Metode penanganan permasalahan defect pada kode program akan memanfaatkanpola-pola kode perangkat lunak yang berpotensi menimbulkan defect pada data setNASA untuk memprediksi defect. Metode yang digunakan dalam pencarian polaadalah memanfaatkan Association Rule Mining dengan Cumulative SupportThresholds yang secara otomatis menghasilkan nilai support dan nilai confidencepaling optimal tanpa membutuhkan masukan dari pengguna. Hasil pengujian darihasil pemrediksian defect kode perangkat lunak secara otomatis memiliki nilaiakurasi 82,35%.

Sign in / Sign up

Export Citation Format

Share Document