scholarly journals A New Privacy Preserving Association Rule Mining Algorithm Based on Hybrid Partial Hiding Strategy

2013 ◽  
Vol 13 (Special-Issue) ◽  
pp. 41-50 ◽  
Author(s):  
Jian-Ming Zhu ◽  
Ning Zhang ◽  
Zhan-Yu Li

Abstract Data mining is the progress of automatically discovering high level data and trends in large amounts of data that would otherwise remain hidden. In order to improve the privacy preservation of association rule mining, a hybrid partial hiding algorithm (HPH) is proposed. The original data set can be interfered and transformed by different random parameters. Then, the algorithm of generating frequent items based on HPH is presented. Finally, it can be proved that the privacy of HPH algorithm is better than that of the original algorithm.

Author(s):  
Basar Öztaysi ◽  
Sezi Çevik Onar

Social networking became one of the main marketing tools in the recent years since it’s a faster and cheaper way to reach the customers. Companies can use social networks for efficient communication with their current and potential customers but the value created through the usage of social networks depends on how well the organizations use these tools. Therefore a support system which will enhance the usage of these tools is necessary. Fuzzy Association rule mining (FARM) is a commonly used data mining technique which focuses on discovering the frequent items and association rules in a data set and can be a powerful tool for enhancing the usage of social networks. Therefore the aim of the chapter is to propose a fuzzy association rule mining based methodology which will present the potential of using the FARM techniques in the field of social network analysis. In order to reveal the applicability, an experimental evaluation of the proposed methodology in a sports portal will be presented.


2021 ◽  
Vol 3 ◽  
Author(s):  
Oliver Haas ◽  
Luis Ignacio Lopera Gonzalez ◽  
Sonja Hofmann ◽  
Christoph Ostgathe ◽  
Andreas Maier ◽  
...  

We propose a novel knowledge extraction method based on Bayesian-inspired association rule mining to classify anxiety in heterogeneous, routinely collected data from 9,924 palliative patients. The method extracts association rules mined using lift and local support as selection criteria. The extracted rules are used to assess the maximum evidence supporting and rejecting anxiety for each patient in the test set. We evaluated the predictive accuracy by calculating the area under the receiver operating characteristic curve (AUC). The evaluation produced an AUC of 0.89 and a set of 55 atomic rules with one item in the premise and the conclusion, respectively. The selected rules include variables like pain, nausea, and various medications. Our method outperforms the previous state of the art (AUC = 0.72). We analyzed the relevance and novelty of the mined rules. Palliative experts were asked about the correlation between variables in the data set and anxiety. By comparing expert answers with the retrieved rules, we grouped rules into expected and unexpected ones and found several rules for which experts' opinions and the data-backed rules differ, most notably with the patients' sex. The proposed method offers a novel way to predict anxiety in palliative settings using routinely collected data with an explainable and effective model based on Bayesian-inspired association rule mining. The extracted rules give further insight into potential knowledge gaps in the palliative care field.


Author(s):  
Ling Zhou ◽  
Stephen Yau

Association rule mining among frequent items has been extensively studied in data mining research. However, in recent years, there is an increasing demand for mining infrequent items (such as rare but expensive items). Since exploring interesting relationships among infrequent items has not been discussed much in the literature, in this chapter, the authors propose two simple, practical and effective schemes to mine association rules among rare items. Their algorithms can also be applied to frequent items with bounded length. Experiments are performed on the well-known IBM synthetic database. The authors’ schemes compare favorably to Apriori and FP-growth under the situation being evaluated. In addition, they explore quantitative association rule mining in transactional databases among infrequent items by associating quantities of items: some interesting examples are drawn to illustrate the significance of such mining.


Author(s):  
Reshu Agarwal

A modified framework that applies temporal association rule mining to inventory management is proposed in this article. The ordering policy of frequent items is determined and inventory is classified based on loss rule. This helps inventory managers to determine optimum order quantity of frequent items together with the most profitable item in each time-span. An example is illustrated to validate the results.


Author(s):  
Reshu Agarwal ◽  
Sarla Pareek ◽  
Biswajit Sarkar ◽  
Mandeep Mittal

In this article, an inventory model for a retailer's ordering policy is studied. Multi-level association rule mining is used to find frequent item-sets at each level by applying different threshold at different levels. During order quantity estimation, category, content, and brand of the items are considered, which leads to the discovery of more specific and concrete knowledge of the required order quantity. At each level, optimum order quantity of frequent items is determined. This assists inventory manager to order optimal quantity of items as per the actual requirement of the item with respect to their category, content and brand. An example is devised to explain the new approach. Further, to understand the effect of above approach in the real scenario, experiments are conducted on the exiting dataset.


Author(s):  
K.GANESH KUMAR ◽  
H.VIGNESH RAMAMOORTHY ◽  
M.PREM KUMAR ◽  
S. SUDHA

Association rule mining (ARM) discovers correlations between different item sets in a transaction database. It provides important knowledge in business for decision makers. Association rule mining is an active data mining research area and most ARM algorithms cater to a centralized environment. Centralized data mining to discover useful patterns in distributed databases isn't always feasible because merging data sets from different sites incurs huge network communication costs. In this paper, an improved algorithm based on good performance level for data mining is being proposed. In local sites, it runs the application based on the improved LMatrix algorithm, which is used to calculate local support counts. Local Site also finds a center site to manage every message exchanged to obtain all globally frequent item sets. It also reduces the time of scan of partition database by using LMatrix which increases the performance of the algorithm. Therefore, the research is to develop a distributed algorithm for geographically distributed data sets that reduces communication costs, superior running efficiency, and stronger scalability than direct application of a sequential algorithm in distributed databases.


PLoS ONE ◽  
2021 ◽  
Vol 16 (12) ◽  
pp. e0258348
Author(s):  
Nguyen Tien Huy ◽  
R. Matthew Chico ◽  
Vuong Thanh Huan ◽  
Hosam Waleed Shaikhkhalil ◽  
Vuong Ngoc Thao Uyen ◽  
...  

Background Since the COVID-19 pandemic began, there have been concerns related to the preparedness of healthcare workers (HCWs). This study aimed to describe the level of awareness and preparedness of hospital HCWs at the time of the first wave. Methods This multinational, multicenter, cross-sectional survey was conducted among hospital HCWs from February to May 2020. We used a hierarchical logistic regression multivariate analysis to adjust the influence of variables based on awareness and preparedness. We then used association rule mining to identify relationships between HCW confidence in handling suspected COVID-19 patients and prior COVID-19 case-management training. Results We surveyed 24,653 HCWs from 371 hospitals across 57 countries and received 17,302 responses from 70.2% HCWs overall. The median COVID-19 preparedness score was 11.0 (interquartile range [IQR] = 6.0–14.0) and the median awareness score was 29.6 (IQR = 26.6–32.6). HCWs at COVID-19 designated facilities with previous outbreak experience, or HCWs who were trained for dealing with the SARS-CoV-2 outbreak, had significantly higher levels of preparedness and awareness (p<0.001). Association rule mining suggests that nurses and doctors who had a ’great-extent-of-confidence’ in handling suspected COVID-19 patients had participated in COVID-19 training courses. Male participants (mean difference = 0.34; 95% CI = 0.22, 0.46; p<0.001) and nurses (mean difference = 0.67; 95% CI = 0.53, 0.81; p<0.001) had higher preparedness scores compared to women participants and doctors. Interpretation There was an unsurprising high level of awareness and preparedness among HCWs who participated in COVID-19 training courses. However, disparity existed along the lines of gender and type of HCW. It is unknown whether the difference in COVID-19 preparedness that we detected early in the pandemic may have translated into disproportionate SARS-CoV-2 burden of disease by gender or HCW type.


2013 ◽  
Vol 23 (03) ◽  
pp. 1350012 ◽  
Author(s):  
FADI THABTAH ◽  
SUHEL HAMMOUD

Association rule is one of the primary tasks in data mining that discovers correlations among items in a transactional database. The majority of vertical and horizontal association rule mining algorithms have been developed to improve the frequent items discovery step which necessitates high demands on training time and memory usage particularly when the input database is very large. In this paper, we overcome the problem of mining very large data by proposing a new parallel Map-Reduce (MR) association rule mining technique called MR-ARM that uses a hybrid data transformation format to quickly finding frequent items and generating rules. The MR programming paradigm is becoming popular for large scale data intensive distributed applications due to its efficiency, simplicity and ease of use, and therefore the proposed algorithm develops a fast parallel distributed batch set intersection method for finding frequent items. Two implementations (Weka, Hadoop) of the proposed MR association rule algorithm have been developed and a number of experiments against small, medium and large data collections have been conducted. The ground bases of the comparisons are time required by the algorithm for: data initialisation, frequent items discovery, rule generation, etc. The results show that MR-ARM is very useful tool for mining association rules from large datasets in a distributed environment.


Sign in / Sign up

Export Citation Format

Share Document