scholarly journals IMPLEMENTASI DATA MINING DALAM ANALISA POLA PEMINJAMAN BUKU DI PERPUSTAKAAN MENGGUNAKAN METODE ASSOCIATION RULE

JURTEKSI ◽  
2019 ◽  
Vol 5 (1) ◽  
pp. 89-96
Author(s):  
Edi Kurniawan

Abstract: The library is one of the most important means to add insight and knowledge to everyone. In general, borrowing transaction data books that exist in a library are only left to accumulate by the library in the database without any utilization or further processing of the data that has long been stored. By utilizing the Data Mining technique using association rules with FP-Growth, these data will be very useful. Because from the data lending books to the library, new information can be gleaned about what books are often borrowed and know the pattern of relationships between books that have been borrowed together so that later it can be used to compile books in accordance with the existing borrowing patterns so that they can facilitate library visitors in the process of finding books. Keywords: Data Mining, Association Rule, FP-Growth, Library Abstrak: Perpustakaan merupakan salah satu sarana yang sangat penting untuk menambah wawasan dan keilmuan setiap orang. Pada umumnya data transaksi peminjaman buku yang ada pada sebuah perpustakaan hanya dibiarkan saja menumpuk oleh pihak perpustakaan di dalam database tanpa ada pemanfaatan atau pengolahan lebih lanjut dari data-data yang telah lama tersimpan tersebut. Dengan melakukan pemanfaatan menggunakan Teknik Data Mining metode association rules dengan FP-Growth, data-data tersebut akan jadi sangat bermanfaat. Karena dari data peminjaman buku pada perpustakaan tersebut dapat diggali informasi baru tentang buku-buku apa yang sering dipinjam dan mengetahui pola hubungan antara buku yang telah dipinjam secara bersama-sama sehingga nantinya dapat dimanfaatkan untuk melakukan penyusunan buku sesuai dengan pola peminjaman buku yang ada sehingga dapat mempermudah para pengunjung perpustakaan dalam proses pencarian buku. Kata Kunci : Data Mining, Asociation Rule, FP-Growth, Perpustakaan

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.


2021 ◽  
Vol 5 (2) ◽  
pp. 112-121
Author(s):  
Guntoro Guntoro ◽  
Charles Parmonangan Hutabarat

Many individuals are interested in starting a workshop. By responding to each customer's desires, the workshop company may continue to develop, and so the data mining technique can address this challenge. The FP-Growth algorithm is one of the methods that may be used to determine the stock availability of automotive spare components such as engine oil, spark plugs, oil filters, ac filters, batteries, tires, and so on. This research is divided into four stages: problem identification, data gathering, data processing, and data testing. Based on the results of the testing, AK (Battery), OM (Engine Oil), and BS (Spark plug) received support values of 33% and 80%, respectively. Furthermore, the BN (Ban) and KR (Kampas Bram) values were found with 33% support and 80% confidence. Furthermore, we obtain AK (Battery) and OM (Engine Oil) with 33% support and 80% confidence, and BN (Tires) and OM (Engine Oil) with 33% support and 80% confidence. OM (Engineering Oil), AK (Battery), and BS (Battery Storage) are the abbreviations for the terms OM (Engineering Oil), AK (Battery), and BS (Battery (Spark plug)).


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):  
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):  
SACHIN KAMBEY ◽  
R. S. THAKUR ◽  
SHAILESH JALORI

Stock market prediction with data mining technique is one of the most important issues to be investigated and it is one of the fascinating issues of stock market research over the past decade. Many attempts have been made to predict stock market data using statistical and traditional methods, but these methods are no longer adequate for analyzing this huge amount of data. Data mining is one of most important powerful information technology tool in today’s competitive business world, it is able to uncover hidden patterns and predict future trends and behavior in stock market. This paper also highlights the application of association rule in stock market and their future movement direction.


Author(s):  
Suma B. ◽  
Shobha G.

<div>Association rule mining is a well-known data mining technique used for extracting hidden correlations between data items in large databases. In the majority of the situations, data mining results contain sensitive information about individuals and publishing such data will violate individual secrecy. The challenge of association rule mining is to preserve the confidentiality of sensitive rules when releasing the database to external parties. The association rule hiding technique conceals the knowledge extracted by the sensitive association rules by modifying the database. In this paper, we introduce a border-based algorithm for hiding sensitive association rules. The main purpose of this approach is to conceal the sensitive rule set while maintaining the utility of the database and association rule mining results at the highest level. The performance of the algorithm in terms of the side effects is demonstrated using experiments conducted on two real datasets. The results show that the information loss is minimized without sacrificing the accuracy. </div>


2011 ◽  
Vol 26 (3) ◽  
pp. 337-353 ◽  
Author(s):  
Ruixin Yang ◽  
Jiang Tang ◽  
Donglian Sun

Abstract This study applies a data mining technique called association rule mining to the analysis of intensity changes of North Atlantic tropical cyclones (TCs). The “best track” data from the National Hurricane Center and the Statistical Hurricane Intensity Prediction Scheme databases were stratified into tropical depressions, tropical storms, and category 1–5 hurricanes based on the Saffir–Simpson hurricane scale. After stratification, the seven resulting groups of TCs plus two additional aggregation groups were further separated into intensifying, weakening, and stable TCs. The analysis of the stratified data for preprocessing revealed that faster northward storm motion (the meridional component of storm motion) favors tropical storm intensification but does not favor the intensification of hurricanes. Intensifying tropical storms are more strongly associated with a higher convergence in the upper atmosphere (200-hPa relative eddy momentum flux convergence) than weakening tropical storms, while intensifying hurricanes are more strongly associated with lower convergence values. The mined association rules showed that cofactors usually display higher-intensity prediction power in the stratified TC groups. The data mining results also identified a predictor set with fewer factors but improved probabilities of rapid intensification. This study found that the data mining technique not only sheds light on the roles of multiple-associated physical processes in tropical cyclone development—especially in rapid intensification processes—but also will help improve TC intensity forecasting. This paper provides an outline on how to use this data mining technique and how to overcome low occurrences of mined conditions in order to improve TC intensity forecasting capabilities.


Sign in / Sign up

Export Citation Format

Share Document