Derive Association Rules Research Articles

Apriori Algorithm and Market Basket Analysis to Uncover Consumer Buying Patterns: Case of a Kenyan Supermarket

This article presents a study on utilizing the Apriori algorithm and Market Basket Analysis (MBA) to reveal consumer buying patterns in supermarkets. The aim of this research is to explore the effectiveness of these data mining techniques in revealing valuable insights that can inform marketing strategies and enhance the overall shopping experience for customers. This study centered on improving customer loyalty within the supermarket setting through the utilization of cutting-edge information technology and programming applications, including Python. Specifically, the Apriori algorithm libraries of the Python language were employed to identify frequent item sets and derive 42 association rules, which shed light on product affinities and co-purchasing patterns. By deriving association rules from the frequent item sets, the study identified the significance of strategically placing frequently purchased products to enhance revenue generation. In conclusion, the application of the Apriori algorithm and Market Basket Analysis in this case of a Kenyan supermarket has proven to be a valuable approach for uncovering consumer buying patterns, providing a competitive edge in the dynamic retail industry.

Analysis of Building Construction Jobsite Accident Scenarios Based on Big Data Association Analysis

This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY

Fractional salp swarm algorithm: An association rule based privacy-preserving strategy for data sanitization

Fractional salp swarm algorithm: An association rule based privacy-preserving strategy for data sanitization

COVID-19 Symptom Monitoring and Social Distancing in a University Population.

This paper reports on our efforts to collect daily COVID-19-related symptoms for a large public university population, as well as study relationship between reported symptoms and individual movements. We developed a set of tools to collect and integrate individual-level data. COVID-19-related symptoms are collected using a self-reporting tool initially implemented in Qualtrics survey system and consequently moved to .NET framework. Individual movement data are collected using off-the-shelf tracking apps available for iPhone and Android phones. Data integration and analysis are done in PostgreSQL, Python, and R. As of September 2020, we collected about 184,000 daily symptom responses for 20,000 individuals, as well as over 15,000 days of GPS movement data for 175 individuals. The analysis of the data indicates that headache is the most frequently reported symptom, present almost always when any other symptoms are reported as indicated by derived association rules. It is followed by cough, sore throat, and aches. The study participants traveled on average 223.61 km every week with a large standard deviation of 254.53 and visited on average 5.77 ± 4.75 locations each week for at least 10 min. However, there is no evidence that reported symptoms or prior COVID-19 contact affects movements (p > 0.3 in most models). The evidence suggests that although some individuals limit their movements during pandemics, the overall study population do not change their movements as suggested by guidelines.

EARMGA and Apriori Algorithm's Performance Evaluation for Association Rule Mining

Association rule mining techniques are important part of data mining to derive relationship between attributes of large databases. Association related rule mining have evolved huge interest among researchers as many challenging problems can be solved using them. Numerous algorithms have been discovered for deriving association rules effectively. It has been evaluated that not all algorithms can give similar results in all scenarios, so decoding these merits becomes important. In this paper two association rule mining algorithms were analyzed, one is popular Apriori algorithm and the other is EARMGA (Evolutionary Association Rules Mining with Genetic Algorithm). Comparison of these two algorithms were experimentally performed based on different datasets and different parameters like Number of rules generated, Average support, Average Confidence, Covered records were detailed.

Association Rule Mining for South West Monsoon Rainfall Prediction and Estimation over Mumbai Station

Rainfall is important for agricultural yield and hence early prediction is required. It has a vital role in the improving the economy of a country. Accurate and timely weather prediction for rainfall forecasting has been one of the most challenging problems around the world as it changes the physical characteristics of the hydrologic system. Rainfall prediction model involves observation of weather data, deriving knowledge from it and implementing using computer models. The proposed work observed rainfall during south-west monsoon months of Mumbai (Latitude 19.0760°N / Longitude 72.8777°E) city. Predictive Apriori Algorithm was used to derive association rules for spot prediction, 24 hours ahead prediction and 48 hours ahead prediction, also to estimate a no rain day, moderate rain day and heavy rain day.

Development of Recommendation Engines for Enhancing Sales of DIY (Do It Yourself) Stores: Vertical Approach vs. Horizontal Approach

In Japan, the popularity of DIY stores has been growing rapidly. In comparison with typical large retail chain stores, DIY stores have a wider variety of products mostly with lower prices and broader store spaces. In many cases, they are located in suburban areas with huge parking lots. Because of these unique features, customer behaviors for DIY stores could be quite different from those for ordinary large retail chain stores, and some special attentions may be needed for sales promotion. The purpose of this paper is to establish a framework for developing recommendation engines for DIY stores so as to enhance their sales. More specifically, useful recommendation rules are derived from two different perspectives: a vertical approach from a point of view of pairs of products across product categories with significant sales contributions, and a horizontal approach focusing on excellent customers who are ranked in a top segment in terms of both the purchasing amount of money and the purchasing volume of products. Assuming that certain marketing campaigns are conducted along the derived association rules, a computational procedure is developed for assessing the economic impact of each of such recommendation rules.

Inferring Intra-Community Microbial Interaction Patterns from Metagenomic Datasets Using Associative Rule Mining Techniques.

The nature of inter-microbial metabolic interactions defines the stability of microbial communities residing in any ecological niche. Deciphering these interaction patterns is crucial for understanding the mode/mechanism(s) through which an individual microbial community transitions from one state to another (e.g. from a healthy to a diseased state). Statistical correlation techniques have been traditionally employed for mining microbial interaction patterns from taxonomic abundance data corresponding to a given microbial community. In spite of their efficiency, these correlation techniques can capture only 'pair-wise interactions'. Moreover, their emphasis on statistical significance can potentially result in missing out on several interactions that are relevant from a biological standpoint. This study explores the applicability of one of the earliest association rule mining algorithm i.e. the 'Apriori algorithm' for deriving 'microbial association rules' from the taxonomic profile of given microbial community. The classical Apriori approach derives association rules by analysing patterns of co-occurrence/co-exclusion between various '(subsets of) features/items' across various samples. Using real-world microbiome data, the efficiency/utility of this rule mining approach in deciphering multiple (biologically meaningful) association patterns between 'subsets/subgroups' of microbes (constituting microbiome samples) is demonstrated. As an example, association rules derived from publicly available gut microbiome datasets indicate an association between a group of microbes (Faecalibacterium, Dorea, and Blautia) that are known to have mutualistic metabolic associations among themselves. Application of the rule mining approach on gut microbiomes (sourced from the Human Microbiome Project) further indicated similar microbial association patterns in gut microbiomes irrespective of the gender of the subjects. A Linux implementation of the Association Rule Mining (ARM) software (customised for deriving 'microbial association rules' from microbiome data) is freely available for download from the following link: http://metagenomics.atc.tcs.com/arm.

Maintaining the discovered high-utility itemsets with transaction modification

Most approaches for discovering frequent itemsets derive association rules from a binary database. Profit, cost, and quantity are not considered in traditional association-rule mining. Utility mining was proposed to measure the utilities of purchase products to derive highutility itemsets (HUIs). Many algorithms have been proposed to efficiently find HUIs from a static database. In real-world applications, transactions are inserted, deleted, or modified in dynamic situations. Existing batch approaches have to re-process the updated database since previously discovered HUIs are not maintained. In this paper, a Fast UPdated (FUP) strategy with utility measure and a maintenance algorithm, called FUP-HUI-MOD, are developed to efficiently maintain and update discovered HUIs. When transactions are modified, the proposed algorithm partitions the transactions before and after the modification into two parts, creating four cases. Each case is maintained using a specific procedure to update the discovered HUIs. Based on the designed FUP-HUI-MOD algorithm, the original database is not required to be rescanned each time compared to the state-of-the-art high-utility itemset mining algorithms in batch mode. Experiments are conducted to show that the proposed algorithm outperforms batch algorithms in maintaining HUIs.

Closed Item-Set Mining for Prediction of Indian Summer Monsoon Rainfall A Data Mining Model with Land and Ocean Variables as Predictors

Closed Item-Set Mining for Prediction of Indian Summer Monsoon Rainfall A Data Mining Model with Land and Ocean Variables as Predictors

Prediction algorithm based on web mining for multimedia objects in next-generation Digital Earth

New research questions related to big data have brought Digital Earth into a new data–intensive era. In this paper, we present a prediction algorithm based on data mining especially for multimedia objects in next–generation Digital Earth. We collect the useful data and preprocess them in client logs, mine the sequential pattern between the spatial objects and the multimedia objects, and obtain the association rules. The derived association rules can be used for prefetching some candidates in advance. The diverse experiment results show that our prefetching strategy based on mining web logs achieves higher efficiency than the other general or no prefetching ones.

A Proposal on Analysis Support System Based on Association Rule Analysis for Non-dominated Solutions

This paper presents a new analysis support system for analyzing non-dominated solutions (NDSs) derived by evolutionary multi-criterion optimization (EMO). The main features of the proposed system are to use association rule analysis and to perform a multi-granularity analysis based on a hierarchical tree of NDSs. The proposed system applies association rule analysis to the whole NDSs and derives association rules related to NDSs. And a hierarchical tree is created through our original association rule grouping that guarantees to keep at least one common features. Each node of a hierarchical tree corresponds to one group consisting of association rules and is fixed in position according to inclusion relations between groups. Since each group has some kinds of common features, the designer can analyze each node with previous knowledge of these common features. To investigate the characteristics and effectiveness of the proposed system, the proposed system is applied to the concept design problem of hybrid rocket engine (HRE) which has two objectives and six variable parameters. HRE separately stores two different types of thrust propellant unlike in the case of usual other rockets and the concept design problem of HRE has been provided by JAXA. The results of this application provided possible to analyze the trends and specifics contained in NDSs in an organized way unlike analysis approaches targeted at the whole NDSs.

A primer to frequent itemset mining for bioinformatics

Over the past two decades, pattern mining techniques have become an integral part of many bioinformatics solutions. Frequent itemset mining is a popular group of pattern mining techniques designed to identify elements that frequently co-occur. An archetypical example is the identification of products that often end up together in the same shopping basket in supermarket transactions. A number of algorithms have been developed to address variations of this computationally non-trivial problem. Frequent itemset mining techniques are able to efficiently capture the characteristics of (complex) data and succinctly summarize it. Owing to these and other interesting properties, these techniques have proven their value in biological data analysis. Nevertheless, information about the bioinformatics applications of these techniques remains scattered. In this primer, we introduce frequent itemset mining and their derived association rules for life scientists. We give an overview of various algorithms, and illustrate how they can be used in several real-life bioinformatics application domains. We end with a discussion of the future potential and open challenges for frequent itemset mining in the life sciences.

Mining high coherent association rules with consideration of support measure

Mining high coherent association rules with consideration of support measure

Dynamic discreduction using Rough Sets

Dynamic discreduction using Rough Sets

Promoting where, when and what? An analysis of web logs by integrating data mining and social network techniques to guide ecommerce business promotions

The rapid development of the internet introduced new trend of electronic transactions that is gradually dominating all aspects of our daily life. The amount of data maintained by websites to keep track of the visitors is growing exponentially. Benefitting from such data is the target of the study described in this paper. We investigate and explore the process of analyzing log data of website visitor traffic in order to assist the owner of a website in understanding the behavior of the website visitors. We developed an integrated approach that involves statistical analysis, association rules mining, and social network construction and analysis. First, we analyze the statistical data on the types of visitors that come to the website, as well as the steps they take to reach and satisfy the goal of their visit. Second, we derive association rules in order to identify the correlations between the web pages. Third, we study the links between the web pages by constructing a social network based on the frequency of access to the web pages such that two web pages get linked in the social network if they are identified as frequently accessed together. The value added from the overall analysis of the website and its related data should be considered valuable for ecommerce and commercial website owners; the owners will get the information needed to display targeted advertisements or messages to their customers. Such an automated approach gives advantage to its users in the current competitive cyberspace. In the long run, this is expected to allow for the increase in sales and overall customer loyalty.

Efficient secure data publishing algorithms for supporting information sharing

Many data sharing applications require that publishing data should protect sensitive information pertaining to individuals, such as diseases of patients, the credit rating of a customer, and the salary of an employee. Meanwhile, certain information is required to be published. In this paper, we consider data-publishing applications where the publisher specifies both sensitive information and shared information. An adversary can infer the real value of a sensitive entry with a high confidence by using publishing data. The goal is to protect sensitive information in the presence of data inference using derived association rules on publishing data. We formulate the inference attack framework, and develop complexity results. We show that computing a safe partial table is an NP-hard problem. We classify the general problem into subcases based on the requirements of publishing information, and propose algorithms for finding a safe partial table to publish. We have conducted an empirical study to evaluate these algorithms on real data. The test results show that the proposed algorithms can produce approximate maximal published data and improve the performance of existing algorithms.

PARM—An Efficient Algorithm to Mine Association Rules From Spatial Data

Association rule mining, originally proposed for market basket data, has potential applications in many areas. Spatial data, such as remote sensed imagery (RSI) data, is one of the promising application areas. Extracting interesting patterns and rules from spatial data sets, composed of images and associated ground data, can be of importance in precision agriculture, resource discovery, and other areas. However, in most cases, the sizes of the spatial data sets are too large to be mined in a reasonable amount of time using existing algorithms. In this paper, we propose an efficient approach to derive association rules from spatial data using Peano Count Tree (P-tree) structure. P-tree structure provides a lossless and compressed representation of spatial data. Based on P-trees, an efficient association rule mining algorithm PARM with fast support calculation and significant pruning techniques is introduced to improve the efficiency of the rule mining process. The P-tree based Association Rule Mining (PARM) algorithm is implemented and compared with FP-growth and Apriori algorithms. Experimental results showed that our algorithm is superior for association rule mining on RSI spatial data.

Mathematical Models To Identify Combined Protein and Clinical Biomarkers of Response to Induction Chemotherapy in Acute Myeloid Leukemia (AML).

Mathematical Models To Identify Combined Protein and Clinical Biomarkers of Response to Induction Chemotherapy in Acute Myeloid Leukemia (AML).

Online analytical mining association rules using Chi-square test

In data mining, target data selection is important. The symptom of in and garbage out is avoided to derive effective business rules in knowledge discovery in database. Chi-Square test is useful to eliminate irrelevant data before data mining processing due to wrong degrees of freedom, untested hypothesis, inconsistent estimation, inefficient method, data redundancy, data overdue, and data heterogeneity. This paper offers an online analytical processing method to derive association rules for the filtered Chi-Square tested data. The process applies a Frame metadata to trigger the Chi-Square testing for the update of the source data, and to derive rules continuously.