SEGMENTASI PENGGUNA E-WALLET DENGAN MENGGUNAKAN METODE DBSCAN (DENSITY BASED SPATIAL CLUSTERING APPLICATION WITH NOISE) DI KOTA MEDAN

نویسندگان

چکیده

The purpose of this research is to classify digital wallet users in the city Medan using DBSCAN method. method used study analysis. sampling technique uses Quota technique. instrument for collecting data was a questionnaire distributed online. Respondents from 10 sub-districts filled out questionnaire. Next, analysis all carried following steps: collection stage, stage method, and conclusions. results show that: visualization on clustering e-wallet can cluster based type e-wallet, what media top-up purposes used. So that level accuracy case appropriate if we want do find how many there are

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

dbscan: Fast Density-based Clustering with R

This article describes the implementation and use of the R package dbscan, which provides complete and fast implementations of the popular density-based clustering algorithm DBSCAN and the augmented ordering algorithm OPTICS. Compared to other implementations, dbscan offers open-source implementations using C++ and advanced data structures like k-d trees to speed up computation. An important ad...

متن کامل

Density - based clustering algorithms – DBSCAN and SNN

This document describes the implementation of two density-based clustering algorithms: DBSCAN [Ester1996] and SNN [Ertoz2003]. These algorithms were implemented within the context of the LOCAL project [Local2005] as part of a task that aims to create models of the geographic space (Space Models) to be used in context-aware mobile systems. Here, the role of the clustering algorithms is to identi...

متن کامل

DBSCAN ( Density Based Clustering Method with Connective Regions ) - A Survey

Data mining has suit an important in research area because of its ability to get valuable information from the data. The data mining uses various clustering algorithms for grouping related objects. One of the most important clustering algorithm is density based clustering algorithm, which groups the related objects in non linear shapes structure based on the density. But it has the problem of v...

متن کامل

G-DBSCAN: A GPU Accelerated Algorithm for Density-based Clustering

With the advent of Web 2.0, we see a new and differentiated scenario: there is more data than that can be effectively analyzed. Organizing this data has become one of the biggest problems in Computer Science. Many algorithms have been proposed for this purpose, highlighting those related to the Data Mining area, specifically the clustering algorithms. However, these algorithms are still a compu...

متن کامل

Multidimensi Pada Data Warehouse Dengan Menggunakan Rumus Kombinasi

Multidimensional in data warehouse is a compulsion and become the most important for information delivery, without multidimensional data warehouse is incomplete. Multidimensional give the able to analyze business measurement in many different ways. Multidimensional is also synonymous with online analytical processing (OLAP).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Jurnal Lebesgue

سال: 2023

ISSN: ['2721-8929', '2721-8937']

DOI: https://doi.org/10.46306/lb.v4i2.415