GDAssister: Graphic Design Assistant System with Optimal Algorithm of Associated Rule Mining

With the digitalization and intellectualization of substations, the amount of state data collected by intelligent components is becoming larger and larger. Traditional data mining technology cannot meet the requirements of real-time data processing and application speed. For a typical smart substation, a fault diagnosis method based on improved association rule mining algorithm is proposed for transformer near-zone fault analysis. Firstly, an improved association rule data mining algorithm based on rough set is designed to extract information from massive data and diagnose faults. Then genetic algorithm is applied to improve association rule data mining algorithm to speed up data processing. Finally, simulation analysis is carried out to demonstrate the effectiveness and rapidity of the proposed method. The results show that the intelligent substation fault diagnosis method based on improved association rule mining algorithm has fast and powerful reduction ability in data processing. It can extract useful data from intelligent substation components to accurately judge fault information, reduce data scale and improve fault processing speed.

Geographic object flow is the reason behind the relationship of geographic units. There are interactions in the process of dynamic change of a geographic object flow, and its regularity, which can reflect the relationship or pattern of geographic units in a region. In this paper, an association rule mining method for the geographic object flow linkage process is studied from a geoeconomics perspective. Additionally, an association rule mining algorithm with hierarchical constraints is proposed. Data segmentation is performed according to the time series characteristics of geographic object flow data. The basic attributes for the association rule mining are determined based on the basic parameters of geographic object flows, and a database for the association rule mining is formed according to the characteristics of the hierarchical structure of the geographic object flows. Based on the obtained data, the association rule mining algorithm with hierarchical constraints obtained using a parent–child matrix is improved by adding the Apriori algorithm. With the Indo-Pacific region as an example, the trade flow association rules for 25 countries in the region from 2010 to 2021 are selected. In addition, a mathematical statistical analysis of the strongly associated mined trade flows and geoeconomic factors is conducted in terms of both a basic feature analysis of trade flow associations and a country-oriented trade flow association analysis by considering domain knowledge. The effectiveness of the method has been evaluated from various perspectives such as correlation analysis, mathematical statistics, and comparison with the findings of existing studies and proved the validity of the method.

Association rule mining (ARM) is well-known issue in data mining. It is a combinatorial optimization problem purpose to extract the correlations between items in sizable data-sets. According to the literature study, bio-inspired prove their efficiency in term of time, memory and quality of generated rules. This paper investigates multi-population cooperative version of bat algorithm for association rule mining (BAT-ARM) named MPB-ARM which is based on bat inspired algorithm. The advantage of bat algorithm is the power combination between population-based algorithm and the local search, however, it more powerful in local search. The main factor to judge optimization algorithms is ensuring the interaction between global diverse exploration and local intensive exploitation. To maintain the diversity of bats, in our proposed approach, we introduce a cooperative master-slave strategy between the subpopulations. The experimental results shows that our proposal outperforms other bio-inspired algorithms already exist and cited in the literature including our previous work BAT-ARM.

To come over the limitations of Apriori algorithm and association rule mining algorithm based on Genetic Algorithm (GA), this paper proposed a new association rule mining algorithm based on the population-based incremental algorithm (PBIL), which is a kind of distribution estimation algorithms. The proposed association rule-mining algorithm keeps the advantages of GA mining association rules in coding and the fitness function. Through using probability vector possessing learning properties to update the population, the algorithm increases the convergence speed and enhances the searching ability, compared to GA. In the experiment of mining association, rules in blood indices data, PBIL algorithm performs better not only in running time, convergence speed, but also achieve better searching results. Meanwhile, this paper proposed a parallel algorithm for association rule mining based on PBIL and designed a system architecture based on cloud computing for blood indices analysis, providing a good example to apply the new algorithm to cloud computing.

In this paper, an application method of association rule mining algorithm based on 5G technology in information management system is proposed to solve the problems of long running time and low processing efficiency in traditional financial information processing system. The association rule mining algorithm's employment in information management systems is the main topic of this research study, which is based on 5G technology. The efficiency and efficacy of information management systems have a lot of room to grow with the introduction of 5G. Large datasets may be mined for patterns and associations using the potent approach known as association rule mining. We want to improve the performance of information management systems by fusing association rule mining with the capabilities of 5G technology. The experimental findings indicate that in the first group of trials, the traditional system’s time for information mining is identical to that of the developed system, which is around one minute. The typical system's time to mine financial information, however, steadily grows with the amount of experimental data. The difference between the two is most obvious in the sixth experiment. Because the design system can delve deeply into the financial information, the overall information mining time of the financial information management system based on the association rule mining algorithm of the design is shorter. It is confirmed that the system for automatically processing financial information described in this study has a high level of processing accuracy and a positive processing outcome.

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.

The issues in the field of association rules mining with specific items are discussed first. To solve the problems in the ordinary algorithm, we put forward a new but efficient mining algorithm with item-constraints, called EclatII. We then give an analysis on the performance of the algorithm as well as on its strategy. The experimental result shows that the Eclatll algorithm is more robust in items of using "low support'"' and "long pattern" association rules than others.

A novel software defect prediction approach via weighted classification based on association rule mining

Big data has become one of the key sources for valuable information and as information becomes larger it poses some computational challenge in finding a best possible solution for mining association rules and discovering patterns in data. Meta-heuristic algorithm when applied to mining association rules aims to find best possible rules from data without being stuck in local optimal. Example of meta-heuristics algorithm includes genetic algorithm and particle swarm optimization algorithm. Finding appropriate representation of various types of patterns using rough numerical values attributes is still a challenge because most association rules cannot be applied to numerical data without discretization which may lead to information loss. Mining numeric association rules is a hard optimization problem rather than being a discretization, thus, this paper proposes a new meta-heuristic algorithm which uses wolf search algorithm (WSA) for numeric association rule mining from rough values within tolerable ranges.

Incremental sequential patterns for multivariate temporal association rules mining

Big data has several applications like page bank algorithm, recommendation system, sentimental analysis, and many more. Recommendation is the key to success for discovering and retrieval of content in this era of huge data [1]. Association Rule Mining (ARM) algorithm is mostly used for recommendation systems. User behaviour is given input to ARM in key/value pair format which can be generated by Map-Reduce function [2]. ARM attempts to find frequent item sets among large datasets and describes the association relationships among different attributes. Market-Basket analysis is the major application of ARM used to predict customer's purchasing behaviour and recommend product to customer [3]. For implementing this recommendation systems there are several programming languages and scala is one among them which is an object oriented and also supports functional programming [4]. For processing large amount of data, functional programming is faster and easier, but in some cases we need to provide security for sensitive data. Also scala runs on Java Virtual Machine (JVM) and also scala can execute Java code since scala code is converted to Java Byte code when compiled. So scala will have a better advantage to implement big data applications.

Coronary Heart Disease (CHD) is a ordinary cardiovascular disease which does gravely harm to humans' health. It belongs to the category of chest stuffiness and pains on usual Indian Medicine. Many more researcher work on the association improvement is a very important research field in data mining. The mining association rule recurrently has been adopting numerous replica support, confidence, interestingness. But this model can't accurate determine the correlative degree between the precursor and the major of the rule by allocation. So we proposed a new mining algorithm of association rules. Proposed a new system based SVM,fuzzy Discriminant support. Our propose Coronary Heart Disease prediction system quantitatively estimate the correlation of rules and reduce many rules that have low support or have no correlation or have negative correlation. In our work we conduct experiments on large real time rural and urban data set and to predict the diseases like Medication in Coronary Heart Disease.

Discovering frequent item sets is the main way of association rules mining, and it is also the focus of the study in algorithms for association rules mining. The classical Apriori algorithm and its improved algorithms of association rules mining can be generally classified as one based on SQL and the other based on memory. To improve the data-mining efficiency, the authors proposed an efficient algorithm for discovering frequent item sets. After analyzing the efficiency bottlenecks in some algorithms based on memory, the algorithm used a method that could generate and test candidate item sets efficiently to optimize the speed of item sets generation. The experimental results show that the proposed algorithm can assuredly improve the mining efficiency.

Efficiency is critical to data mining algorithm. Based on fully analyzing the PF_growth, an association rule mining algorithm, we in this paper give a new association rule mining algorithm called MFP. MFP algorithm converts a transaction database to an MFP_tree through scanning the transaction database only once, then prune the tree and at last mine the tree. Because the MFP algorithm scans a transaction database one time less than the FP_growth algorithm, the MFP algorithm is more efficient under certain conditions.

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.