Genetic algorithm-based optimized association rule mining for multi-relational data

2013 ◽  
Vol 17 (6) ◽  
pp. 965-980 ◽  
Author(s):  
D. Vimal Kumar ◽  
A. Tamilarasi
2018 ◽  
Vol 14 (11) ◽  
pp. 1475-1487
Author(s):  
Carlos Roberto Valêncio ◽  
Guilherme Henrique Morais ◽  
Márcio Zamboti Fortes ◽  
Angelo Cesar Colombini ◽  
Leandro Alves Neves ◽  
...  

2012 ◽  
Vol 629 ◽  
pp. 730-734 ◽  
Author(s):  
Cun Liang Yan ◽  
Wei Feng Shi

Job shop scheduling problem (JSP) is the most typical scheduling problem, In the process of JSP based on genetic algorithm (GA), large amounts of data will be produced. Mining them to find the useful information is necessary. In this paper dividing, hashing and array (DHA) association rule mining algorithm is used to find the frequent itemsets which contained in the process, and extract the corresponding association rules. Concept hierarchy is used to interpret the rules, and lots of useful rules appeared. It provides a new way for JSP study.


Author(s):  
Leila Hamdad ◽  
Zakaria Ournani ◽  
Karima Benatchba ◽  
Ahcène Bendjoudi

Author(s):  
Anne Denton

Most data of practical relevance are structured in more complex ways than is assumed in traditional data mining algorithms, which are based on a single table. The concept of relations allows for discussing many data structures such as trees and graphs. Relational data have much generality and are of significant importance, as demonstrated by the ubiquity of relational database management systems. It is, therefore, not surprising that popular data mining techniques, such as association rule mining, have been generalized to relational data. An important aspect of the generalization process is the identification of challenges that are new to the generalized setting.


Author(s):  
Ahcène Bendjoudi ◽  
Karima Benatchba ◽  
Leila Hamdad ◽  
Zakaria Ournani

Sign in / Sign up

Export Citation Format

Share Document