scholarly journals Association Rules Mining for Hospital Readmission: A Case Study

Mathematics ◽  
2021 ◽  
Vol 9 (21) ◽  
pp. 2706
Author(s):  
Nor Hamizah Miswan ◽  
‘Ismat Mohd Sulaiman ◽  
Chee Seng Chan ◽  
Chong Guan Ng
Keyword(s):  
Association Rule ◽  
Hospital Readmission ◽  
Association Rule Mining ◽  
Demographic Variables ◽  
Apriori Algorithm ◽  
Age Group ◽  
Rule Mining ◽  
Learning Rules ◽  
And Performance

As an indicator of healthcare quality and performance, hospital readmission incurs major costs for healthcare systems worldwide. Understanding the relationships between readmission factors, such as input features and readmission length, is challenging following intricate hospital readmission procedures. This study discovered the significant correlation between potential readmission factors (threshold of various settings for readmission length) and basic demographic variables. Association rule mining (ARM), particularly the Apriori algorithm, was utilised to extract the hidden input variable patterns and relationships among admitted patients by generating supervised learning rules. The mined rules were categorised into two outcomes to comprehend readmission data; (i) the rules associated with various readmission length and (ii) several expert-validated variables related to basic demographics (gender, race, and age group). The extracted rules proved useful to facilitate decision-making and resource preparation to minimise patient readmission.

Souvenir Sales Analysis using Apriori Algorithm (Case Study: Ubud-Market Transaction in March 2020)

2021 ◽  
Vol 10 (1) ◽  
pp. 73
Author(s):  
Muhammad Firyanul Rizky ◽  
I Gusti Agung Gede Arya Kadyanan
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Marketing Strategies ◽  
Apriori Algorithm ◽  
Rule Mining ◽  
Minimum Support ◽  
Track Record ◽  
Market Transaction ◽  
Transaction Database

Ubud market is one of the largest art markets in Bali, there are many local Balinese souvenir traders and craftspeople, most of them are livelihoods depend on buying and selling local souvenirs, Since the Covid-19 pandemic entered in April 2020, Ubud market traders have started to close their business and hoping economic recoveryin future. The author tries to do a track record of souvenir sales transactions in Ubud market to find the last sales pattern before the traders closes their business to give a solution for marketing strategies in future. The sales transaction data will just become meaningless trash if it’s useless.. To get use information about the products that are most sold out at Ubud Market from the transaction database, the author uses the Apriori algorithm. This study was determined final rules on 2 itemset combination, If buying Manik-Manik Craft, Also buy Barong Shirt with the highest confidence 70% and Minimum Support 28%, and for 3 itemset a combination, If buying Celuk Silver, and Barong Shirt, Also buy Manik-Manik Craft with the highest confidence 37.5% and Minimum Support 12%, based on that there are 3 best-selling souvenir products, namely Barong Shirt, Manik-Manik Craft and Silver-Celuk in March 2020. Keywords: Apriori Algorithm, Data Mining, Sales Analysis, Association Rule Mining, Ubud Market.

scholarly journals Association Rule Mining for Selecting Proper Students to Take Part in Proper Discipline Competition: A Case Study of Zhejiang University of Finance and Economics

2018 ◽  
Vol 13 (03) ◽  
pp. 100 ◽  
Author(s):  
Xiaoling Huang ◽  
Yangbing Xu ◽  
Shuai Zhang ◽  
Wenyu Zhang
Keyword(s):  
Undergraduate Students ◽  
Association Rule ◽  
Association Rule Mining ◽  
Web Design ◽  
Object Oriented ◽  
Apriori Algorithm ◽  
Rule Mining ◽  
Design Data ◽  
The Relationship

In recent years, the educational issues have attracted more and more researchers’ and teachers’ attention. On the other hand, the development of data mining technology, provides a new method to extract the useful information from the complex educational data. In order to increase the chance of students to be awarded in discipline competition, it is better to select the proper students to take part in the proper discipline competition. Therefore, in this study, we collect the information of 164 undergraduate students as a case study. All students majored in Software Engineering in Zhejiang University of Finance and Economics. The Apriori algorithm with group strategy is used to find the relationship between the students’ courses scores and competition awards. According to the results of association rule mining, we find that the students with higher scores of C# Development, Object-Oriented, Internet Web Design, Data Structure(C#), and Basic Programming will have a higher probability to be awarded in the competition.

The Research of Improved Apriori Algorithm

2012 ◽  
Vol 263-266 ◽  
pp. 2179-2184 ◽  
Author(s):  
Zhen Yun Liao ◽  
Xiu Fen Fu ◽  
Ya Guang Wang
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Apriori Algorithm ◽  
Rule Mining ◽  
Frequent Item ◽  
Mining Algorithm ◽  
The Times ◽  
Frequent Item Sets ◽  
Candidate Item ◽  
Improved Algorithm

The first step of the association rule mining algorithm Apriori generate a lot of candidate item sets which are not frequent item sets, and all of these item sets cost a lot of system spending. To solve this problem，this paper presents an improved algorithm based on Apriori algorithm to improve the Apriori pruning step. Using this method, the large number of useless candidate item sets can be reduced effectively and it can also reduce the times of judge whether the item sets are frequent item sets. Experimental results show that the improved algorithm has better efficiency than classic Apriori algorithm.

Support-Less Association Rule Mining Using Tuple Count Cube

2007 ◽  
Vol 06 (04) ◽  
pp. 271-280
Author(s):  
Qin Ding ◽  
William Perrizo
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Data Cube ◽  
Apriori Algorithm ◽  
Rule Mining ◽  
High Confidence ◽  
Support Level ◽  
Vertical Data ◽  
Frequent Item Sets ◽  
High Support

Association rule mining is one of the important tasks in data mining and knowledge discovery (KDD). The traditional task of association rule mining is to find all the rules with high support and high confidence. In some applications, we are interested in finding high confidence rules even though the support may be low. This type of problem differs from the traditional association rule mining problem; hence, it is called support-less association rule mining. Existing algorithms for association rule mining, such as the Apriori algorithm, cannot be used efficiently for support-less association rule mining since those algorithms mostly rely on identifying frequent item-sets with high support. In this paper, we propose a new model to perform support-less association rule mining, i.e., to derive high confidence rules regardless of their support level. A vertical data structure, the Peano Count Tree (P-tree), is used in our model to represent all the information we need. Based on the P-tree structure, we build a special data cube, called the Tuple Count Cube (T-cube), to derive high confidence rules. Data cube operations, such as roll-up, on T-cube, provide efficient ways to calculate the count information needed for support-less association rule mining.

Sign in / Sign up

Export Citation Format

Share Document