Object-driven and temporal action rules mining

In this thesis, I present my complete research work in the field of action rules, more precisely object-driven and temporal action rules. The drive behind the introduction of object-driven and temporally based action rules is to bring forth an adapted ap- proach to extract action rules from a subclass of systems that have a specific nature, in which instances are observed from assumingly different distributions (defined by an object attribute), and in which each instance is coupled with a time-stamp. In previous publications, we proposed an object-independency assumption that suggests extracting patterns from subsystems defined by unique objects, and then aggregat- ing similar patterns amongst all objects. The motivation behind this approach is based on the fact that same-object observations share similar features that are not shared with other objects, and these features are possibly not explicitly included in our dataset. Therefore, by individualizing objects prior to calculating action rules, variance is reduced, and over-fitting is potentially avoided. In addition to the object- independency assumption, temporal information is exploited by taking into account only the state transitions that occurred in the valid direction.j The common nature of object-driven and temporal action rules made us believe that this work is general enough to solve a diverse fields of areas where it is highly needed. In our case study, we show how our approach was applied to an information system of hypernasality patients; our results were further investigated by physicians collaborators to confirm them

Robust and cost-effective approach for discovering action rules

The main goal of Knowledge Discovery in Databases is to find interesting and usable patterns, meaningful in their domain. Actionable Knowledge Discovery came to existence as a direct respond to the need of finding more usable patterns called actionable patterns. Traditional data mining and algorithms are often confined to deliver frequent patterns and come short for suggesting how to make these patterns actionable. In this scenario the users are expected to act. However, the users are not advised about what to do with delivered patterns in order to make them usable. In this paper, we present an automated approach to focus on not only creating rules but also making the discovered rules actionable. Up to now few works have been reported in this field which lacking incomprehensibility to the user, overlooking the cost and not providing rule generality. Here we attempt to present a method to resolving these issues. In this paper CEARDM method is proposed to discover cost-effective action rules from data. These rules offer some cost-effective changes to transferring low profitable instances to higher profitable ones. We also propose an idea for improving in CEARDM method

AUTOMATED META-ACTIONS DISCOVERY FOR PERSONALIZED MEDICAL TREATMENTS

Healthcare, among other domains, provides an attractive ground of work for knowl- edge discovery researchers. There exist several branches of health informatics and health data-mining from which we find actionable knowledge discovery is underserved. Actionable knowledge is best represented by patterns of structured actions that in- form decision makers about actions to take rather than providing static information that may or may not hint to actions. The Action rules model is a good example of active structured action patterns that informs us about the actions to perform to reach a desired outcome. It is augmented by the meta-actions model that rep- resents passive structured effects triggered by the application of an action. In this dissertation, we focus primarily on the meta-actions model that can be mapped to medical treatments and their effects in the healthcare arena. Our core contribution lies in structuring meta-actions and their effects (positive, neutral, negative, and side effects) along with mining techniques and evaluation metrics for meta-action effects. In addition to the mining techniques for treatment effects, this dissertation provides analysis and prediction of side effects, personalized action rules, alternatives for treat- ments with negative outcomes, evaluation for treatments success, and personalized recommendations for treatments. We used the tinnitus handicap dataset and the Healthcare Cost and Utilization Project (HCUP) Florida State Inpatient Databases (SID 2010) to validate our work. The results show the efficiency of our methods

Automatic Finding Trapezoidal Membership Functions in Mining Fuzzy Association Rules Based on Learning Automata

Association rule mining is an important data mining technique used for discovering relationships among all data items. Membership functions have a significant impact on the outcome of the mining association rules. An important challenge in fuzzy association rule mining is finding an appropriate membership functions, which is an optimization issue. In the most relevant studies of fuzzy association rule mining, only triangle membership functions are considered. This study, as the first attempt, used a team of continuous action-set learning automata (CALA) to find both the appropriate number and positions of trapezoidal membership functions (TMFs). The spreads and centers of the TMFs were taken into account as parameters for the research space and a new approach for the establishment of a CALA team to optimize these parameters was introduced. Additionally, to increase the convergence speed of the proposed approach and remove bad shapes of membership functions, a new heuristic approach has been proposed. Experiments on two real data sets showed that the proposed algorithm improves the efficiency of the extracted rules by finding optimized membership functions

From Classification Rules to Action Recommendations

Rule induction has attracted a great deal of attention in Machine Learning and Data Mining. However, generating rules is not an end in itself because their applicability is not straightforward especially when the number of rules is large. Ideally, the user would ultimately like to use these rules to decide which actions to take. In the literature, this notion is usually referred to as actionability. The contribution of this paper1 is two-fold: first we propose a survey of the main approaches developed to address actionability. This topic has received growing attention in the past years. We present a classification of the main research in this area as well as a comparative study between the different approaches. Second, we propose a new framework to address actionability. Our goal is to lighten the burden of analyzing a large set of classification rules when the user is confronted with an "unsatisfactory situation" and needs help to decide what appropriate actions to take in order to remedy the situation. The method consists in comparing the situation to a set of classification rules. This is achieved by using a suitable distance that allows one to suggest action recommendations requiring minimal changes to improve the situation. We propose the algorithm DAKAR for learning action recommendations and we present an application to environment protection. Our experiment shows the usefulness of our contribution for action recommendation but also raises some concerns about the impact of the redundancy of a set of rules in learning action recommendations of good quality

MINING FOOD TRANSACTIONAL DATA TO PRODUCE ASSOCIATION RULES AS A BASIS OF BUSINESS ACTIONS

ABSTRAKSI: The food industry sells a range of product variations. The company wants to take advantage of their data by building business action from high volumes of transactional data. In this case, data mining technology needs to be implemented to explore valuable information on transactional data to assess customer\u27s preferences to products as a business strategy.Information about the customers’ behaviors of buying food products is important and this can be done by mapping the transaction data which is described as the pattern of customers’ tastes. The association method using apriori algorithm is used to map customers’ choice.The challenge is in the data itself, high volumes of data have to be prepared before the data is fetched to the mining process. Data reduction will be held to handle huge instances and attributes of the data. This research focused on the way the data were handled until the association rules were developed. To achieve this objective, three validation levels were implemented to verify the reliability of the association rules shows by percentage confidence.Furthermore, some data mining technique such as: clustering and time series pattern will be implemented to examine the truth of association rules which were built.It can be concluded that the association rules were established after three validation levels on reduced high volumes of transactional data, will generate strong association rules with confidence equal or higher than 70% and the rules established truth can be seen from the time series pattern on each group of goods which are then used as the basis of business actions.Kata Kunci : Data Reduction, Association Rules, Apriori, Confidence, Clustering, Time Series PatternsABSTRACT: -Keyword:

R-CAD: Rare Cyber Alert Signature Relationship Extraction Through Temporal Based Learning

The large number of streaming intrusion alerts make it challenging for security analysts to quickly identify attack patterns. This is especially difficult since critical alerts often occur too rarely for traditional pattern mining algorithms to be effective. Recognizing the attack speed as an inherent indicator of differing cyber attacks, this work aggregates alerts into attack episodes that have distinct attack speeds, and finds attack actions regularly co-occurring within the same episode. This enables a novel use of the constrained SPADE temporal pattern mining algorithm to extract consistent co-occurrences of alert signatures that are indicative of attack actions that follow each other. The proposed Rare yet Co-occurring Attack action Discovery (R-CAD) system extracts not only the co-occurring patterns but also the temporal characteristics of the co-occurrences, giving the `strong rules\u27 indicative of critical and repeated attack behaviors. Through the use of a real-world dataset, we demonstrate that R-CAD helps reduce the overwhelming volume and variety of intrusion alerts to a manageable set of co-occurring strong rules. We show specific rules that reveal how critical attack actions follow one another and in what attack speed