Reducing the Feature Space Using Constraint-Governed Association Rule Mining

2017 ◽  
Vol 26 (1) ◽  
pp. 139-152
Author(s):  
◽  
M. Umme Salma
Keyword(s):  
Data Mining ◽  
Feature Selection ◽  
Association Rule ◽  
Association Rule Mining ◽  
Medical Data ◽  
Cancer Surveillance ◽  
Feature Subset ◽  
Rule Mining ◽  
Data Set

AbstractRecent advancements in science and technology and advances in the medical field have paved the way for the accumulation of huge amount of medical data in the digital repositories, where they are stored for future endeavors. Mining medical data is the most challenging task as the data are subjected to many social concerns and ethical issues. Moreover, medical data are more illegible as they contain many missing and misleading values and may sometimes be faulty. Thus, pre-processing tasks in medical data mining are of great importance, and the main focus is on feature selection, because the quality of the input determines the quality of the resultant data mining process. This paper provides insight to develop a feature selection process, where a data set subjected to constraint-governed association rule mining and interestingness measures results in a small feature subset capable of producing better classification results. From the results of the experimental study, the feature subset was reduced to more than 50% by applying syntax-governed constraints and dimensionality-governed constraints, and this resulted in a high-quality result. This approach yielded about 98% of classification accuracy for the Breast Cancer Surveillance Consortium (BCSC) data set.

scholarly journals AN OPTIMIZED ARM SCHEME FOR DISTINCT NETWORK DATA SET

2015 ◽  
pp. 191-195
Author(s):  
K.GANESH KUMAR ◽  
H.VIGNESH RAMAMOORTHY ◽  
M.PREM KUMAR ◽  
S. SUDHA
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Association Rule Mining ◽  
Distributed Databases ◽  
Research Area ◽  
Sequential Algorithm ◽  
Data Sets ◽  
Rule Mining ◽  
Data Set ◽  
Communication Costs

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.

MINING NON-REDUNDANT ASSOCIATION RULES BASED ON CONCISE BASES

2007 ◽  
Vol 21 (04) ◽  
pp. 659-675 ◽  
Author(s):  
YUE XU ◽  
YUEFENG LI
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Rule Mining ◽  
Mining Community ◽  
Rule Set ◽  
Closed Itemsets ◽  
Minimal Generators

Association rule mining has many achievements in the area of knowledge discovery. However, the quality of the extracted association rules has not drawn adequate attention from researchers in data mining community. One big concern with the quality of association rule mining is the size of the extracted rule set. As a matter of fact, very often tens of thousands of association rules are extracted among which many are redundant, thus useless. In this paper, we first analyze the redundancy problem in association rules and then propose a reliable exact association rule basis from which more concise nonredundant rules can be extracted. We prove that the redundancy eliminated using the proposed reliable association rule basis does not reduce the belief to the extracted rules. Moreover, this paper proposes a level wise approach for efficiently extracting closed itemsets and minimal generators — a key issue in closure based association rule mining.

scholarly journals AN EFFICIENT APPROACH USING RULE INDUCTION AND ASSOCIATION RULE MINING ALGORITHMS IN DATA MINING

2013 ◽  
pp. 14-18
Author(s):  
KAPIL SHARMA ◽  
SHEVETA VASHISHT
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Association Rule Mining ◽  
Research Work ◽  
Rule Induction ◽  
High Rate ◽  
Training Dataset ◽  
Rule Mining ◽  
Data Set ◽  
Fast Processing

In this research work we use rule induction in data mining to obtain the accurate results with fast processing time. We using decision list induction algorithm to make order and unordered list of rules to coverage of maximum data from the data set. Using induction rule via association rule mining we can generate number of rules for training dataset to achieve accurate result with less error rate. We also use induction rule algorithms like confidence static and Shannon entropy to obtain the high rate of accurate results from the large dataset. This can also improves the traditional algorithms with good result.

scholarly journals Data Mining Approach in Retail Knowledge Discovery and Internet Technologies

2018 ◽  
Vol 7 (2) ◽  
pp. 100-105
Author(s):  
Simranjit Kaur ◽  
Seema Baghla
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Association Rule Mining ◽  
Large Data ◽  
Internet Technology ◽  
Categorical Variables ◽  
Data Sets ◽  
Rule Mining ◽  
Data Set ◽  
Demographic Profiles

Online shopping has a shopping channel or purchasing various items through online medium. Data mining is defined as a process used to extract usable data from a larger set of any raw data. The data set extraction from the demographic profiles and Questionnaire to investigate the gathered based by association. The method for shopping was totally changed with the happening to internet Technology. Association rule mining is one of the important problems of data mining has been used here. The goal of the association rule mining is to detect relationships or associations between specific values of categorical variables in large data sets.

scholarly journals Implementation and Evaluation of Rule Induction Algorithm with Association Rule Mining: A study in life insurance

2013 ◽  
Vol 4 (1) ◽  
pp. 135-145
Author(s):  
Kapil Sharma ◽  
Sheveta Vashisht ◽  
Heena Sharma ◽  
Jasreena kaur Bains ◽  
Richa Dhiman
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Association Rule Mining ◽  
Research Work ◽  
Rule Induction ◽  
Research Field ◽  
High Rate ◽  
Training Dataset ◽  
Rule Mining ◽  
Data Set

Data Mining: extracting useful insights from large and detailed collections of data. With the increased possibilities in modern society for companies and institutions to gather data cheaply and efficiently, this subject has become of increasing importance. This interest has inspired a rapidly maturing research field with developments both on a theoretical, as well as on a practical level with the availability of a range of commercial tools. In this research work we use rule induction in data mining to obtain the accurate results with fast processing time. We using decision list induction algorithm to make order and unordered list of rules to coverage of maximum data from the data set. Using induction rule via association rule mining we can generate number of rules for training dataset to achieve accurate result with less error rate. We also use induction rule algorithms like confidence static and Shannon entropy to obtain the high rate of accurate results from the large dataset. This can also improves the traditional algorithms with good result.

Sensitivity Association Rule Mining using Weight based Fuzzy Logic

2017 ◽  
Vol 9 (2) ◽  
pp. 1 ◽  
Author(s):  
Meenakshi Bansal ◽  
Dinesh Grover ◽  
Dhiraj Sharma
Keyword(s):  
Data Mining ◽  
Fuzzy Logic ◽  
Side Effects ◽  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Privacy Preserving ◽  
Experimental Results ◽  
Rule Mining

Mining of sensitive rules is the most important task in data mining. Most of the existing techniques worked on finding sensitive rules based upon the crisp thresh hold value of support and confidence which cause serious side effects to the original database. To avoid these crisp boundaries this paper aims to use WFPPM (Weighted Fuzzy Privacy Preserving Mining) to extract sensitive association rules. WFPPM completely find the sensitive rules by calculating the weights of the rules. At first, we apply FP-Growth to mine association rules from the database. Next, we implement fuzzy to find the sensitive rules among the extracted rules. Experimental results show that the proposed scheme find actual sensitive rules without any modification along with maintaining the quality of the released data as compared to the previous techniques.

scholarly journals Security and privacy concerned association rule mining technique for the accurate frequent pattern identification

2017 ◽  
Vol 7 (1.1) ◽  
pp. 19
Author(s):  
T. Nusrat Jabeen ◽  
M. Chidambaram ◽  
G. Suseendran
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Frequent Pattern ◽  
Security And Privacy ◽  
Sensitive Information ◽  
Simulation Environment ◽  
Rule Mining ◽  
Mining Technique ◽  
Diffie Hellman

Security and privacy has emerged to be a serious concern in which the business professional don’t desire to share their classified transaction data. In the earlier work, secured sharing of transaction databases are carried out. The performance of those methods is enhanced further by bringing in Security and Privacy aware Large Database Association Rule Mining (SPLD-ARM) framework. Now the Improved Secured Association Rule Mining (ISARM) is introduced for the horizontal and vertical segmentation of huge database. Then k-Anonymization methods referred to as suppression and generalization based Anonymization method is employed for privacy guarantee. At last, Diffie-Hellman encryption algorithm is presented in order to safeguard the sensitive information and for the storage service provider to work on encrypted information. The Diffie-Hellman algorithm is utilized for increasing the quality of the system on the overall by the generation of the secured keys and thus the actual data is protected more efficiently. Realization of the newly introduced technique is conducted in the java simulation environment that reveals that the newly introduced technique accomplishes privacy in addition to security.

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 Predicting Anxiety in Routine Palliative Care Using Bayesian-Inspired Association Rule Mining

2021 ◽  
Vol 3 ◽  
Author(s):  
Oliver Haas ◽  
Luis Ignacio Lopera Gonzalez ◽  
Sonja Hofmann ◽  
Christoph Ostgathe ◽  
Andreas Maier ◽  
...  
Keyword(s):  
Palliative Care ◽  
Association Rule ◽  
Association Rule Mining ◽  
Predictive Accuracy ◽  
Characteristic Curve ◽  
Rule Mining ◽  
Data Set ◽  
Routinely Collected Data ◽  
Previous State ◽  
Insight Into

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.

Sign in / Sign up

Export Citation Format

Share Document