scholarly journals Penerapan Data Mining Menggunakan Algoritma Apriori untuk Menentukan Pola Penyebab Gelandangan dan Pengemis

2020 ◽  
Vol 7 (2) ◽  
pp. 229
Author(s):  
Wirta Agustin ◽  
Yulya Muharmi
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Urban Areas ◽  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Frequent Itemset ◽  
Frequent Pattern ◽  
Data Sets ◽  
Apriori Algorithm ◽  
Data Set

<p class="Judul2">Gelandangan dan pengemis salah satu masalah yang ada di daerah perkotaan, karena dapat mengganggu ketertiban umum, keamanan, stabilitas dan pembangunan kota. Upaya yang dilakukan saat ini masih fokus pada cara penanganan gelandangan dan pengemis, belum untuk pencegahan. Salah satu cara yang bisa dilakukan adalah dengan menentukan pola usia gelandangan dan pengemis. Algoritma Apriori sebuah metode <em>Association Rule</em> dalam data mining untuk menentukan frequent itemset yang berfungsi membantu menemukan pola dalam sebuah data (<em>frequent pattern mining</em>). Perhitungan manual menggunakan algoritma apriori, menghasilkan pola kombinasi sebanyak 3 rules dengan nilai minimum <em>support</em> sebesar 30% dan nilai <em>confidence</em> tertinggi sebesar 100%. Pengujian penerapan Algoritma Apriori menggunakan aplikasi RapidMiner. RapidMiner salah satu software pengolahan data mining, diantaranya analisis teks, mengekstrak pola-pola dari data set dan mengkombinasikannya dengan metode statistika, kecerdasan buatan, dan database untuk mendapatkan informasi bermutu tinggi dari data yang diolah. Hasil pengujian menunjukkan perbandingan pola usia gelandangan dan pengemis yang berpotensi menjadi gelandangan dan pengemis. Berdasarkan hasil pengujian aplikasi RapidMiner dan hasil perhitungan manual Algoritma Apriori, dapat disimpulkan sesuai kriteria pengujian, bahiwa pola (rules) usia dan nilai confidence (c) hasil perhitungan manual Algoritma Apriori tidak mendekati nilai hasil pengujian menggunakan aplikasi RapidMiner, maka tingkat keakuratan pengujian rendah, yaitu 37.5 %.</p><p class="Judul2"> </p><p class="Judul2"><strong><em>Abstract </em></strong></p><p class="Judul2"><strong> </strong></p><p><em>Homeless and beggars are one of the problems in urban areas as they possibly disrupt public order, security, stability and urban development. The efforts conducted are still focusing on managing the existing homeless and beggars instead of preventing the potential ones. One of the methods used for solving this problem is Algoritma Apriori which determines the age pattern of homeless and beggars. Apriori Algorithm is an Association Rule method in data mining to determine frequent item set that serves to help in finding patterns in a data (frequent pattern mining). The manual calculation through Apriori Algorithm obtains combination pattern of 3 rules with a minimum support value of 30% and the highest confidence value of 100%. These patterns were refences for the incharged department in precaution action of homeless and beggars arising numbers. Apriori Algorithm testing uses the RapidMiner application which is one of data mining processing software, including text analysis, extracting patterns from data sets and combining them with statistical methods, artificial intelligence, and databases to obtain high quality information from processed data. Based on the results of the said testing, it can be concluded that the level of accuracy test is low, i.e. 37.5%.</em></p>

scholarly journals Apriori Algorithm through RapidMiner for Age Patterns of Homeless and Beggars

2018 ◽  
Vol 1 (2) ◽  
pp. 86
Author(s):  
Wirta Agustin ◽  
Yulya Muharmi
Keyword(s):  
Data Mining ◽  
Urban Areas ◽  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Frequent Pattern ◽  
Data Sets ◽  
Apriori Algorithm ◽  
Age Patterns ◽  
Rule Method ◽  
Algorithm Implementation

Homeless and beggars are one of the problems in urban areas because they can interfere public order, security, stability and urban development. The efforts conducted are still focused on how to manage homeless and beggars, but not for the prevention. One method that can be done to solve this problem is by determining the age pattern of homeless and beggars by implementing Algoritma Apriori. Apriori Algorithm is an Association Rule method in data mining to determine frequent item set that serves to help in finding patterns in a data (frequent pattern mining). The manual calculation through Apriori Algorithm obtaines combination pattern of 11 rules with a minimum support value of 25% and the highest confidence value of 100%. The evaluation of the Apriori Algorithm implementation is using the RapidMiner. RapidMiner application is one of the data mining processing software, including text analysis, extracting patterns from data sets and combining them with statistical methods, artificial intelligence, and databases to obtain high quality information from processed data. The test results showed a comparison of the age patterns of homeless and beggars who had the potential to become homeless and beggars from of testing with the RapidMiner application and manual calculations using the Apriori Algorithm.

scholarly journals PENERAPAN DATA MINING MENGGUNAKAN ALGORITMA APRIORI UNTUK MENENTUKAN POLA GOLONGAN PENYANDANG MASALAH KESEJAHTERAAN SOSIAL

Sebatik ◽  
2022 ◽  
Vol 26 (1) ◽  
Author(s):  
Irwan Adji Darmawan ◽  
Muhammad Fakhri Randy ◽  
Imam Yunianto ◽  
Muhamad Malik Mutoffar ◽  
M Tio Putra Salis
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Frequent Itemset ◽  
Frequent Pattern ◽  
Data Set ◽  
Minimum Support

Penyandang Masalah Kesejahteraan Sosial (PMKS) menjadi satu dari sekian masalah yang terdapat di daerah perkotaan, sebab dapat mengganggu pembangunan kota, ketertiban umum, keamanan dan stabilitas. Sejauh ini langkah yang dilakukan sementara masih terfokus dengan cara penanganan PMKS, masih belum mengarah untuk mencegah. Menentukan pola golongan PMKS merupakan salah satu cara yang dapat dilakukan. Algoritma Apriori memiliki fungsi untuk membantu menemukan pola yang terdapat pada data (frequent pattern mining) untuk menentukan frequent itemset yang menggunakan metode Association Rule dalam data mining. Dalam penghitungan secara manual yang dilakukan maka didapat pola kombinasi antara lain 3 rules yang memiliki nilai minimum support 15% dengan confidence tertinggi 100% menggunakan Algoritma Apriori. Dalam menguji Algoritma Apriori digunakan aplikasi RapidMiner. RapidMiner merupakan satu dari beberapa software pengolah data mining, misalnya menganalisis teks, mengekstrak pola data set kemudian dikombinasikan menggunakan metode statistik, database, dan kecerdasan buatan agar didapat informasi yang tinggi berasal dari olahan data. Hasil yang didapat dari pengujian perbandingan pola antar golongan PMKS. Dari pengujian menggunakan aplikasi RapidMiner dan penghitungan secara manual Algoritma Apriori, maka disimpulkan dengan kriteria pengujian, bahwa pola (rules) golongan dengan nilai confidence (c) penghitungan manual Algoritma Apriori dapat dibilang tidak mendekati hasil pengujian aplikasi RapidMiner, maka dapat dikatakan tingkat keakuratan pengujian rencah, hanya 37,5%.

Research into the Algorithm of Frequent Pattern Mining Based on across Linker

2012 ◽  
Vol 195-196 ◽  
pp. 984-986
Author(s):  
Ming Ru Zhao ◽  
Yuan Sun ◽  
Jian Guo ◽  
Ping Ping Dong
Keyword(s):  
Data Mining ◽  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Frequent Itemsets ◽  
Frequent Pattern ◽  
Apriori Algorithm ◽  
Important Data ◽  
Classical Algorithm ◽  
Frequent Itemsets Mining ◽  
Mining Frequent Itemsets

Frequent itemsets mining is an important data mining task and a focused theme in data mining research. Apriori algorithm is one of the most important algorithm of mining frequent itemsets. However, the Apriori algorithm scans the database too many times, so its efficiency is relatively low. The paper has therefore conducted a research on the mining frequent itemsets algorithm based on a across linker. Through comparing with the classical algorithm, the improved algorithm has obvious advantages.

Bi-Directional Constraint Pushing in Frequent Pattern Mining

2011 ◽  
pp. 32-56
Author(s):  
Osmar R. Zaïane ◽  
Mohammed El-Hajj
Keyword(s):  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Large Data ◽  
Frequent Itemset ◽  
Frequent Pattern ◽  
Frequent Itemset Mining ◽  
Data Sets ◽  
Itemset Mining ◽  
Transactional Databases ◽  
The Cost

Frequent Itemset Mining (FIM) is a key component of many algorithms that extract patterns from transactional databases. For example, FIM can be leveraged to produce association rules, clusters, classifiers or contrast sets. This capability provides a strategic resource for decision support, and is most commonly used for market basket analysis. One challenge for frequent itemset mining is the potentially huge number of extracted patterns, which can eclipse the original database in size. In addition to increasing the cost of mining, this makes it more difficult for users to find the valuable patterns. Introducing constraints to the mining process helps mitigate both issues. Decision makers can restrict discovered patterns according to specified rules. By applying these restrictions as early as possible, the cost of mining can be constrained. For example, users may be interested in purchases whose total price exceeds $100, or whose items cost between $50 and $100. In cases of extremely large data sets, pushing constraints sequentially is not enough and parallelization becomes a must. However, specific design is needed to achieve sizes never reported before in the literature.

scholarly journals Mining of High Value Item Sets with Negative Utility

2019 ◽  
Vol 8 (9) ◽  
pp. 3489-3493
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
User Preferences ◽  
Frequent Pattern ◽  
Rule Mining ◽  
Utility Mining ◽  
Real World Application ◽  
Frequent Items

The patterns generated by frequent pattern mining aims to find the frequent items without considering the utilities of the different items. The traditional association rule mining treats all items to be of equal utility. This is not always the case for a real world application. Utility based data mining is a new area of research and is complementing the frequency based approach. The main objective of Utility Mining is to identify the item sets with highest utilities, by considering profit, quantity, cost or other user preferences as the Utility of the item. Recent approaches developed so far considers the utilities of items to be same over a particular period of time. In our approach we have proposed that the utility of items vary over a period of time. Our work also proposed that the utility of items may also assume negative values. Our work thus treats the data mining in more realistic manner

scholarly journals An efficient apriori algorithm for frequent pattern mining using mapreduce in healthcare data

2021 ◽  
Vol 10 (1) ◽  
pp. 390-403
Author(s):  
M. Sornalakshmi ◽  
S. Balamurali ◽  
M. Venkatesulu ◽  
M. Navaneetha Krishnan ◽  
Lakshmana Kumar Ramasamy ◽  
...  
Keyword(s):  
Data Mining ◽  
Pattern Mining ◽  
Data Transfer ◽  
Data Extraction ◽  
Frequent Pattern Mining ◽  
Frequent Pattern ◽  
Apriori Algorithm ◽  
Healthcare Organizations ◽  
Healthcare Data ◽  
Manual Tasks

The development for data mining technology in healthcare is growing today as knowledge and data mining are a must for the medical sector. Healthcare organizations generate and gather large quantities of daily information. Use of IT allows for the automation of data mining and information that help to provide some interesting patterns which remove manual tasks and simple data extraction from electronic records, a process of electronic data transfer which secures medical records, saves lives and cuts the cost of medical care and enables early detection of infectious diseases. In this research paper an improved Apriori algorithm names Enhanced Parallel and Distributed Apriori (EPDA) is presented for the health care industry, based on the scalable environment known as Hadoop MapReduce. The main aim of the work proposed is to reduce the huge demands for resources and to reduce overhead communication when frequent data are extracted, through split-frequent data generated locally and the early removal of unusual data. The paper shows test results, whereby the EPDA performs in terms of the time and number of rules generated with a database of healthcare and different minimum support values.

scholarly journals Evaluation of Frequent Itemset Mining Algorithms-Apriori and FP Growth

2020 ◽  
Vol 4 (6) ◽  
pp. 1-4
Author(s):  
Jismy Joseph ◽  
Kesavaraj G
Keyword(s):  
Pattern Mining ◽  
Frequent Pattern Mining ◽  
Frequent Itemset ◽  
Frequent Pattern ◽  
Frequent Itemset Mining ◽  
Frequent Patterns ◽  
Apriori Algorithm ◽  
Itemset Mining ◽  
Mining Algorithms ◽  
Time And Space Complexity

Nowadays the Frequentitemset mining (FIM) is an essential task for retrieving frequently occurring patterns, correlation, events or association in a transactional database. Understanding of such frequent patterns helps to take substantial decisions in decisive situations. Multiple algorithms are proposed for finding such patterns, however the time and space complexity of these algorithms rapidly increases with number of items in a dataset. So it is necessary to analyze the efficiency of these algorithms by using different datasets. The aim of this paper is to evaluate theperformance of frequent itemset mining algorithms, Apriori and Frequent Pattern (FP) growth by comparing their features. This study shows that the FP-growth algorithm is more efficient than the Apriori algorithm for generating rules and frequent pattern mining.

scholarly journals PENERAPAN DATA MINING MENGGUNAKAN METODE ASSICIATION RULE DENGAN ALGORITMA APRIORI UNTUK ANALISA POLA PENJUALAN BARANG

JURTEKSI ◽  
2019 ◽  
Vol 5 (2) ◽  
pp. 193-198
Author(s):  
Yori Apridonal M ◽  
Wirdah Choiriah ◽  
Akmal Akmal
Keyword(s):  
Data Mining ◽  
Association Rule ◽  
Frequent Itemset ◽  
Apriori Algorithm ◽  
Data Set ◽  
Processing Data ◽  
New Information ◽  
Alternative Algorithm ◽  
Rule Method ◽  
Events Data

Abstract: Fantasy Kids is a children's clothing distribution in the Bangkinang area, Kampar Regency, Riau. In its operations, distros sell their products to the general public, including the sale of children's shirts, children's shirts, jackets or children's sweaters which are usually sold in other distros. These distributions carry out product updates at certain events. Data Mining is the development or discovery of new information by looking for certain patterns or rules of a large amount of data expected to overcome these conditions. The method that will be used in the construction of this application is the Association Rule method with the Apriori Algorithm. Association Rule method is a procedure to find relationships between items in a specified data set. In determining a Association Rule, there is a measure of trust obtained from the results of processing data with certain calculations. Apriori Algorithm is an alternative Algorithm that can be used to determine the frequent itemset in a data set. Keywords : Data Mining, Algoritma, Apriori, Association Rule, Sales, Distro  Abstrak: Fantasy Kids merupakan sebuah distro baju anak-anak di kawasan Bangkinang, Kabupaten Kampar, Riau. Dalam operasionalnya, distro menjual produknya kepada masyarakat umum meliputi penjualan kaos anak, kemeja anak, bag, jaket atau sweater anak yang biasa dijual di distro-distro lainnya. Distro ini melakukan pembaruan produk pada event tertentu. Data Mining merupakan pegembangan atau penemuan informasi baru dengan mencari pola atau aturan tertentu dari sejumlah data dalam jumlah besar diharapkan dapat mengatasi kondisi tersebut. Metode yang akan digunakan dalam pembangunan aplikasi ini adalah metode Association Rule dengan Algoritma Apriori. Metode Association Rule adalah suatu prosedur untuk mencari hubungan antara item dalam suatu kumpulan data yang ditentukan. Dalam menentukan suatu Association Rule, terdapat suatu ukuran kepercayaan yang di dapatkan dari hasil pengolahan data dengan perhitungan tertentu. Algoritma Apriori merupakan salah satu alternatif Algoritma yang dapat digunakan untuk menentukan himpunan data yang paling sering muncul (frequent itemset) dalam suatu kumpulan data. Kata kunci: Data Mining, Algoritma, Apriori, Association Rule, Penjuaan, Distro

Clustering of Time Series Data

2011 ◽  
pp. 258-263
Author(s):  
Anne Denton
Keyword(s):  
Data Mining ◽  
Time Series ◽  
Pattern Mining ◽  
Time Series Data ◽  
Frequent Pattern Mining ◽  
Frequent Pattern ◽  
Series Data ◽  
Science And Engineering ◽  
Data Mining Algorithms ◽  
Mining Algorithms

Time series data is of interest to most science and engineering disciplines and analysis techniques have been developed for hundreds of years. There have, however, in recent years been new developments in data mining techniques, such as frequent pattern mining, that take a different perspective of data. Traditional techniques were not meant for such pattern-oriented approaches. There is, as a result, a significant need for research that extends traditional time-series analysis, in particular clustering, to the requirements of the new data mining algorithms.

Sign in / Sign up

Export Citation Format

Share Document