scholarly journals DATA MINING DALAM PENGELOMPOKAN JENIS DAN JUMLAH PEMBAGIAN ZAKAT DENGAN MENGGUNAKAN METODE CLUSTERING K-MEANS (STUDI KASUS: BADAN AMIL ZAKAT KOTA BENGKULU)

2018 ◽  
Vol 1 (2) ◽  
pp. 211
Author(s):  
Prahasti Prahasti
Keyword(s):  
Data Mining ◽  
Data Processing ◽  
Clustering Algorithm ◽  
Test Results ◽  
Clustering Method ◽  
Center Point

Abstrack - This research applies data mining by grouping the types and recipients of zakat. The application is done by the k-means clustering algorithm where the data to be entered is grouped by education and type of work in the distribution of zakat. Then a cluster is formed using the centroid value to determine the closest center point of distance between data. In the k-means clustering algorithm data processing is stopped in the iteration count of the data has not changed (fixed data) from the data that has been grouped. The test is done by using the RapidMiner software experiment conducted by the k-means clustering method which consists of input units, data processing units and output units, k-means clustering grouping data 1-2-1-1, 1-2-1-2 and 3-4-3-4. The results obtained from these tests are grouping the distribution of zakat with each cluster not the same. The test results are displayed in slatter graph.  Keywords - Data Mining, K-Means Clusttering, Zakat

scholarly journals Goods Stock Management using the K-Means Algorithm Method

2020 ◽  
Vol 10 (1) ◽  
pp. 22-45
Author(s):  
Dhio Saputra
Keyword(s):  
Data Mining ◽  
Data Processing ◽  
Test Results ◽  
Stock Management ◽  
Clustering Method ◽  
Sales Data ◽  
Using Data ◽  
Cluster 2

The grouping of Mazaya products at PT. Bougenville Anugrah can still do manuals in calculating purchases, sales and product inventories. Requires time and data. For this reason, a research is needed to optimize the inventory of Mazaya goods by computerization. The method used in this research is K-Means Clustering on sales data of Mazaya products. The data processed is the purchase, sales and remaining inventory of Mazaya products in March to July 2019 totaling 40 pieces. Data is grouped into 3 clusters, namely cluster 0 for non-selling criteria, cluster 1 for best-selling criteria and cluster 2 for very best-selling criteria. The test results obtained are cluster 0 with 13 data, cluster 1 with 25 data and cluster 2 with 2 data. So to optimize inventory is to multiply goods in cluster 2, so as to save costs for management of Mazayaproducts that are not available. K-Means clustering method can be used for data processing using data mining in grouping data according to criteria.

scholarly journals Analysis of Data Mining Using K-Means Clustering Algorithm for Product Grouping

2020 ◽  
Vol 3 (1) ◽  
pp. 12-22
Author(s):  
Mohammad Imron ◽  
Uswatun Hasanah ◽  
Bahrul Humaidi
Keyword(s):  
Data Mining ◽  
Data Processing ◽  
Clustering Algorithm ◽  
Processing Technology ◽  
Clustering Method ◽  
Data Mining Techniques ◽  
Sales Data ◽  
Using Data

Rizki Barokah Store is one of the stores that every day sell a variety of basic materials of daily necessities such as food, drinks, snacks, toiletries, and so on. However, some problems occur in the Rizki Barokah Store is often a build-up of product stocks that resulted in the product has expired. This is due to an error in making decisions on the product stock. In addition to these problems, with the amount of sales data stored on the database, the store has not done data mining and grouping to know the potential of the product. Whereas data-processing technology can already be done using data mining techniques. To overcome the period of the land, the technique used in data mining with the clustering method using the algorithm K-means. With the use of these techniques, the purpose of this research is to grouping products based on products of interest and less interest, advise on the stock of products, and know the products of interest and less demand.

Teknik Data Mining Dalam Clustering Produksi Susu Segar Di Indonesia Dengan Algoritma K-Means

2019 ◽  
Vol 1 (1) ◽  
pp. 31-39
Author(s):  
Ilham Safitra Damanik ◽  
Sundari Retno Andani ◽  
Dedi Sehendro
Keyword(s):  
Data Mining ◽  
Milk Production ◽  
Clustering Algorithm ◽  
Clustering Method ◽  
Data Mining Techniques ◽  
Low Level ◽  
Fresh Milk ◽  
Nutritional Needs ◽  
High Level ◽  
Level Cluster

Milk is an important intake to meet nutritional needs. Both consumed by children, and adults. Indonesia has many producers of fresh milk, but it is not sufficient for national milk needs. Data mining is a science in the field of computers that is widely used in research. one of the data mining techniques is Clustering. Clustering is a method by grouping data. The Clustering method will be more optimal if you use a lot of data. Data to be used are provincial data in Indonesia from 2000 to 2017 obtained from the Central Statistics Agency. The results of this study are in Clusters based on 2 milk-producing groups, namely high-dairy producers and low-milk producing regions. From 27 data on fresh milk production in Indonesia, two high-level provinces can be obtained, namely: West Java and East Java. And 25 others were added in 7 provinces which did not follow the calculation of the K-Means Clustering Algorithm, including in the low level cluster.

scholarly journals Application of Digital Mining Facing Information Fusion Technology in the Field of National Costume Culture Design

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Min Yu ◽  
Rongrong Cui
Keyword(s):  
Data Mining ◽  
Internet Of Things ◽  
Data Processing ◽  
Clustering Algorithm ◽  
Laplacian Matrix ◽  
Design System ◽  
Design Effect ◽  
Constraint Matrix ◽  
Clothing Design ◽  
Culture Design

In order to improve the design effect of minority clothing, according to the needs of minority clothing design, this paper uses data mining and Internet of Things technologies to construct an intelligent ethnic clothing design system and builds an intelligent clothing design system that meets customer needs based on the idea of human-computer interaction. In data processing, this paper uses the constraint spectrum clustering algorithm to take the Laplacian matrix and the constraint matrix as input and finally outputs a clustering indicator vector to improve the data processing effect of minority clothing design. Finally, this paper verifies the performance of the system designed in this paper through experiments. From the experimental research, it can be known that the minority clothing design system based on the Internet of Things and data mining constructed in this paper has a certain effect and can effectively improve the minority clothing design effect.

K-Anonymity Algorithm Based on CLIQUE for Green Manufacturing

2013 ◽  
Vol 312 ◽  
pp. 714-718
Author(s):  
Zi Qi Zhao ◽  
Xiao Jun Ye ◽  
Chun Ping Li
Keyword(s):  
Data Processing ◽  
Processing Speed ◽  
Clustering Analysis ◽  
Time Complexity ◽  
Clustering Algorithm ◽  
Green Manufacturing ◽  
Multidimensional Data ◽  
Clustering Method ◽  
Analysis Algorithm ◽  
Clique Algorithm

Multidimensional clustering analysis algorithm is for a class of cell-based clustering method of processing speed quickly, time efficiency, mainly to CLIQUE representatives. With time efficient clustering algorithm CLIQUE algorithm can achieve multi-dimensional k - Anonymous the algorithm KLIQUE, KLIQUE algorithm based CLIQUE efficiently retained their CLIQUE algorithm time complexity of features, can play the CLIQUE multidimensional data for the large amount of data processing advantage.

scholarly journals Clustering Penerima Beasiswa Yayasan Untuk Mahasiswa Menggunakan Metode K-Means

2021 ◽  
Vol 5 (1) ◽  
pp. 258
Author(s):  
Bernadus Gunawan Sudarsono ◽  
Sri Poedji Lestari
Keyword(s):  
Data Mining ◽  
Clustering Algorithm ◽  
Clustering Method ◽  
Scholarship Recipients

Grouping of scholarship recipients Scholarship assistance will be made based on the accumulated value using clustering where the scholarship recipients will be given scholarships with different amounts and sizes, because scholarships from foundations are limited and have levels of distribution. The division of groups to students who receive scholarships from foundations uses the clustering method of data mining where the function of clustering is a cluster or the task of grouping something is using the clustering algorithm approach, namely the K-means algorithm. The results of this clustering show that students based on their groups are divided into four groups based on the number of criteria, the results of the grouping show the number and decision of the foundation on granting foundation scholarships to students.

scholarly journals Dengue Disease Detection using K- Means, Hierarchical, Kohonen- SOM Clustering

2019 ◽  
Vol 8 (10) ◽  
pp. 904-907
Keyword(s):  
Data Mining ◽  
Clustering Algorithm ◽  
Research Work ◽  
Data Mining Algorithm ◽  
Clustering Method ◽  
Dengue Disease ◽  
Related Data ◽  
Som Algorithm ◽  
Som Clustering ◽  
Kohonen Som

Data Mining is the process of extracting useful information. Data Mining is about finding new information from pre-existing databases. It is the procedure of mining facts from data and deals with the kind of patterns that can be mined. Therefore, this proposed work is to detect and categorize the illness of people who are affected by Dengue through Data Mining techniques mainly as the Clustering method. Clustering is the method of finding related groups of data in a dataset and used to split the related data into a group of sub-classes. So, in this research work clustering method is used to categorize the age group of people those who are affected by mosquito-borne viral infection using K-Means and Hierarchical Clustering algorithm and Kohonen-SOM algorithm has been implemented in Tanagra tool. The scientists use the data mining algorithm for preventing and defending different diseases like Dengue disease. This paper helps to apply the algorithm for clustering of Dengue fever in Tanagra tool to detect the best results from those algorithms.

scholarly journals VILLAGE GROUPING BASED ON THE NUMBER OF HEALTH FACILITIES IN WEST JAVA USING K-MEANS CLUSTERING ALGORITHM

2021 ◽  
Vol 4 (1) ◽  
pp. 71-78
Author(s):  
Frieyadie Frieyadie ◽  
Anggie Andriansyah ◽  
Tyas Setiyorini
Keyword(s):  
Data Mining ◽  
Data Processing ◽  
Clustering Algorithm ◽  
National Development ◽  
Health Facilities ◽  
West Java ◽  
The Future ◽  
The Government

Health is very important for the welfare and development of the Indonesian nation because as a capital for the implementation of national development, it is essentially the development of all Indonesian people and the development of all Indonesian people. Due to the outbreak of the Covid-19 virus, many health facilities must be provided for patients. Of course, the government must pay attention to the health facilities that can be used in every district/city in West Java in the future. Therefore, to determine the level of availability of sanitation facilities in each district/city in West Java, we need a technology that can classify data correctly. One method of data processing in data mining is clustering. The application of clustering to this problem can use the K-Means algorithm method to group the most frequently used data. The purpose of this study is to classify sanitation data on the highest sanitation facilities, medium sanitation facilities, and low sanitation facilities, so that areas/cities that are included in the low cluster will receive more attention from the government to improve/provide sanitation facilities.

scholarly journals An effective and efficient hierarchical K-means clustering algorithm

2017 ◽  
Vol 13 (8) ◽  
pp. 155014771772862 ◽  
Author(s):  
Jianpeng Qi ◽  
Yanwei Yu ◽  
Lihong Wang ◽  
Jinglei Liu ◽  
Yingjie Wang
Keyword(s):  
Data Mining ◽  
Clustering Algorithm ◽  
Hierarchical Optimization ◽  
Clustering Method ◽  
Number Of Clusters ◽  
Computation Cost ◽  
Optimization Principle ◽  
Pruning Strategy ◽  
Efficiency And Effectiveness ◽  
Synthetic Datasets

K-means plays an important role in different fields of data mining. However, k-means often becomes sensitive due to its random seeds selecting. Motivated by this, this article proposes an optimized k-means clustering method, named k*-means, along with three optimization principles. First, we propose a hierarchical optimization principle initialized by k* seeds ([Formula: see text]) to reduce the risk of random seeds selecting, and then use the proposed “top- n nearest clusters merging” to merge the nearest clusters in each round until the number of clusters reaches at [Formula: see text]. Second, we propose an “optimized update principle” that leverages moved points updating incrementally instead of recalculating mean and [Formula: see text] of cluster in k-means iteration to minimize computation cost. Third, we propose a strategy named “cluster pruning strategy” to improve efficiency of k-means. This strategy omits the farther clusters to shrink the adjustable space in each iteration. Experiments performed on real UCI and synthetic datasets verify the efficiency and effectiveness of our proposed algorithm.

scholarly journals Computational analysis of incremental clustering approaches for Large Data

2021 ◽  
Vol 15 ◽  
pp. 14-18
Author(s):  
Arun Pratap Singh Kushwah ◽  
Shailesh Jaloree ◽  
Ramjeevan Singh Thakur
Keyword(s):  
Data Mining ◽  
Clustering Algorithm ◽  
Computational Analysis ◽  
Large Data ◽  
Distance Functions ◽  
Spatial Density ◽  
Incremental Clustering ◽  
Clustering Method ◽  
Density Method ◽  
Incremental Approach

Clustering is an approach of data mining, which helps us to find the underlying hidden structure in the dataset. K-means is a clustering method which usages distance functions to find the similarities or dissimilarities between the instances. DBSCAN is a clustering algorithm, which discovers the arbitrary shapes & sizes of clusters from huge volume of using spatial density method. These two approaches of clustering are the classical methods for efficient clustering but underperform when the data is updated frequently in the databases so, the incremental or gradual clustering approaches are always preferred in this environment. In this paper, an incremental approach for clustering is introduced using K-means and DBSCAN to handle the new datasets dynamically updated in the database in an interval.

Sign in / Sign up

Export Citation Format

Share Document