• Title/Summary/Keyword: DBSCAN

Search Result 65, Processing Time 0.027 seconds

Practical Privacy-Preserving DBSCAN Clustering Over Horizontally Partitioned Data (다자간 환경에서 프라이버시를 보호하는 효율적인 DBSCAN 군집화 기법)

  • Kim, Gi-Sung;Jeong, Ik-Rae
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.20 no.3
    • /
    • pp.105-111
    • /
    • 2010
  • We propose a practical privacy-preserving clustering protocol over horizontally partitioned data. We extend the DBSCAN clustering algorithm into a distributed protocol in which data providers mix real data with fake data to provide privacy. Our privacy-preserving clustering protocol is very efficient whereas the previous privacy-preserving protocols in the distributed environments are not practical to be used in real applications. The efficiency of our privacy-preserving clustering protocol over horizontally partitioned data is comparable with those of privacy-preserving clustering protocols in the non-distributed environments.

Battery thermal runaway cell detection using DBSCAN and statistical validation algorithms (DBSCAN과 통계적 검증 알고리즘을 사용한 배터리 열폭주 셀 탐지)

  • Jingeun Kim;Yourim Yoon
    • The Journal of the Convergence on Culture Technology
    • /
    • v.9 no.5
    • /
    • pp.569-582
    • /
    • 2023
  • Lead-acid Battery is the oldest rechargeable battery system and has maintained its position in the rechargeable battery field. The battery causes thermal runaway for various reasons, which can lead to major accidents. Therefore, preventing thermal runaway is a key part of the battery management system. Recently, research is underway to categorize thermal runaway battery cells into machine learning. In this paper, we present a thermal runaway hazard cell detection and verification algorithm using DBSCAN and statistical method. An experiment was conducted to classify thermal runaway hazard cells using only the resistance values as measured by the Battery Management System (BMS). The results demonstrated the efficacy of the proposed algorithms in accurately classifying thermal runaway cells. Furthermore, the proposed algorithm was able to classify thermal runaway cells between thermal runaway hazard cells and cells containing noise. Additionally, the thermal runaway hazard cells were early detected through the optimization of DBSCAN parameters using a grid search approach.

Corrosion image analysis on galvanized steel by using superpixel DBSCAN clustering algorithm (슈퍼픽셀 DBSCAN 군집 알고리즘을 이용한 용융아연도금 강판의 부식이미지 분석)

  • Kim, Beomsoo;Kim, Yeonwon;Lee, Kyunghwang;Yang, Jeonghyeon
    • Journal of the Korean institute of surface engineering
    • /
    • v.55 no.3
    • /
    • pp.164-172
    • /
    • 2022
  • Hot-dip galvanized steel(GI) is widely used throughout the industry as a corrosion resistance material. Corrosion of steel is a common phenomenon that results in the gradual degradation under various environmental conditions. Corrosion monitoring is to track the degradation progress for a long time. Corrosion on steel plate appears as discoloration and any irregularities on the surface. This study developed a quantitative evaluation method of the rust formed on GI steel plate using a superpixel-based DBSCAN clustering method and k-means clustering from the corroded area in a given image. The superpixel-based DBSCAN clustering method decrease computational costs, reaching automatic segmentation. The image color of the rusty surface was analyzed quantitatively based on HSV(Hue, Saturation, Value) color space. In addition, two segmentation methods are compared for the particular spatial region using their histograms.

System Theory Approach for Decision Making of GIS-based Optimum Allocation (GIS기반 최적공간선정을 위한 시스템론적 접근)

  • Oh, Sang-Young
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.12
    • /
    • pp.121-127
    • /
    • 2006
  • As information technologies are improving, geographical information system (GIS) technologies are also developing rapidly and demands for spatial analysis with GIS are increasing. Particularly, the spatial analyses with GIS researches have been noted rather than general GIS researches. However, most GIS researches focus on space dimension: a density-based clustering method (DBSCAN) or a DBSCAN algorithm using region expressed as Weight (DBSCAN-W) but the importance of rational decision making based on time dimension has been neglected. This study adopts system dynamics in order to put time dimension in GIS-based optimum allocation.

  • PDF

A Method for Measuring Similarity Measure of Thesaurus Transformation Documents using DBSCAN (DBSCAN을 활용한 유의어 변환 문서 유사도 측정 방법)

  • Kim, Byeongsik;Shin, Juhyun
    • Journal of Korea Multimedia Society
    • /
    • v.21 no.9
    • /
    • pp.1035-1043
    • /
    • 2018
  • There is a case where the core content of another person's work is decorated as though it is his own thoughts by changing own thoughts without showing the source. Plagiarism test of copykiller free service used in plagiarism check is performed by comparing plagiarism more than 6th word. However, it is not enough to judge it as a plagiarism with a six - word match if it is replaced with a similar word. Therefore, in this paper, we construct word clusters by using DBSCAN algorithm, find synonyms, convert the words in the clusters into representative synonyms, and construct L-R tables through L-R parsing. We then propose a method for determining the similarity of documents by applying weights to the thesaurus and weights for each paragraph of the thesis.

[Retracted]Hot Spot Analysis of Tourist Attractions Based on Stay Point Spatial Clustering

  • Liao, Yifan
    • Journal of Information Processing Systems
    • /
    • v.16 no.4
    • /
    • pp.750-759
    • /
    • 2020
  • The wide application of various integrated location-based services (LBS social) and tourism application (app) has generated a large amount of trajectory space data. The trajectory data are used to identify popular tourist attractions with high density of tourists, and they are of great significance to smart service and emergency management of scenic spots. A hot spot analysis method is proposed, based on spatial clustering of trajectory stop points. The DBSCAN algorithm is studied with fast clustering speed, noise processing and clustering of arbitrary shapes in space. The shortage of parameters is manually selected, and an improved method is proposed to adaptively determine parameters based on statistical distribution characteristics of data. DBSCAN clustering analysis and contrast experiments are carried out for three different datasets of artificial synthetic two-dimensional dataset, four-dimensional Iris real dataset and scenic track retention point. The experiment results show that the method can automatically generate reasonable clustering division, and it is superior to traditional algorithms such as DBSCAN and k-means. Finally, based on the spatial clustering results of the trajectory stay points, the Getis-Ord Gi* hotspot analysis and mapping are conducted in ArcGIS software. The hot spots of different tourist attractions are classified according to the analysis results, and the distribution of popular scenic spots is determined with the actual heat of the scenic spots.

Effective Mobile Data Offloading using DBSCAN (DBSCAN을 사용한 효과적인 모바일 데이터 오프로딩)

  • Kim, SeungKeun;Yang, Sung-Bong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2018.05a
    • /
    • pp.81-84
    • /
    • 2018
  • Recently, many researchers claim that mobile data offloading is a key solution to alleviating overloaded cellular traffic by dividing the overloaded traffic with femtocells, WiFi networks or users. In this paper, we propose an idea to select a group of users, known as VIPs, that is able to effectively transfer the data to others using Density-Based Spatial Clustering of Application with Noise, also known as DBSCAN algorithm. We conducted our experiments using NCCU real trace dataset. The results show that our proposed idea offload about 70~77% of the network with VIP set size of four, which is better than the compared methods.

Classification of Subgroups of Solar and Heliospheric Observatory (SOHO) Sungrazing Kreutz Comet Group by the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) Clustering Algorithm

  • Ulkar Karimova;Yu Yi
    • Journal of Astronomy and Space Sciences
    • /
    • v.41 no.1
    • /
    • pp.35-42
    • /
    • 2024
  • Sungrazing comets, known for their proximity to the Sun, are traditionally classified into broad groups like Kreutz, Marsden, Kracht, Meyer, and non-group comets. While existing methods successfully categorize these groups, finer distinctions within the Kreutz subgroup remain a challenge. In this study, we introduce an automated classification technique using the densitybased spatial clustering of applications with noise (DBSCAN) algorithm to categorize sungrazing comets. Our method extends traditional classifications by finely categorizing the Kreutz subgroup into four distinct subgroups based on a comprehensive range of orbital parameters, providing critical insights into the origins and dynamics of these comets. Corroborative analyses validate the accuracy and effectiveness of our method, offering a more efficient framework for understanding the categorization of sungrazing comets.

A group identification algorithm for distinguishing close contacts in ships

  • Lin, Qian-Feng;Son, Joo-Young
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2020.11a
    • /
    • pp.75-77
    • /
    • 2020
  • There was an outbreak of COVID-19 on the Diamond Princess cruise ship. Distinguishing close contacts is the important problem to be addressed. Close contacts mean people who stays with the patients of disease like COVID-19 over a period of time. The passenger position on board can be obtained by indoor positioning technology. The feature of close contacts is similar location with COVID-19 patients. Therefore, this paper proposed the idea of distinguishing close contacts on board based on DBSCAN algorithm.

  • PDF

Unsupervised Learning Model for Fault Prediction Using Representative Clustering Algorithms (대표적인 클러스터링 알고리즘을 사용한 비감독형 결함 예측 모델)

  • Hong, Euyseok;Park, Mikyeong
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.3 no.2
    • /
    • pp.57-64
    • /
    • 2014
  • Most previous studies of software fault prediction model which determines the fault-proneness of input modules have focused on supervised learning model using training data set. However, Unsupervised learning model is needed in case supervised learning model cannot be applied: either past training data set is not present or even though there exists data set, current project type is changed. Building an unsupervised learning model is extremely difficult that is why only a few studies exist. In this paper, we build unsupervised models using representative clustering algorithms, EM and DBSCAN, that have not been used in prior studies and compare these models with the previous model using K-means algorithm. The results of our study show that the EM model performs slightly better than the K-means model in terms of error rate and these two models significantly outperform the DBSCAN model.