GTRACE-RS: Efficient Graph Sequence Mining using Reverse Search

The mining of frequent subgraphs from labeled graph data has been studied extensively. Furthermore, much attention has recently been paid to frequent pattern mining from graph sequences. A method, called GTRACE, has been proposed to mine frequent patterns from graph sequences under the assumption that changes in graphs are gradual. Although GTRACE mines the frequent patterns efficiently, it still needs substantial computation time to mine the patterns from graph sequences containing large graphs and long sequences. In this paper, we propose a new version of GTRACE that enables efficient mining of frequent patterns based on the principle of a reverse search. The underlying concept of the reverse search is a general scheme for designing efficient algorithms for hard enumeration problems. Our performance study shows that the proposed method is efficient and scalable for mining both long and large graph sequence patterns and is several orders of magnitude faster than the original GTRACE

Efficient incremental modelling and solving

Funding: This work is supported by EPSRC grant EP/P015638/1. Nguyen Dang is a Leverhulme Trust Early Career Fellow (ECF-2020-168).In various scenarios, a single phase of modelling and solving is either not sufficient or not feasible to solve the problem at hand. A standard approach to solving AI planning problems, for example, is to incrementally extend the planning horizon and solve the problem of trying to find a plan of a particular length. Indeed, any optimization problem can be solved as a sequence of decision problems in which the objective value is incrementally updated. Another example is constraint dominance programming (CDP), in which search is organized into a sequence of levels. The contribution of this work is to enable a native interaction between SAT solvers and the automated modelling system Savile Row to support efficient incremental modelling and solving. This allows adding new decision variables, posting new constraints and removing existing constraints (via assumptions) between incremental steps. Two additional benefits of the native coupling of modelling and solving are the ability to retain learned information between SAT solver calls and to enable SAT assumptions, further improving flexibility and efficiency. Experiments on one optimisation problem and five pattern mining tasks demonstrate that the native interaction between the modelling system and SAT solver consistently improves performance significantly.Publisher PD

Studying patterns of use of transport modes through data mining - Application to U.S. national household travel survey data set

Data collection activities related to travel require large amounts of financial and human resources to be conducted successfully. When available resources are scarce, the information hidden in these data sets needs to be exploited, both to increase their added value and to gain support among decision makers not to discontinue such efforts. This study assessed the use of a data mining technique, association analysis, to understand better the patterns of mode use from the 2009 U.S. National Household Travel Survey. Only variables related to self-reported levels of use of the different transportation means are considered, along with those useful to the socioeconomic characterization of the respondents. Association rules potentially showed a substitution effect between cars and public transportation, in economic terms but such an effect was not observed between public transportation and nonmotorized modes (e.g., bicycling and walking). This effect was a policy-relevant finding, because transit marketing should be targeted to car drivers rather than to bikers or walkers for real improvement in the environmental performance of any transportation system. Given the competitive advantage of private modes extensively discussed in the literature, modal diversion from car to transit is seldom observed in practice. However, after such a factor was controlled, the results suggest that modal diversion should mainly occur from cars to transit rather than from nonmotorized modes to transi

Odoo Data Mining Module Using Market Basket Analysis

Odoo is an enterprise resource planning information system providing modules to support the basic business function in companies. This research will look into the development of an additional module at Odoo. This module is a data mining module using Market Basket Analysis (MBA) using FP-Growth algorithm in managing OLTP of sales transaction to be useful information for users to improve the analysis of company business strategy. The FP-Growth algorithm used in the application was able to produce multidimensional association rules. The company will know more about their sales and customers� buying habits. Performing sales trend analysis will give a valuable insight into the inner-workings of the business. The testing of the module is using the data from X Supermarket. The final result of this module is generated from a data mining process in the form of association rule. The rule is presented in narrative and graphical form to be understood easier

Horn axiomatizations for sequential data

AbstractWe propose a notion of deterministic association rules for ordered data. We prove that our proposed rules can be formally justified by a purely logical characterization, namely, a natural notion of empirical Horn approximation for ordered data which involves background Horn conditions; these ensure the consistency of the propositional theory obtained with the ordered context. The whole framework resorts to concept lattice models from Formal Concept Analysis, but adapted to ordered contexts. We also discuss a general method to mine these rules that can be easily incorporated into any algorithm for mining closed sequences, of which there are already some in the literature

A novel MapReduce Lift association rule mining algorithm (MRLAR) for Big Data

Big Data mining is an analytic process used to dis-cover the hidden knowledge and patterns from a massive, com-plex, and multi-dimensional dataset. Single-processor's memory and CPU resources are very limited, which makes the algorithm performance ineffective. Recently, there has been renewed inter-est in using association rule mining (ARM) in Big Data to uncov-er relationships between what seems to be unrelated. However, the traditional discovery ARM techniques are unable to handle this huge amount of data. Therefore, there is a vital need to scal-able and parallel strategies for ARM based on Big Data ap-proaches. This paper develops a novel MapReduce framework for an association rule algorithm based on Lift interestingness measurement (MRLAR) which can handle massive datasets with a large number of nodes. The experimental result shows the effi-ciency of the proposed algorithm to measure the correlations between itemsets through integrating the uses of MapReduce and LIM instead of depending on confidence.Web of Science7315715

Data Pattern Of Computer Maintenance Management System With Eclat Algorithm

Decision support system, basically used to help choosing some solution for stakeholde to take the best decision in manufacturer. In manufacturer company using Enterprise Resource System (ERP)  that has Work Oder (WO) modul as request maintenance from user. But many of data from WO still didn’t use to help decision making and only as warehouse data about infrastructure maintenance from last time. Because that, author use that data to help technician to take decision making by using association rule as pattern processing. This is because WO has unique pattern that has problem (p), symptom (s), and root cause (r). Previous research (Sukmana, Rozi, 2017) was proved if association rule can use to help people to take decison making, it is just involved two variable, that is symptom (s), root cause (r) and using apriori algorithm as association rule. And focussing in this research is using that three variable and eclat algorithm as association rule methode. Result of this research has purpose to take the best pattern when using eclat algorithm