scholarly journals Analysis Process MILAR: Mining Indirect Least Association Rule Algorithm

2021 ◽  
pp. 39-45
Author(s):  
Zailani Abdullah ◽  
Aggy Gusman ◽  
Tutut Herawan ◽  
Mustafa Mat Deris
Keyword(s):  
Association Rules ◽  
Association Rule ◽  
Experimental Results ◽  
Common Rule ◽  
Domain Experts ◽  
Meaningful Information ◽  
Analysis Process ◽  
The Common ◽  
Indirect Association ◽  
New Perspective

One of the interesting and meaningful information that is hiding in transactional database is indirect association rule. It corresponds to the property of high dependencies between two items that are rarely occurred together but indirectly emerged via another items. Since indirect association rule is nontrivial information, it can implicitly give a new perspective of relationship which cannot be directly observed from the common rule. Therefore, we proposed an algorithm for Mining Indirect Least Association Rule (MILAR) from the real and benchmarked datasets. MILAR is embedded with our scalable least measure namely Critical Relative Support (CRS). The experimental results show that MILAR can generate the desired rules in term of least and indirect least association rules. In addition, the obtained results can also be used by the domain experts to do further analysis and finally reveal more interesting findings

Semi-Automatic Ontology Construction by Exploiting Functional Dependencies and Association Rules

Semantic Web ◽  
2013 ◽  
pp. 76-96
Author(s):  
Luca Cagliero ◽  
Tania Cerquitelli ◽  
Paolo Garza
Keyword(s):  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Description Logic ◽  
Functional Dependency ◽  
Functional Dependencies ◽  
Rule Mining ◽  
Domain Experts ◽  
Data Schema ◽  
Input Dataset

This paper presents a novel semi-automatic approach to construct conceptual ontologies over structured data by exploiting both the schema and content of the input dataset. It effectively combines two well-founded database and data mining techniques, i.e., functional dependency discovery and association rule mining, to support domain experts in the construction of meaningful ontologies, tailored to the analyzed data, by using Description Logic (DL). To this aim, functional dependencies are first discovered to highlight valuable conceptual relationships among attributes of the data schema (i.e., among concepts). The set of discovered correlations effectively support analysts in the assertion of the Tbox ontological statements (i.e., the statements involving shared data conceptualizations and their relationships). Then, the analyst-validated dependencies are exploited to drive the association rule mining process. Association rules represent relevant and hidden correlations among data content and they are used to provide valuable knowledge at the instance level. The pushing of functional dependency constraints into the rule mining process allows analysts to look into and exploit only the most significant data item recurrences in the assertion of the Abox ontological statements (i.e., the statements involving concept instances and their relationships).

An Approach to the Mining of User Focused Frequent Itemsets Based on Attention

2014 ◽  
Vol 536-537 ◽  
pp. 520-523
Author(s):  
Jia Liu ◽  
Zhen Ya Zhang ◽  
Hong Mei Cheng ◽  
Qian Sheng Fang
Keyword(s):  
Association Rules ◽  
Association Rule ◽  
Frequent Itemsets ◽  
Selection Model ◽  
Experimental Results ◽  
Apriori Algorithm ◽  
Mining Method ◽  
Information Filter ◽  
Frequent Itemsets Mining ◽  
Log File

Usually, non trivial network visiting behaviors implied in network visiting log can be treated as the frequent itemsets or association rules if data in networking log file are transformed into transaction and technologies on association rule can be used to mine those frequent itemsets which are focused by user or some application. To mine non trivial behaviors of network visiting effectively, an attention based frequent itemsets mining method is proposed in this paper. In our proposed method, properties of users focusing is described as attention set and the early selection model of attention as information filter is referenced in the design of our method. Experimental results show that our proposed method is faster than apriori algorithm on the mining of frequent itemsets which is focused by our attention.

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.

Interestingness Measures for Association Rules

2008 ◽  
pp. 36-58
Author(s):  
Yun Sing Koh ◽  
Richard O’Keefe ◽  
Nathan Rountree
Keyword(s):  
Experimental Study ◽  
Selection Bias ◽  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Information Gain ◽  
Experimental Results ◽  
Rule Mining ◽  
Interestingness Measures

Association rules are patterns that offer useful information on dependencies that exist between the sets of items. Current association rule mining techniques such as apriori often extract a very large number of rules. To make sense of these rules we need to order or group the rules in some fashion such that the useful patterns are highlighted. The study of this process involves the investigation of an “interestingness” in the rules. To date, various measures have been proposed but unfortunately, these measures present inconsistent information about the interestingness of a rule. In this chapter, we show that different metrics try to capture different dependencies among variables. Each measure has its own selection bias that justifies the rationale for preferring it compared to other measures. We present an experimental study of the behaviour of the interestingness measures such as lift, rule interest, Laplace, and information gain. Our experimental results verify that many of these measures are very similar in nature. From the findings, we introduce a classification of the current interestingness measures.

Application of Association Rule in Students’ Results in University

2011 ◽  
Vol 181-182 ◽  
pp. 172-176
Author(s):  
Li Juan Zhou ◽  
Shuang Li ◽  
Tong Liu
Keyword(s):  
College Students ◽  
Association Rules ◽  
Association Rule ◽  
Data Preprocessing ◽  
Data Transformation ◽  
Experimental Results ◽  
Apriori Algorithm ◽  
Potential Association ◽  
Classification Category

With the improved Apriori algorithm mine the potential association rules among courses from a large number of college students’ results. First is data preprocessing, which includes course options, students (transaction) options, results classification, category statistics and Data transformation. Then carry the experiment and analyze the experimental results in detail. At last, get association rule guiding to further teaching.

scholarly journals Binary Particle Swarm Optimization-Based Association Rule Mining for Discovering Relationships between Machine Capabilities and Product Features

2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Zhicong Kou ◽  
Lifeng Xi
Keyword(s):  
Particle Swarm Optimization ◽  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Particle Swarm ◽  
Performance Comparison ◽  
Binary Particle Swarm Optimization ◽  
Rule Mining ◽  
Swarm Optimization ◽  
Product Features

An effective data mining method to automatically extract association rules between manufacturing capabilities and product features from the available historical data is essential for an efficient and cost-effective product development and production. This paper proposes a new binary particle swarm optimization- (BPSO-) based association rule mining (BPSO-ARM) method for discovering the hidden relationships between machine capabilities and product features. In particular, BPSO-ARM does not need to predefine thresholds of minimum support and confidence, which improves its applicability in real-world industrial cases. Moreover, a novel overlapping measure indication is further proposed to eliminate those lower quality rules to further improve the applicability of BPSO-ARM. The effectiveness of BPSO-ARM is demonstrated on a benchmark case and an industrial case about the automotive part manufacturing. The performance comparison indicates that BPSO-ARM outperforms other regular methods (e.g., Apriori) for ARM. The experimental results indicate that BPSO-ARM is capable of discovering important association rules between machine capabilities and product features. This will help support planners and engineers for the new product design and manufacturing.

Fast Algorithms for Temporal Association Rules in a Large Database

2005 ◽  
Vol 277-279 ◽  
pp. 287-292 ◽  
Author(s):  
Lu Na Byon ◽  
Jeong Hye Han
Keyword(s):  
Electronic Commerce ◽  
Association Rules ◽  
Association Rule ◽  
Temporal Association ◽  
Large Database ◽  
Running Time ◽  
Smoothing Filter ◽  
Personalized Services ◽  
Temporal Association Rule ◽  
Transaction Database

As electronic commerce progresses, temporal association rules are developed by time to offer personalized services for customer’s interests. In this article, we propose a temporal association rule and its discovering algorithm with exponential smoothing filter in a large transaction database. Through experimental results, we confirmed that this is more precise and consumes a shorter running time than existing temporal association rules.

Sign in / Sign up

Export Citation Format

Share Document