scholarly journals Multilevel Association Rule Mining for Bridge Resource Management Based on Immune Genetic Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-8
Author(s):  
Yang Ou ◽  
Zheng Jiang Liu ◽  
Hamid Reza Karimi ◽  
Ying Tian
Keyword(s):  
Genetic Algorithm ◽  
Resource Management ◽  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Rule Mining ◽  
Immune Genetic Algorithm ◽  
Coding Scheme ◽  
The Relationship ◽  
Multilevel Association Rules

This paper is concerned with the problem of multilevel association rule mining for bridge resource management (BRM) which is announced by IMO in 2010. The goal of this paper is to mine the association rules among the items of BRM and the vessel accidents. However, due to the indirect data that can be collected, which seems useless for the analysis of the relationship between items of BIM and the accidents, the cross level association rules need to be studied, which builds the relation between the indirect data and items of BRM. In this paper, firstly, a cross level coding scheme for mining the multilevel association rules is proposed. Secondly, we execute the immune genetic algorithm with the coding scheme for analyzing BRM. Thirdly, based on the basic maritime investigation reports, some important association rules of the items of BRM are mined and studied. Finally, according to the results of the analysis, we provide the suggestions for the work of seafarer training, assessment, and management.

scholarly journals Generating Non-redundant Multilevel Association Rules Using Min-max Exact Rules

2018 ◽  
Vol 8 (6) ◽  
pp. 4568
Author(s):  
R. Vijaya Prakash ◽  
S. S. V. N. Sarma ◽  
M. Sheshikala
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Rule Mining ◽  
Huge Number ◽  
Concise Representation ◽  
Multi Level ◽  
The Given ◽  
Multilevel Association Rules

Association Rule mining plays an important role in the discovery of knowledge and information. Association Rule mining discovers huge number of rules for any dataset for different support and confidence values, among this many of them are redundant, especially in the case of multi-level datasets. Mining non-redundant Association Rules in multi-level dataset is a big concern in field of Data mining. In this paper, we present a definition for redundancy and a concise representation called Reliable Exact basis for representing non-redundant Association Rules from multi-level datasets. The given non-redundant Association Rules are loss less representation for any datasets.

scholarly journals Investigating Health Equity and Healthcare Needs among Immigrant Women Using the Association Rule Mining Method

Healthcare ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 195
Author(s):  
Ming-Hseng Tseng ◽  
Hui-Ching Wu
Keyword(s):  
Association Analysis ◽  
Association Rule ◽  
Association Rule Mining ◽  
Immigrant Women ◽  
Parental Knowledge ◽  
Physical Factors ◽  
Rule Mining ◽  
Socioeconomic Characteristics ◽  
Healthcare Needs ◽  
The Relationship

Equitable access to healthcare services is a major concern among immigrant women. Thus, this study investigated the relationship between socioeconomic characteristics and healthcare needs among immigrant women in Taiwan. The secondary data was obtained from “Survey of Foreign and Chinese Spouses’ Living Requirements, 2008”, which was administered to 5848 immigrant women by the Ministry of the Interior, Taiwan. Additionally, descriptive statistics and significance tests were used to analyze the data, after which the association rule mining algorithm was applied to determine the relationship between socioeconomic characteristics and healthcare needs. According to the findings, the top three healthcare needs were providing medical allowances (52.53%), child health checkups (16.74%), and parental knowledge and pre- and post-natal guidance (8.31%). Based on the association analysis, the main barrier to the women’s healthcare needs was “financial pressure”. This study also found that nationality, socioeconomic status, and duration of residence were associated with such needs, while health inequality among aged immigrant women was due to economic and physical factors. Finally, the association analysis found that the women’s healthcare problems included economic, socio-cultural, and gender weakness, while “economic inequality” and “women’s health” were interrelated.

scholarly journals Binary Particle Swarm Optimization-Based Association Rule Mining for Discovering Relationships between Machine Capabilities and Product Features

2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Zhicong Kou ◽  
Lifeng Xi
Keyword(s):  
Particle Swarm Optimization ◽  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Particle Swarm ◽  
Performance Comparison ◽  
Binary Particle Swarm Optimization ◽  
Rule Mining ◽  
Swarm Optimization ◽  
Product Features

An effective data mining method to automatically extract association rules between manufacturing capabilities and product features from the available historical data is essential for an efficient and cost-effective product development and production. This paper proposes a new binary particle swarm optimization- (BPSO-) based association rule mining (BPSO-ARM) method for discovering the hidden relationships between machine capabilities and product features. In particular, BPSO-ARM does not need to predefine thresholds of minimum support and confidence, which improves its applicability in real-world industrial cases. Moreover, a novel overlapping measure indication is further proposed to eliminate those lower quality rules to further improve the applicability of BPSO-ARM. The effectiveness of BPSO-ARM is demonstrated on a benchmark case and an industrial case about the automotive part manufacturing. The performance comparison indicates that BPSO-ARM outperforms other regular methods (e.g., Apriori) for ARM. The experimental results indicate that BPSO-ARM is capable of discovering important association rules between machine capabilities and product features. This will help support planners and engineers for the new product design and manufacturing.

Association Rule Mining for Job Shop Scheduling Problem Based on Genetic Algorithm

2012 ◽  
Vol 629 ◽  
pp. 730-734 ◽  
Author(s):  
Cun Liang Yan ◽  
Wei Feng Shi
Keyword(s):  
Genetic Algorithm ◽  
Association Rule ◽  
Association Rule Mining ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Rule Mining ◽  
Concept Hierarchy ◽  
Shop Scheduling

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.

Two-level parallel CPU/GPU-based genetic algorithm for association rule mining

2020 ◽  
Vol 22 (2/3) ◽  
pp. 335
Author(s):  
Leila Hamdad ◽  
Zakaria Ournani ◽  
Karima Benatchba ◽  
Ahcène Bendjoudi
Keyword(s):  
Genetic Algorithm ◽  
Association Rule ◽  
Association Rule Mining ◽  
Rule Mining

Semi-Automatic Ontology Construction by Exploiting Functional Dependencies and Association Rules

Semantic Web ◽  
2013 ◽  
pp. 76-96
Author(s):  
Luca Cagliero ◽  
Tania Cerquitelli ◽  
Paolo Garza
Keyword(s):  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Description Logic ◽  
Functional Dependency ◽  
Functional Dependencies ◽  
Rule Mining ◽  
Domain Experts ◽  
Data Schema ◽  
Input Dataset

This paper presents a novel semi-automatic approach to construct conceptual ontologies over structured data by exploiting both the schema and content of the input dataset. It effectively combines two well-founded database and data mining techniques, i.e., functional dependency discovery and association rule mining, to support domain experts in the construction of meaningful ontologies, tailored to the analyzed data, by using Description Logic (DL). To this aim, functional dependencies are first discovered to highlight valuable conceptual relationships among attributes of the data schema (i.e., among concepts). The set of discovered correlations effectively support analysts in the assertion of the Tbox ontological statements (i.e., the statements involving shared data conceptualizations and their relationships). Then, the analyst-validated dependencies are exploited to drive the association rule mining process. Association rules represent relevant and hidden correlations among data content and they are used to provide valuable knowledge at the instance level. The pushing of functional dependency constraints into the rule mining process allows analysts to look into and exploit only the most significant data item recurrences in the assertion of the Abox ontological statements (i.e., the statements involving concept instances and their relationships).

Constraint-Based Association Rule Mining

2011 ◽  
pp. 307-312 ◽  
Author(s):  
Carson Kai-Sang Leung
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Computational Cost ◽  
Knowledge Discovery In Databases ◽  
Rule Mining ◽  
The Subject ◽  
User Focus ◽  
High Computational Cost

The problem of association rule mining was introduced in 1993 (Agrawal et al., 1993). Since then, it has been the subject of numerous studies. Most of these studies focused on either performance issues or functionality issues. The former considered how to compute association rules efficiently, whereas the latter considered what kinds of rules to compute. Examples of the former include the Apriori-based mining framework (Agrawal & Srikant, 1994), its performance enhancements (Park et al., 1997; Leung et al., 2002), and the tree-based mining framework (Han et al., 2000); examples of the latter include extensions of the initial notion of association rules to other rules such as dependence rules (Silverstein et al., 1998) and ratio rules (Korn et al., 1998). In general, most of these studies basically considered the data mining exercise in isolation. They did not explore how data mining can interact with the human user, which is a key component in the broader picture of knowledge discovery in databases. Hence, they provided little or no support for user focus. Consequently, the user usually needs to wait for a long period of time to get numerous association rules, out of which only a small fraction may be interesting to the user. In other words, the user often incurs a high computational cost that is disproportionate to what he wants to get. This calls for constraint-based association rule mining.

Association Rule and Quantitative Association Rule Mining among Infrequent Items

2010 ◽  
pp. 15-32 ◽  
Author(s):  
Ling Zhou ◽  
Stephen Yau
Keyword(s):  
Data Mining ◽  
Association Rules ◽  
Association Rule ◽  
Association Rule Mining ◽  
Rule Mining ◽  
Transactional Databases ◽  
Frequent Items ◽  
Increasing Demand ◽  
Quantitative Association Rule

Association rule mining among frequent items has been extensively studied in data mining research. However, in recent years, there is an increasing demand for mining infrequent items (such as rare but expensive items). Since exploring interesting relationships among infrequent items has not been discussed much in the literature, in this chapter, the authors propose two simple, practical and effective schemes to mine association rules among rare items. Their algorithms can also be applied to frequent items with bounded length. Experiments are performed on the well-known IBM synthetic database. The authors’ schemes compare favorably to Apriori and FP-growth under the situation being evaluated. In addition, they explore quantitative association rule mining in transactional databases among infrequent items by associating quantities of items: some interesting examples are drawn to illustrate the significance of such mining.

Sign in / Sign up

Export Citation Format

Share Document