Extracting of Positive and Negative Association Rules

2018 ◽  
Vol 6 (8) ◽  
pp. 421
Author(s):  
D. Gandhimathi ◽  
N. Anbazhagan
Keyword(s):  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Positive Association ◽  
Current Data ◽  
Negative Association ◽  
Rule Mining ◽  
Web Usage ◽  
Log Structure ◽  
Negative Association Rules

Association rules analysis is a basic technique to expose how items/patterns are associated to each other. There are two common ways to measure association such as Support and Confidence. Several methods have been proposed in the literature to diminish the number of extracted association rules. Association Rule Mining is one of the greatest current data mining techniques designed to group objects together from huge databases aiming to take out the motivating correlation and relation with massive quantity of data. Association rule mining is used to discover the associated patterns from datasets. In this paper, we propose association rules from new methods on web usage mining. Generally, web usage log structure has several records so we have to overcome those unwanted records from large dataset. First of all the pre-processed data from the NASA dataset is clustered by the popular K-Means algorithm. Subsequently, the matrix calculation is progressed on that data. Further, the associations are performed on filtered data and get rid of the final associated page results. Positive and negative association rules are gathered by using new algorithm with Annul Object (𝒜𝒪). Wherever the object “𝒜𝒪” is presented those rules are known as negative association rule.  Otherwise, the rules are positive association rules.

An Algorithm for Mining Multidimensional Positive and Negative Association Rules

2010 ◽  
Vol 171-172 ◽  
pp. 445-449 ◽  
Author(s):  
He Jiang ◽  
Ze Bai ◽  
Guo Ling Liu ◽  
Xiu Mei Luan
Keyword(s):  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Positive Association ◽  
Negative Association ◽  
Multidimensional Data ◽  
Rule Mining ◽  
Multidimensional Datasets ◽  
Single Positive ◽  
Negative Association Rules

Research on negative association rule in multidimensional data mining is few. In this paper, an algorithm MPNAR is put forward to mine positive and negative association rules in multidimensional data. With the help of the basis of the minimum support and minimum confidence, this algorithm divided the multidimensional datasets into infrequent itemsets and frequent itemsets. The negative association rules could be mined from infrequent itemsets. Relative to the single positive association rule mining, the new additional negative association rules need not repeatedly read database because two types of association rules were simultaneously mined. Experiments show that the algorithm method is effective and valuable.

scholarly journals Negative and Positive Association Rules Mining from Text Using Frequent and Infrequent Itemsets

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Sajid Mahmood ◽  
Muhammad Shahbaz ◽  
Aziz Guergachi
Keyword(s):  
Association Rules ◽  
Association Rule ◽  
Negative Symptoms ◽  
Medical Science ◽  
Positive Association ◽  
Negative Association ◽  
Rule Mining ◽  
Huge Number ◽  
Significant Research ◽  
Negative Association Rules

Association rule mining research typically focuses on positive association rules (PARs), generated from frequently occurring itemsets. However, in recent years, there has been a significant research focused on finding interesting infrequent itemsets leading to the discovery of negative association rules (NARs). The discovery of infrequent itemsets is far more difficult than their counterparts, that is, frequent itemsets. These problems include infrequent itemsets discovery and generation of accurate NARs, and their huge number as compared with positive association rules. In medical science, for example, one is interested in factors which can either adjudicate the presence of a disease or write-off of its possibility. The vivid positive symptoms are often obvious; however, negative symptoms are subtler and more difficult to recognize and diagnose. In this paper, we propose an algorithm for discovering positive and negative association rules among frequent and infrequent itemsets. We identify associations among medications, symptoms, and laboratory results using state-of-the-art data mining technology.

Analysis of Students Health Based on Association Rules

2012 ◽  
Vol 198-199 ◽  
pp. 562-566
Author(s):  
Li Wang ◽  
Ai Jing Li
Keyword(s):  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Health Condition ◽  
University Student ◽  
National Standard ◽  
Rule Mining ◽  
Testing Data ◽  
Negative Association Rules ◽  
Academic Year

Association rule mining is one of the most important techniques in data mining. According to the national standard of students’ health, the health condition of university student should be tested once every academic year. So a lot of testing data have been recorded in our university. This paper analyzes these data of freshman students by positive and negative association rules and finds lots interesting results. By analyzing these results, some suggestions are proposed to improve the students’ health condition, including targeted physical education teaching, establish a supervising system, and do exercises on own initiative.

Discovering Both Positive and Negative Fuzzy Association Rules in Large Transaction Databases

2006 ◽  
Vol 10 (3) ◽  
pp. 287-294 ◽  
Author(s):  
Jianchao Han ◽  
◽  
Mohsen Beheshti
Keyword(s):  
Knowledge Discovery ◽  
Association Rules ◽  
Association Rule ◽  
Positive Association ◽  
Negative Association ◽  
Fuzzy Association Rules ◽  
Novel Approach ◽  
Negative Association Rules ◽  
Fuzzy Association Rule ◽  
Mining Algorithms

Mining association rules is an important task of dara mining and knowledge discovery. Traditional association rules mining is built on transaction databases, which has some limitations. Two of these limitations are 1) each transaction merely contains binary items, meaning that an item either occurs in a transaction or not; 2) only positive association rules are discovered, while negative associations are ignored. Mining fuzzy association rules has been proposed to address the first limitation, while mining algorithms for negative association rules have been developed to resolve the second limitation. In this paper, we combine these two approaches to propose a novel approach for mining both positive and negative fuzzy association rules. The interestingness measure for both positive and negative fuzzy association rule is proposed, the algorithm for mining these rules is described, and an illustrative example is presented to demonstrate how the measure and the algorithm work.

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.

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).

A Novel Approach on Negative Association Rules

2011 ◽  
pp. 1425-1430
Author(s):  
Ioannis N. Kouris
Keyword(s):  
Association Rules ◽  
Positive Association ◽  
Negative Influence ◽  
Negative Association ◽  
Association Rules Mining ◽  
Novel Approach ◽  
Negative Effect ◽  
Negative Association Rules ◽  
The Subject ◽  
Definition Of

Research in association rules mining has initially concentrated in solving the obvious problem of finding positive association rules; that is rules among items that exist in the stored transactions. It was only several years after that the possibility of finding also negative association rules became especially appealing and was investigated. Nevertheless researchers based their assumptions regarding negative association rules on the absence of items from transactions. This assumption though besides being dubious, since it equated the absence of an item with a conflict or negative effect on the rest items, it also brought out a series of computational problems with the amount of possible patterns that had to be examined and analyzed. In this work we give an overview of the works having engaged with the subject until now and present a novel view for the definition of negative influence among items.

Constraint-Based Association Rule Mining

2011 ◽  
pp. 307-312 ◽  
Author(s):  
Carson Kai-Sang Leung
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Computational Cost ◽  
Knowledge Discovery In Databases ◽  
Rule Mining ◽  
The Subject ◽  
User Focus ◽  
High Computational Cost

The problem of association rule mining was introduced in 1993 (Agrawal et al., 1993). Since then, it has been the subject of numerous studies. Most of these studies focused on either performance issues or functionality issues. The former considered how to compute association rules efficiently, whereas the latter considered what kinds of rules to compute. Examples of the former include the Apriori-based mining framework (Agrawal & Srikant, 1994), its performance enhancements (Park et al., 1997; Leung et al., 2002), and the tree-based mining framework (Han et al., 2000); examples of the latter include extensions of the initial notion of association rules to other rules such as dependence rules (Silverstein et al., 1998) and ratio rules (Korn et al., 1998). In general, most of these studies basically considered the data mining exercise in isolation. They did not explore how data mining can interact with the human user, which is a key component in the broader picture of knowledge discovery in databases. Hence, they provided little or no support for user focus. Consequently, the user usually needs to wait for a long period of time to get numerous association rules, out of which only a small fraction may be interesting to the user. In other words, the user often incurs a high computational cost that is disproportionate to what he wants to get. This calls for constraint-based association rule mining.

Association Rule and Quantitative Association Rule Mining among Infrequent Items

2010 ◽  
pp. 15-32 ◽  
Author(s):  
Ling Zhou ◽  
Stephen Yau
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Rule Mining ◽  
Transactional Databases ◽  
Frequent Items ◽  
Increasing Demand ◽  
Quantitative Association Rule

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.

Association Rule Mining in Collaborative Filtering

2017 ◽  
pp. 159-179 ◽  
Author(s):  
Carson K.-S. Leung ◽  
Fan Jiang ◽  
Edson M. Dela Cruz ◽  
Vijay Sekar Elango
Keyword(s):  
Data Mining ◽  
Collaborative Filtering ◽  
Association Rules ◽  
Data Structures ◽  
Association Rule ◽  
Association Rule Mining ◽  
Real Life ◽  
Frequent Patterns ◽  
Rule Mining ◽  
Association Rule Miner

Collaborative filtering uses data mining and analysis to develop a system that helps users make appropriate decisions in real-life applications by removing redundant information and providing valuable to information users. Data mining aims to extract from data the implicit, previously unknown and potentially useful information such as association rules that reveals relationships between frequently co-occurring patterns in antecedent and consequent parts of association rules. This chapter presents an algorithm called CF-Miner for collaborative filtering with association rule miner. The CF-Miner algorithm first constructs bitwise data structures to capture important contents in the data. It then finds frequent patterns from the bitwise structures. Based on the mined frequent patterns, the algorithm forms association rules. Finally, the algorithm ranks the mined association rules to recommend appropriate merchandise products, goods or services to users. Evaluation results show the effectiveness of CF-Miner in using association rule mining in collaborative filtering.

Sign in / Sign up

Export Citation Format

Share Document