PPCI Algorithm for Mining Temporal Association Rules in Large Databases

2009 ◽  
Vol 08 (04) ◽  
pp. 345-352 ◽  
Author(s):  
Anjana Pandey ◽  
K. R. Pardasani
Keyword(s):  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Temporal Association ◽  
Temporal Database ◽  
Inference Method ◽  
Rule Mining ◽  
Individual Item ◽  
Large Databases ◽  
Order Of Magnitude

In this paper an attempt has been made to develop a progressive partitioning and counting inference approach for mining association rules in temporal databases. A temporal database like a sales database is a set of transactions where each transaction T is a set of items in which each item contains an individual exhibition period. The existing models of association rule mining have problems in handling transactions due to a lack of consideration of the exhibition period of each individual item and lack of an equitable support counting basis for each item. As a remedy to this problem we propose an innovative algorithm PPCI that combines progressive partition approach with counting inference method to discover association rules in a temporal database. The basic idea of PPCI is to first segment the database into sub-databases in such a way that items in each sub-database will have either a common starting time or a common ending time. Then for each sub-database, PPCI progressively filters 1-itemset with a cumulative filtering threshold based on vital partitioning characteristics. Algorithm PPCI is also designed to employ a filtering threshold in each partition to prune out those cumulatively infrequent 1-itemsets early and it also uses counting inference approach to minimise as much as possible the number of pattern support counts performed when extracting frequent patterns. Explicitly the execution time of PPCI in order of magnitude is smaller than those required by the schemes which are directly extended from existing methods.

scholarly journals Privacy preserving association rule hiding using border based approach

2021 ◽  
Vol 23 (2) ◽  
pp. 1137
Author(s):  
Suma B. ◽  
Shobha G.
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Sensitive Information ◽  
Rule Mining ◽  
Data Mining Technique ◽  
Large Databases ◽  
Hidden Correlations ◽  
Rule Set

<div>Association rule mining is a well-known data mining technique used for extracting hidden correlations between data items in large databases. In the majority of the situations, data mining results contain sensitive information about individuals and publishing such data will violate individual secrecy. The challenge of association rule mining is to preserve the confidentiality of sensitive rules when releasing the database to external parties. The association rule hiding technique conceals the knowledge extracted by the sensitive association rules by modifying the database. In this paper, we introduce a border-based algorithm for hiding sensitive association rules. The main purpose of this approach is to conceal the sensitive rule set while maintaining the utility of the database and association rule mining results at the highest level. The performance of the algorithm in terms of the side effects is demonstrated using experiments conducted on two real datasets. The results show that the information loss is minimized without sacrificing the accuracy. </div>

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

2019 ◽  
Vol 9 (1) ◽  
pp. 6982-6987
Keyword(s):  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
The Other ◽  
Apriori Algorithm ◽  
Rule Mining ◽  
Large Databases ◽  
Algorithm Comparison ◽  
Average Confidence ◽  
Mining Algorithms

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.

Modified Ranking With Temporal Association Rule Mining in Supply Chains

2020 ◽  
Vol 11 (4) ◽  
pp. 58-71
Author(s):  
Reshu Agarwal
Keyword(s):  
Inventory Management ◽  
Association Rule ◽  
Association Rule Mining ◽  
Temporal Association ◽  
Rule Mining ◽  
Individual Item ◽  
Data Set ◽  
Abc Classification ◽  
Temporal Association Rule ◽  
Time Periods

This article deals with data mining applications for the supply chain inventory management. ABC classification is usually used for inventory items classification because the number of inventory items is so large that it is not computationally feasible to set stock and service control guidelines for each individual item. Moreover, in ABC classification, the inter-relationship between items is not considered. But practically, the sale of one item could affect the sale of other items (cross selling effect). Hence, within time-periods, the inventories should be classified. In this article, a modified approach is proposed considering both time-periods and cross-selling effect to rank inventory items. A numerical example and an empirical study with a data set are used to evaluate the proposed approach. It is illustrated that by using this modified approach, the ranking of items may get affected resulting in higher profit.

scholarly journals Analysis of the progressive sampling-based approach using real life datasets

2011 ◽  
Vol 1 (2) ◽  
Author(s):  
Venkatapathy Umarani ◽  
Muthusamy Punithavalli
Keyword(s):  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Real Life ◽  
Computation Time ◽  
Frequent Itemsets ◽  
Rule Mining ◽  
Large Databases ◽  
Very Large Databases ◽  
Progressive Sampling

AbstractThe discovery of association rules is an important and challenging data mining task. Most of the existing algorithms for finding association rules require multiple passes over the entire database, and I/O overhead incurred is extremely high for very large databases. An obvious approach to reduce the complexity of association rule mining is sampling. In recent times, several sampling-based approaches have been developed for speeding up the process of association rule mining. A proficient progressive sampling-based approach is presented for mining association rules from large databases. At first, frequent itemsets are mined from an initial sample and subsequently, the negative border is computed from the mined frequent itemsets. Based on the support computed for the midpoint itemset in the sorted negative border, the sample size is either increased or association rules are mined from it. In this paper, we have presented an extensive analysis of the progressive sampling-based approach with different real life datasets and, in addition, the performance of the approach is evaluated with the well-known association rule mining algorithm, Apriori. The experimental results show that accuracy and computation time of the progressive sampling-based approach is effectively improved in mining of association rules from the real life datasets.

Loss Profit Estimation Using Temporal Association Rule Mining

2016 ◽  
Vol 3 (1) ◽  
pp. 45-57 ◽  
Author(s):  
Reshu Agarwal ◽  
Mandeep Mittal ◽  
Sarla Pareek
Keyword(s):  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Temporal Association ◽  
Timing Constraints ◽  
Rule Mining ◽  
Data Mining Technique ◽  
Temporal Association Rule ◽  
Frequent Items

Temporal association rule mining is a data mining technique in which relationships between items which satisfy certain timing constraints can be discovered. This paper presents the concept of temporal association rules in order to solve the problem of classification of inventories by including time expressions into association rules. Firstly, loss profit of frequent items is calculated by using temporal association rule mining algorithm. Then, the frequent items in particular time-periods are ranked according to descending order of loss profits. The manager can easily recognize most profitable items with the help of ranking found in the paper. An example is illustrated to validate the results.

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

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.

Sign in / Sign up

Export Citation Format

Share Document