An incremental updating technique for mining indirect association rules

Association rule mining (ARM) is one of the most important and well researched area in data mining. Indirect association rule, a part of ARM, provides a different perspective in identifying the most useful infrequent patterns. Specifically, it refers to the property of high dependencies between two items that are rarely appeared together but indirectly occurred through another items. Besides generating nontrivial information, it also can implicitly reveal a new fact of relationship which cannot be directly determined using the typical interestingness measures. Therefore, in this paper we applied our novel algorithm called Mining Lease Association Rule (MILAR) and our measure called Critical Relative Support (CRS) to mine the indirect least association rule from the students' examination datasets. The experimental results show that the numbers of extracted indirect association rules are reduced when the threshold value of CRS is increased. This number is also lesser than the least association rule. In addition of decreasing the number of uninteresting rules, the obtained information also can be used by educators as a basis to improve their teaching and learning strategies in the future.

Association rule is an important research topic in data mining and knowledge discovery. Traditional algorithms for mining association rules are built on the binary attributes databases, which has three limitations. Firstly, it can not concern quantitative attributes; secondly, it treats each item with the same significance although different item may have different significance; thirdly, only the direct association rules are discovered. Mining fuzzy association rules has been proposed to address the first limitation. In this paper, we put forward an idea for mining indirect weighted association rules to resolve the other two limitations, and a discovery algorithm for mining both direct and indirect weighted fuzzy association rules by integrating these three extensions.

SufRec, an algorithm for mining association rules: Recursivity and task parallelism

A central part of many algorithms for mining association rules in large data sets is a procedure that finds so called frequent itemsets. This paper proposes a new approach to finding frequent itemsets. The approach reduces a number of passes through an input data set and generalises a number of strategies proposed so far. The idea is to analyse a variable number n of itemset lattice levels in p scans through an input data set. It is shown that for certain values of parameters (n,p) this method provides more flexible utilisation of fast access transient memory and faster elimination of itemsets with low support factor. The paper presents the results of experiments conducted to find how the performance of the association rule mining algorithm depends on the values of parameters (n,p).

As an efficient data analysis tool, data mining can discover the potential association and regularity of massive data, and it has been widely used and played an important role in business decision, medical research and so on. However, the data mining technology is also a double-edged sword, in bringing convenience at the same time, will also cause the user’s privacy leak problem. In order to solve the problem, the symmetric searchable encryption technology is introduced into the association rule mining system to protect the privacy, and privacy preserving mining system of s (PP-MSAR) in OpenStack-based Cloud environment is designed. In order to solve the problem that the existing data mining algorithms can’t deal with large-scale data, this paper uses the computational power of Hadoop platform and add the global pruning technique to the existing algorithm based on MapReduce association rules, so that the counting of frequent item sets get reduced. At the same time, this paper add frequent matrix storage method into the distributed association rules algorithm and realize he algorithm of mining association rules for frequent matrix storage based on MapReduce. In addition, the introduction of symmetric searchable encryption technology to support the cloud server-side ciphertext retrieval, on the one hand to ensure that users stored in the database information will not be leaked to the outside for others, on the other hand also to ensure that the user data for the system staff confidential. Finally, we test the system, and the results show that the system can carry out association rules mining under the premise of protecting user privacy, and provide the correlation degree between data, which has certain practical significance and application value.

This paper shows a mathematical foundation for almost important features in the problem of discovering knowledge by association rules. The class of frequent itemsets and the association rule set are partitioned into disjoint classes by two equivalence relations based on closures. Thanks to these partitions, efficient parallel algorithms for mining frequent itemsets and association rules can be obtained. Practically, one can mine frequent itemsets as well as association rules just in the classes that users take care of. Then, we obtain structures of each rule class using corresponding order relations. For a given relation, each rule class splits into two subsets of basic and consequence. The basic one contains minimal rules and the consequence one includes in the rules that can be deducted from those minimal rules. In the rest, we consider association rule mining based on order relation min. The explicit form of minimal rules according to that relation is shown. Due to unique representations of frequent itemsets through their generators and corresponding eliminable itemsets, operators for deducting all remaining rules are also suggested. Experimental results show that mining association rules based on relation min is better than the ones based on relations of minmin and minMax in terms of reduction in mining times as well as number of basic rules.

To reduce invalid rules in the mining of association rules, we have analyzed the reasons and presented a relative confidence in the judgment criteria. Based on the value of relative confidence, we classify strong association rules into positive, invalid and negative association rules. We offer an algorithm of mining association rules with new judgment criterion and make tests with Visual FoxPro. The tests indicate that the new method stated in this paper can obviously reduce invalid association rules.

Association rules mining is an important research topic in data mining and knowledge discovery. Traditional algorithms for mining association rules are built on the binary attributes databases, which has three limitations. Firstly, it can not concern quantitative attributes; secondly, only the positive association rules are discovered; thirdly, it treat each item with the same frequency although different item may have different frequency. In this paper, we put forward a discovery algorithm for mining positive and negative fuzzy association rules to resolve these three limitations.

Discovery of association rules is one of the most important tasks in data mining. Many efficient algorithms have been proposed in the literature. In this paper, a method of dataset-partitioning using conceptual hierarchy and a variable precision rough set model is presented. An algorithm for mining association rules using this technique is designed, and an asynchronous algorithm is proposed, too. The efficiency of the algorithm and the factors that affect the efficiency of the algorithm are analyzed by mining association rules in a dataset artificially generated. The result of an experiment proves the efficiency of the algorithm.

Some problems of mining association rules with linguistic terms are discussed. First, an incremental updating algorithm of association rules with linguistic terms is presented. The collection of frequent linguistic attribute sets and its negative border along with their support count are maintained, which makes scan the entire database once at most in the process of updating association rules. The experiment shows that the updating algorithm can not only update association rules effectively but also avoid the repeated cost. Secondly, the parallel algorithm for mining association rules with linguistic terms is presented. The Boolean parallel mining algorithm is improved to discover frequent linguistic attribute sets, and the association rules with at least confidence are generated on all processors. This parallel mining algorithm has fine scale-up, size-up and speed-up.

In recent years, the data mining technology has been developed rapidly. New efficient algorithms are emerging. Association data mining plays an important role in data mining, and the frequent item sets are the highest and the most costly. This paper is based on the association rules data mining technology. The advantages and disadvantages of Apriori algorithm and FP-growth algorithm are deeply analyzed in the association rules, and a new algorithm is proposed, finally, the performance of the algorithm is compared with the experimental results. It provides a reference for the extension and improvement of the algorithm of association rule mining.

In order to solve these problems how to easily generate candidate frequent item sets and fast compute support of candidate item sets, an algorithm of association rules mining based on binary has been introduced. However, one presented binary mining algorithm is only suitable for mining some relative short frequent item sets since the way of generating candidate item sets is also similar to Apriori, another is only suitable for mining long frequent item sets, which generates candidate item sets by up-down search strategy. And so aiming to mining general frequent item sets, this paper proposes an algorithm of association rules double search mining based on binary, which is different from tradition association rules mining algorithm based on double search strategy. The algorithm doesn’t use combination of set theory to generate candidate item sets but binary logic operation that is also used to compute support of candidate item sets, which can use character digital to reduce the number of scanned transaction. The algorithm gets rid of shortage about some presented algorithms based on binary. The experiment based on above three algorithms indicates that the efficiency about double search strategy is fast and efficient when mining general frequent item sets which aren’t confined.

Association rules mining is an important research topic in data mining and knowledge discovery. Traditional algorithms for mining association rules are built on the binary attributes databases, which has three limitations. Firstly, it cannot concern quantitative attributes; secondly, only the positive association rules are discovered; thirdly, it treat each item with the same significance although different item may have different significance. In this paper, we put forward a discovery algorithm for mining positive and negative fuzzy weighted association rules to resolve these three limitations.

The significance of this research lies in the application of data mining techniques to analyze badminton competitions, allowing for the identification of players’ tactics, strategies, and weaknesses. By uncovering these insights, targeted training and improvement plans can be developed, enhancing player performance and optimizing competitive outcomes. Association rules in data mining techniques are used, and the Apriori algorithm in association rules is analyzed and improved. The ACARMI algorithm (an improved algorithm of constrained association rule mining based on item) is then applied. Then, data from six top badminton competitions is collected and converted into Boolean data suitable for this algorithm. A data mining module is designed to mine the tactical association rules of all players, and a specific analysis is conducted on one of the players, successfully analyzing their tactical strategies. Finally, to verify the effectiveness of the algorithm proposed in this article, FP-Growth algorithm and DHP algorithm are applied to comparative experiments. The experiment shows that compared with the FP-Growth algorithm, the initial and final running times of the algorithm in this article with minimum support and different constraint numbers are around “355 ms and 75 ms,” “150 ms and 45 ms,” respectively; similarly, compared with the DHP algorithm, they are around “165 ms and 35 ms,” “175 ms and 55 ms,” respectively. Under two sets of experiments, the algorithm proposed in this article presents better operational efficiency. This article demonstrates that the use of data mining techniques can provide effective tactical optimization, opponent research, real-time decision support, and long-term development planning assistance for athletes and coaches.

MODENAR: Multi-objective differential evolution algorithm for mining numeric association rules