Validity of association rules extracted by healthcare-data-mining

Author(s):  
Hiroshi Takeuchi ◽  
Naoki Kodama
2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Yuxia Lei ◽  
Yushu Yan ◽  
Yonghua Han ◽  
Feng Jiang

In mobile computing, machine learning models for natural language processing (NLP) have become one of the most attractive focus areas in research. Association rules among attributes are common knowledge patterns, which can often provide potential and useful information such as mobile users' interests. Actually, almost each attribute is associated with a hierarchy of the domain. Given an relation R=(U,A) and any cut αa on the hierarchy for every attribute a, there is another rough relation RΦ, where Φ=(αa:a∈A). This paper will establish the connection between the functional dependencies in R and RΦ, propose the method for extracting reducts in RΦ, and demonstrate the implementation of proposed method on an application in data mining of association rules. The method for acquiring association rules consists of the following three steps: (1) translating natural texts into relations, by NLP; (2) translating relations into rough ones, by attributes analysis or fuzzy k-means (FKM) clustering; and (3) extracting association rules from concept lattices, by formal concept analysis (FCA). Our experimental results show that the proposed methods, which can be applied directly to regular mobile data such as healthcare data, improved quality, and relevance of rules.


Association Rule Mining (ARM) is a data mining approach for discovering rules that reveal latent associations among persisted entity sets. ARM has many significant applications in the real world such as finding interesting incidents, analyzing stock market data and discovering hidden relationships in healthcare data to mention few. Many algorithms that are efficient to mine association rules are found in the existing literature, apriori-based and Pattern-Growth. Comprehensive understanding of them helps data mining community and its stakeholders to make expert decisions. Dynamic update of association rules that have been discovered already is very challenging due to the fact that the changes are arbitrary and heterogeneous in the kind of operations. When new instances are added to existing dataset that has been subjected to ARM, only those instances are to be used in order to go for incremental mining of rules instead of considering the whole dataset again. Recently some algorithms were developed by researchers especially to achieve incremental ARM. They are broadly grouped into Apriori-based and Pattern-Growth. This paper provides review of Apriori-based and Pattern-Growth techniques that support incremental ARM.


2014 ◽  
Vol 1 (1) ◽  
pp. 339-342
Author(s):  
Mirela Danubianu ◽  
Dragos Mircea Danubianu

AbstractSpeech therapy can be viewed as a business in logopaedic area that aims to offer services for correcting language. A proper treatment of speech impairments ensures improved efficiency of therapy, so, in order to do that, a therapist must continuously learn how to adjust its therapy methods to patient's characteristics. Using Information and Communication Technology in this area allowed collecting a lot of data regarding various aspects of treatment. These data can be used for a data mining process in order to find useful and usable patterns and models which help therapists to improve its specific education. Clustering, classification or association rules can provide unexpected information which help to complete therapist's knowledge and to adapt the therapy to patient's needs.


2011 ◽  
Vol 145 ◽  
pp. 292-296
Author(s):  
Lee Wen Huang

Data Mining means a process of nontrivial extraction of implicit, previously and potentially useful information from data in databases. Mining closed large itemsets is a further work of mining association rules, which aims to find the set of necessary subsets of large itemsets that could be representative of all large itemsets. In this paper, we design a hybrid approach, considering the character of data, to mine the closed large itemsets efficiently. Two features of market basket analysis are considered – the number of items is large; the number of associated items for each item is small. Combining the cut-point method and the hash concept, the new algorithm can find the closed large itemsets efficiently. The simulation results show that the new algorithm outperforms the FP-CLOSE algorithm in the execution time and the space of storage.


2019 ◽  
Vol 15 (1) ◽  
pp. 85-90 ◽  
Author(s):  
Jordy Lasmana Putra ◽  
Mugi Raharjo ◽  
Tommi Alfian Armawan Sandi ◽  
Ridwan Ridwan ◽  
Rizal Prasetyo

The development of the business world is increasingly rapid, so it needs a special strategy to increase the turnover of the company, in this case the retail company. In increasing the company's turnover can be done using the Data Mining process, one of which is using apriori algorithm. With a priori algorithm can be found association rules which can later be used as patterns of purchasing goods by consumers, this study uses a repository of 209 records consisting of 23 transactions and 164 attributes. From the results of this study, the goods with the name CREAM CUPID HEART COAT HANGER are the products most often purchased by consumers. By knowing the pattern of purchasing goods by consumers, the company management can increase the company's turnover by referring to the results of processing sales transaction data using a priori algorithm


Sign in / Sign up

Export Citation Format

Share Document