Research on Automated Modeling Algorithm Using Association Rules for Traffic Accidents

This research demonstrates the application of association rule mining to spatio‐temporal data. Association rule mining seeks to discover associations among transactions encoded in a database. An association rule takes the form A→B where A (the antecedent) and B (the consequent) are sets of predicates. A spatio‐temporal association rule occurs when there is a spatio‐temporal relationship in the antecedent or consequent of the rule. As a case study, association rule mining is used to explore the spatial and temporal relationships among a set of variables that characterize socioeconomic and land cover change in the Denver, Colorado, USA region from 1970–1990. Geographic Information Systems (GIS)‐based data pre‐processing is used to integrate diverse data sets, extract spatio‐temporal relationships, classify numeric data into ordinal categories, and encode spatio‐temporal relationship data in tabular format for use by conventional (non‐spatio‐temporal) association rule mining software. Multiple level association rule mining is supported by the development of a hierarchical classification scheme (concept hierarchy) for each variable. Further research in spatio‐temporal association rule mining should address issues of data integration, data classification, the representation and calculation of spatial relationships, and strategies for finding ‘interesting’ rules.

Association rule mining is the most important and most mature one of the research methods and techniques that can find the services a meaningful connection between the hidden and rules. This paper introduces the classical association rule mining algorithm Apriori algorithm and association rules combined with the teaching evaluation, evaluation of data from a large extract useful information hidden, so as to educational administration departments to provide decision support basis for improving teaching quality.KeywordsAssociation rule miningApriori algorithmTeaching evaluation

Tingkat persaingan dan kompleksitas permasalahan penjualan pada perusahaan retail, menuntut setiap perusahaan retail untuk mampu berkompetisi dengan perusahaan lain. Salah satu yang dapat dilakukan adalah melalui pengambilan keputusan terkait penjualan yang lebih tepat dan efektif. Besarnya data transaksinonal penjualan perusahaan retail dapat dilakukan ekstraksi informasi yang bermanfaat. Metode yang dapat digunakan untuk menggali informasi adalah melalui penerapan association rule mining. Association Rule Mining merupakan suatu metode data mining yang berfokus pada pola transaksi dengan cara mengekstraksi asosiasi atau hubungan suatu kejadian. Keranjang belanja yang terdapat pada perusahaan retail yang terkomputerisasi merupakan cara terbaik untuk memberikan dukungan rekomendasi keputusan secara ilmiah dengan cara menentukan hubungan antara barang yang dibeli secara bersamaan dalam setiap transaksi. Algoritma FP-growth digunakan untuk menentukan himpunan dataset yang paling sering muncul (frequent itemset) pada sekeompok data. Penelitian ini menghasilkan nilai minimum support 0,1% dan nilai minimum confidence 60% jumlah rule yang dihasilkan berjumlah 116457, nilai minimum confidence 70% jumlah rule yang dihasilkan berjumlah 84086, dan nilai minimum confidence 80% jumlah rule yang dihasilkan berjumlah 48623 dari data yang diolah sebanyak 22191. Hasil rule ini dapat digunakan untuk strategi pemasaran produk. Nilai minimum support 0,1% dimana semakin besar nilai minimum confidence maka menghasilkan rule yang semakin sedikit.

Frequent itemset mining and association rule mining are fundamental problems in data mining. Despite of the intensive and continuous researches on frequent itemset mining, one essential and not completely solved drawback still remains. The drawback is pattern explosion: a huge number of frequent itemsets, or patterns, will be often derived. The association rule mining takes over the same drawback since each association rule consists of two frequent itemsets. One promising solution for alleviating this essential drawback practically as a post-processing is to rank the patterns and rules from various aspects and to identify which one to be examined first. In this paper, we propose to utilize the technology of representation learning to rank frequent itemsets and association rules. More specifically, we develop several evaluation measures for frequent itemsets and association rules by using the vector representations of items, transactions and frequent patterns which are obtained by existing representation learning techniques. By employing vector representations of three kinds of objects, various rankings reflecting different aspects can expect to be obtained.

The application of association rule mining plays crucial role in the operations of data warehousing and data mining. To support this argument, the paper proposes a model having fuzzy taxonomic structure at the backend while retrieving frequent itemsets from the database which are organized in the form of star schema tabular database structures. The objective of the study generate new algorithm from the existing algorithm which deploy fuzzy association rule based mining operations in the databases having ER models. The focal point of the paper is centered on the extraction of rules pertaining to linguistic algorithm at multi level structures from several databases in the form tables so as to understand the performance of these extracted data item sets. An example at the end outlines the working of the proposed data mining algorithm which can be used to arrive at the multi level fuzzy rules which pertains to association mining algorithms in an easy and an effective manner.

This study analyzed traffic accident characteristics in Chungcheong Region through the factor analysis, cluster analysis and questionnaire survey using traffic accident analysis data for Chungcheong Region in order to improve Korea`s traffic safety level. Based on the analysis results, this study suggests traffic safety technologies suitable for the situation of Chungcheong Region. According to the results of the questionnaire survey carried out for transporters in Chungcheong Region, `the passage of pedestrians and aged people` and `a problem of lacking visibility` were the biggest threatening factors of major traffic accidents in Chungcheong Region. The facilities required the most were `lighting equipment in driving at night`, and the expected effect by the equipment installation was high. As a result of the factor analysis and cluster analysis using the traffic accident analysis data, traffic accident risk by city type in Chungcheong Region was higher in rural areas, compared to urban areas. Especially, this study confirmed the risks of pedestrian and agricultural machine traffic accidents were high. Therefore, this study suggests three technologies to improve traffic safety level in Chungcheong Region, based on the analysis results.

Web usage mining improves the efficiency and personalization of Web-based services by using data mining techniques to identify patterns in user activity from Web log data. Preprocessing, pattern finding, and pattern analysis are its three primary stages. Among other methods, association rule mining is essential for identifying connections between user actions or viewed web sites. In addition to offering a thorough taxonomy of current research and commercial systems in the field, this study investigates the application of association rule mining within the larger framework of Web usage mining. This study examines user navigation behavior by analysing web server logs. Using association rule mining and clustering techniques, we identify frequent usage patterns and group similar webpages. Key findings highlight connections between webpage visits and offer insights into user behaviour over time.

Efficiently mining frequent itemsets and association rules on the encrypted outsourced data remains a great challenge for the time-consuming ciphertext computations. Nowadays, it has been not well addressed for privacy-preserving frequent itemsets and association rule mining schemes with mining efficiency, dataset, and query confidentiality simultaneously. In this paper, we investigate the study of privacy issues on frequent itemset mining and association rule mining on outsourced data in a two-cloud model, where the data are encrypted and outsourced by multiple owners holding different public keys. We develop several secure computation protocols based on additively homomorphic cryptosystem and additive secret sharing, which enable the clouds could securely mine the frequent itemsets and association rules. Furthermore, we also design two kinds of frequent itemset and association rule query service models, i.e., service customers query the cloud-mined results, and service customers query with their own decided threshold. The proposed scheme not only supports the mining process on the data encrypted by multiple public keys without compromising the security of the datasets, query data and query results, but also offline users. In addition, the experimental results show that our query scheme is much more efficient than the state-of-the-art work.

The association rule mining can be divided into two steps. The first step is to find out all frequent itemsets, whose occurrences are greater than or equal to the user-specified threshold. The second step is to generate reliable association rules based on all frequent itemsets found in the first step. Identifying all frequent itemsets in a large database dominates the overall performance in the association rule mining. In this paper, we propose an efficient hash-based method, HMFS, for discovering the maximal frequent itemsets. The HMFS method combines the advantages of both the DHP (Direct Hashing and Pruning) and the Pincer-Search algorithms. The combination leads to two advantages. First, the HMFS method, in general, can reduce the number of database scans. Second, the HMFS can filter the infrequent candidate itemsets and can use the filtered itemsets to find the maximal frequent itemsets. These two advantages can reduce the overall computing time of finding the maximal frequent itemsets. In addition, the HMFS method also provides an efficient mechanism to construct the maximal frequent candidate itemsets to reduce the search space. We have implemented the HMFS method along with the DHP and the Pincer-Search algorithms on a Pentium III 800 MHz PC. The experimental results show that the HMFS method has better performance than the DHP and the Pincer-Search algorithms for most of test cases. In particular, our method has significant improvement over the DHP and the Pincer-Search algorithms when the size of a database is large and the length of the longest itemset is relatively long.

The paper introduced the attempt to apply the association rule mining (ARM) method to discovering heuristic rules for power system restoration (PSR) to guide a fast restoration process. In order to employ the popular algorithms of ARM, the process of PSR is represented as a series of actions out of a finite action set. The interesting attributes of each action are mapped as items and the actions are mapped as transactions. Fuzzy set and clustering method are adopted to evaluate the performance of individual action. A sample test is given to demonstrate the validity of the proposed method.

A provided data from a transactional database, has supported technical development which can automatically find product association or items saved in the database. This finding association rules between saved product in database known as mining association rules. There are so many theories and algorithm developed for conducting mining association rules. One of algorithm developed is Apriori algorithm. This method, has a main goal to find the maximum frequent itemset. Next, this frequent itemset will be generated into associative rules which are not shown before in the database, become valuable information for considering materials in the decision process. Apriori algorithm is a interpretation technique of mining association rules, will be implemented into a web based software. On the software test which use in some different data, it’s concluded that time for mining association rules depends on the presence of every item in every transaction, total of transaction, minimum support and minimum confidence. For smaller value of minimum support and minimum confidence that entered, program will generate more association rules, vice versa.

Association analysis is an important task in data analysis to find all co-occurrence relationships (i.e., frequent itemsets or confident association rules) from the transactional dataset. An association rule can help people better discover patterns and develop corresponding strategies. The process of data analysis can be highly summarized as a set of queries, where each query is a real-valued function of the dataset. However, without any restriction and protection, accessing the dataset to answer the queries may lead to the disclosure of individual privacy. In this paper, we propose and implement the association rule mining with differential privacy algorithm, which uses multiple support thresholds to reduce the number of candidate itemsets while reflecting the real nature of the items, and uses random truncation and uniform partition to lower the dimensionality of the dataset. We also stabilize the noise scale by adaptively allocating the privacy budgets, and bound the overall privacy loss. In addition, we prove that the association rule mining with differential privacy algorithm satisfies ex post differential privacy, and verify the utility of our association rule mining with differential privacy algorithm through a series of experiments. To the best of our knowledge, our work is the first differentially private association rule mining algorithm under multiple support thresholds.

A novel software defect prediction approach via weighted classification based on association rule mining

Analysis of Transaction Database Using Apriori Algorithm. This study examines the use of the Apriori algorithm for analysing transaction databases. The Apriori algorithm is a fundamental technique in data mining that allows for the efficient discovery of frequent patterns and association rules in large datasets. The Apriori algorithm employs a two-step approach. Initially, it identifies frequent items in the database based on a user-defined minimum support threshold. Subsequently, it generates association rules that describe relationships between these frequent items based on metrics such as confidence and lift. This paper provides an in-depth explanation of the Apriori algorithm, emphasizing its strengths and limitations. Additionally, it presents various applications of the Apriori algorithm in real-world scenarios, such as shopping cart analysis, cross-selling and upselling, and customer segmentation. The significance of this study lies in its comprehensive analysis of the Apriori algorithm and its practical relevance in diverse data mining tasks. It serves as a valuable resource for researchers, practitioners, and anyone seeking to understand the fundamentals and applications of association rule mining. Keywords: Datamining, OLTP, Apriori algorithm, Item sets and Market Basket Analysis

In the recent years, the growth of online marketplace explodes and has become the new norm of shopping. Access to the internet allows consumers to visit local and global online marketplace. By using online shopping, consumers can view the latest products and comparing products' prices. Online marketplace offers flexibility and eases consumers in so many ways. On the contrary, it also has some limitations. Dynamic pricing allows sellers to enhance their marketing strategy by ensuring price competitive with other sellers. The frequent occurrence of real-time price changing limits the user to get the best deal. This paper discusses the analysis of price changes using Association Rule Mining. Price-ChARM finds a frequent pattern of price changes in corresponding to different timelines. On the online marketplace, due to multiple sellers can sell the same item with different offers such as delivery speed and dynamic pricing, the comparison can be quite tricky. We collected data from two well-known portals and we represent the dataset as set of prices for different products for the purpose of frequent itemset mining. We implement the Apriori algorithm and use a total amount of 3,960 records. We generate association rules from the frequent itemsets found in the records and visualize the confidence of 0.9 rules. The association rules represent the pattern of price changes in the portals. This study eases consumer shopping experiences by understanding the trend of price changes to provide a better decision in making a purchase. Â