scholarly journals Improving Association Rule Mining Using Clustering-Based Data Mining Model for Traffic Accidents

2021 ◽  
Vol 8 (3) ◽  
pp. 65-70
Author(s):  
Mohamad Mohamad Shamie ◽  
Muhammad Mazen Almustafa

Data mining is a process of knowledge discovery to extract the interesting, previously unknown, potentially useful, and nontrivial patterns from large data sets. Currently, there is an increasing interest in data mining in traffic accidents, which makes it a growing new research community. A large number of traffic accidents in recent years have generated large amounts of traffic accident data. The mining algorithms had a great role in determining the causes of these accidents, especially the association rule algorithms. One challenging problem in data mining is effective association rules mining with the huge transactional databases, many efforts have been made to propose and improve association rules mining methods. In the paper, we use the RapidMiner application to design a process that can generate association rules based on clustering algorithms.

2014 ◽  
Vol 1030-1032 ◽  
pp. 2161-2165
Author(s):  
Shao Yun Song

According to the characteristics of small cities accident in China, selectively build data mining models. The algorithm focus on mining association rules to small cities accidents analysis system. Experiments show that the algorithm is superior to other algorithms. In this paper, the relationship matrix algorithm by using association rules on accident data, data mining, and mining results were analyzed to verify the effectiveness of the system.


Author(s):  
Ling Feng

The discovery of association rules from large amounts of structured or semi-structured data is an important data mining problem [Agrawal et al. 1993, Agrawal and Srikant 1994, Miyahara et al. 2001, Termier et al. 2002, Braga et al. 2002, Cong et al. 2002, Braga et al. 2003, Xiao et al. 2003, Maruyama and Uehara 2000, Wang and Liu 2000]. It has crucial applications in decision support and marketing strategy. The most prototypical application of association rules is market basket analysis using transaction databases from supermarkets. These databases contain sales transaction records, each of which details items bought by a customer in the transaction. Mining association rules is the process of discovering knowledge such as “80% of customers who bought diapers also bought beer, and 35% of customers bought both diapers and beer”, which can be expressed as “diaper ? beer” (35%, 80%), where 80% is the confidence level of the rule, and 35% is the support level of the rule indicating how frequently the customers bought both diapers and beer. In general, an association rule takes the form X ? Y (s, c), where X and Y are sets of items, and s and c are support and confidence, respectively. In the XML Era, mining association rules is confronted with more challenges than in the traditional well-structured world due to the inherent flexibilities of XML in both structure and semantics [Feng and Dillon 2005]. First, XML data has a more complex hierarchical structure than a database record. Second, elements in XML data have contextual positions, which thus carry the order notion. Third, XML data appears to be much bigger than traditional data. To address these challenges, the classic association rule mining framework originating with transactional databases needs to be re-examined.


2008 ◽  
pp. 2105-2120
Author(s):  
Kesaraporn Techapichetvanich ◽  
Amitava Datta

Both visualization and data mining have become important tools in discovering hidden relationships in large data sets, and in extracting useful knowledge and information from large databases. Even though many algorithms for mining association rules have been researched extensively in the past decade, they do not incorporate users in the association-rule mining process. Most of these algorithms generate a large number of association rules, some of which are not practically interesting. This chapter presents a new technique that integrates visualization into the mining association rule process. Users can apply their knowledge and be involved in finding interesting association rules through interactive visualization, after obtaining visual feedback as the algorithm generates association rules. In addition, the users gain insight and deeper understanding of their data sets, as well as control over mining meaningful association rules.


Author(s):  
Ling Zhou ◽  
Stephen Yau

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.


Author(s):  
Kesaraporn Techapichetvanich ◽  
Amitava Datta

Both visualization and data mining have become important tools in discovering hidden relationships in large data sets, and in extracting useful knowledge and information from large databases. Even though many algorithms for mining association rules have been researched extensively in the past decade, they do not incorporate users in the association-rule mining process. Most of these algorithms generate a large number of association rules, some of which are not practically interesting. This chapter presents a new technique that integrates visualization into the mining association rule process. Users can apply their knowledge and be involved in finding interesting association rules through interactive visualization, after obtaining visual feedback as the algorithm generates association rules. In addition, the users gain insight and deeper understanding of their data sets, as well as control over mining meaningful association rules.


2014 ◽  
Vol 23 (05) ◽  
pp. 1450004 ◽  
Author(s):  
Ibrahim S. Alwatban ◽  
Ahmed Z. Emam

In recent years, a new research area known as privacy preserving data mining (PPDM) has emerged and captured the attention of many researchers interested in preventing the privacy violations that may occur during data mining. In this paper, we provide a review of studies on PPDM in the context of association rules (PPARM). This paper systematically defines the scope of this survey and determines the PPARM models. The problems of each model are formally described, and we discuss the relevant approaches, techniques and algorithms that have been proposed in the literature. A profile of each model and the accompanying algorithms are provided with a comparison of the PPARM models.


2003 ◽  
Vol 1840 (1) ◽  
pp. 123-130 ◽  
Author(s):  
Karolien Geurts ◽  
Geert Wets ◽  
Tom Brijs ◽  
Koen Vanhoof

In Belgium, traffic safety is one of the government's highest priorities. The identification and profiling of black spots and black zones (geographical locations with high concentrations of traffic accidents) in terms of accident-related data and location characteristics must provide new insights into the complexity and causes of road accidents, which, in turn, provide valuable input for governmental actions. Association rules were used to identify accident-related circumstances that frequently occur together at high-frequency accident locations. Furthermore, these patterns were analyzed and compared with frequently occurring accident-related characteristics at low-frequency accident locations. The strength of this approach lies with the identification of relevant variables that make a strong contribution toward obtaining a better understanding of accident circumstances and the discerning of descriptive accident patterns from more discriminating accident circumstances to profile black spots and black zones. This data-mining algorithm is particularly useful in the context of large data sets for road accidents, since data mining can be described as the extraction of information from large amounts of data. The results showed that human and behavioral aspects are of great importance in the analysis of frequently occurring accident patterns. These factors play an important role in identifying traffic safety problems in general. However, the accident characteristics that were the most discriminating between high-frequency and low-frequency accident locations are mainly related to infrastructure and location.


Author(s):  
Ana Cristina Bicharra Garcia ◽  
Inhauma Ferraz ◽  
Adriana S. Vivacqua

AbstractMost past approaches to data mining have been based on association rules. However, the simple application of association rules usually only changes the user's problem from dealing with millions of data points to dealing with thousands of rules. Although this may somewhat reduce the scale of the problem, it is not a completely satisfactory solution. This paper presents a new data mining technique, called knowledge cohesion (KC), which takes into account a domain ontology and the user's interest in exploring certain data sets to extract knowledge, in the form of semantic nets, from large data sets. The KC method has been successfully applied to mine causal relations from oil platform accident reports. In a comparison with association rule techniques for the same domain, KC has shown a significant improvement in the extraction of relevant knowledge, using processing complexity and knowledge manageability as the evaluation criteria.


2012 ◽  
Vol 241-244 ◽  
pp. 1589-1592
Author(s):  
Jun Tan

In recent years, many application systems have generate large quantities of data, so it is no longer practical to rely on traditional database technique to analyze these data. Data mining offers tools for extracting knowledge from data, leading to significant improvement in the decision-making process. Association rules mining is one of the most important data mining technology. The paper first presents the basic concept of association rule mining, then discuss a few different types of association rules mining including multi-level association rules, multidimensional association rules, weighted association rules, multi-relational association rules, fuzzy association rules.


2010 ◽  
Vol 34-35 ◽  
pp. 651-654
Author(s):  
Jun Tan ◽  
Ying Yong Bu

In recent years, manufacturing processes have become more and more complex, manufacturing activities generate large quantities of data, so it is no longer practical to rely on traditional manual methods to analyze this data. Data mining offers tools for extracting knowledge from data, leading to significant improvement in the decision-making process. Association rules mining is one of the most important data mining techniques and has received considerable attention from researchers and practitioners. The paper presents the basic concept of association rule mining and reviews applications of association rules in manufacturing, including product design, manufacturing, process, customer relationship management, supply chain management, and product quality improvement. This paper is focused on demonstrating the relevancy of association rules mining to manufacturing industry, rather than discussing the association rules mining domain in general.


Sign in / Sign up

Export Citation Format

Share Document