• Title/Summary/Keyword: K-평균 군집화 알고리즘

Search Result 64, Processing Time 0.031 seconds

Development of Sensor Position Optimization Algorithm for Container Loss Detection (컨테이너 유실 감지를 위한 센서 위치 최적화 알고리즘 기술 개발)

  • Seong-Hyun Kim;Hyung-Hoon Kim
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2023.11a
    • /
    • pp.337-338
    • /
    • 2023
  • 컨테이너 해상 유실 사고는 매해 적지 않은 수로 발생하고 있으나 기존에는 사후적 대응, 사전 대응 관점의 대응책들이 대부분이다. 그렇기에 항해 간 컨테이너 유실에 대한 모니터링이 필요한데, 선원들이 항해하는 선박에 적재된 수천 개의 컨테이너를 일일이 들여다보거나 모든 곳에 센서를 부착해 감지하는 것에는 물리적, 경제적 한계가 존재한다. 본 연구는 선박에 적재된 컨테이너들을 3차원 좌표 화하여 선박의 경사시험에서 모티브를 가져와 일정 정도의 기울기를 선박에 적용하였을 때, 기울기 중심을 기준으로 회전운동이 가장 큰 좌표에 해당하는 컨테이너들을 K-평균 군집화를 통해 최적화 위치로 선정하여 센서 위치를 최적화시켜 효율적인 컨테이너 유실 감지를 위한 기반을 마련한다.

Knowledge Reasoning Model using Association Rules and Clustering Analysis of Multi-Context (다중상황의 군집분석과 연관규칙을 이용한 지식추론 모델)

  • Shin, Dong-Hoon;Kim, Min-Jeong;Oh, SangYeob;Chung, Kyungyong
    • Journal of the Korea Convergence Society
    • /
    • v.10 no.9
    • /
    • pp.11-16
    • /
    • 2019
  • People are subject to time sanctions in a busy modern society. Therefore, people find it difficult to eat simple junk food and even exercise, which is bad for their health. As a result, the incidence of chronic diseases is increasing. Also, the importance of making accurate and appropriate inferences to individual characteristics is growing due to unnecessary information overload phenomenon. In this paper, we propose a knowledge reasoning model using association rules and cluster analysis of multi-contexts. The proposed method provides a personalized healthcare to users by generating association rules based on the clusters based on multi-context information. This can reduce the incidence of each disease by inferring the risk for each disease. In addition, the model proposed by the performance assessment shows that the F-measure value is 0.027 higher than the comparison model, and is highly regarded than the comparison model.

Blind Channel Estimation through Clustering in Backscatter Communication Systems (후방산란 통신시스템에서 군집화를 통한 블라인드 채널 추정)

  • Kim, Soo-Hyun;Lee, Donggu;Sun, Young-Ghyu;Sim, Issac;Hwang, Yu-Min;Shin, Yoan;Kim, Dong-In;Kim, Jin-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.2
    • /
    • pp.81-86
    • /
    • 2020
  • Ambient backscatter communication has a drawback in which the transmission power is limited because the data is transmitted using the ambient RF signal. In order to improve transmission efficiency between transceiver, a channel estimator capable of estimating channel state at a receiver is needed. In this paper, we consider the K-means algorithm to improve the performance of the channel estimator based on EM algorithm. The simulation uses MSE as a performance parameter to verify the performance of the proposed channel estimator. The initial value setting through K-means shows improved performance compared to the channel estimation method using the general EM algorithm.

Analysis on the Distribution of RF Threats Using Unsupervised Learning Techniques (비지도 학습 기법을 사용한 RF 위협의 분포 분석)

  • Kim, Chulpyo;Noh, Sanguk;Park, So Ryoung
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.19 no.3
    • /
    • pp.346-355
    • /
    • 2016
  • In this paper, we propose a method to analyze the clusters of RF threats emitting electrical signals based on collected signal variables in integrated electronic warfare environments. We first analyze the signal variables collected by an electronic warfare receiver, and construct a model based on variables showing the properties of threats. To visualize the distribution of RF threats and reversely identify them, we use k-means clustering algorithm and self-organizing map (SOM) algorithm, which are belonging to unsupervised learning techniques. Through the resulting model compiled by k-means clustering and SOM algorithms, the RF threats can be classified into one of the distribution of RF threats. In an experiment, we measure the accuracy of classification results using the algorithms, and verify the resulting model that could be used to visually recognize the distribution of RF threats.

Korean Onomatopoeia Clustering for Sound Database (음향 DB 구축을 위한 한국어 의성어 군집화)

  • Kim, Myung-Gwan;Shin, Young-Suk;Kim, Young-Rye
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.9
    • /
    • pp.1195-1203
    • /
    • 2008
  • Onomatopoeia of korean documents is to represent from natural or artificial sound to human language and it can express onomatopoeia language which is the nearest an object and also able to utilize as standard for clustering of Multimedia data. In this study, We get frequency of onomatopoeia in the experiment subject and select 100 onomatopoeia of use to our study In order to cluster onomatopoeia's relation, we extract feature of similarity and distance metric and then represent onomatopoeia's relation on vector space by using PCA. At the end, we can clustering onomatopoeia by using k-means algorithm.

  • PDF

Development of Monitoring System for the LNG plant fractionation process based on Multi-mode Principal Component Analysis (다중모드 주성분분석에 기반한 천연가스 액화플랜트의 성분 분리공정 감시 시스템 개발)

  • Pyun, Hahyung;Lee, Chul-Jin;Lee, Won Bo
    • Journal of the Korean Institute of Gas
    • /
    • v.23 no.4
    • /
    • pp.19-27
    • /
    • 2019
  • The consumption of liquefied natural gas (LNG) has increased annually due to the strengthening of international environmental regulations. In order to produce stable and efficient LNG, it is essential to divide the global (overall) operating condition and construct a quick and accurate monitoring system for each operation condition. In this study, multi-mode monitoring system is proposed to the LNG plant fractionation process. First, global normal operation data is divided to local (subdivide) normal operation data using global principal component analysis (PCA) and k-means clustering method. And then, the data to be analyzed were matched with the local normal mode. Finally, it is determined the state of process abnormality through the local PCA. The proposed method is applied to 45 fault case and it proved to be more than 5~10% efficient compared to the global PCA and univariate monitoring.

Processing large-scale data with Apache Spark (Apache Spark를 활용한 대용량 데이터의 처리)

  • Ko, Seyoon;Won, Joong-Ho
    • The Korean Journal of Applied Statistics
    • /
    • v.29 no.6
    • /
    • pp.1077-1094
    • /
    • 2016
  • Apache Spark is a fast and general-purpose cluster computing package. It provides a new abstraction named resilient distributed dataset, which is capable of support for fault tolerance while keeping data in memory. This type of abstraction results in a significant speedup compared to legacy large-scale data framework, MapReduce. In particular, Spark framework is suitable for iterative machine learning applications such as logistic regression and K-means clustering, and interactive data querying. Spark also supports high level libraries for various applications such as machine learning, streaming data processing, database querying and graph data mining thanks to its versatility. In this work, we introduce the concept and programming model of Spark as well as show some implementations of simple statistical computing applications. We also review the machine learning package MLlib, and the R language interface SparkR.

Performance Improvement of Radial Basis Function Neural Networks Using Adaptive Feature Extraction (적응적 특징추출을 이용한 Radial Basis Function 신경망의 성능개선)

  • 조용현
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.3
    • /
    • pp.253-262
    • /
    • 2000
  • This paper proposes a new RBF neural network that determines the number and the center of hidden neurons based on the adaptive feature extraction for the input data. The principal component analysis is applied for extracting adaptively the features by reducing the dimension of the given input data. It can simultaneously achieve a superior property of both the principal component analysis by mapping input data into set of statistically independent features and the RBF neural networks. The proposed neural networks has been applied to classify the 200 breast cancer databases by 2-class. The simulation results shows that the proposed neural networks has better performances of the learning time and the classification for test data, in comparison with those using the k-means clustering algorithm. And it is affected less than the k-means clustering algorithm by the initial weight setting and the scope of the smoothing factor.

  • PDF

Principal Components Self-Organizing Map PC-SOM (주성분 자기조직화 지도 PC-SOM)

  • 허명회
    • The Korean Journal of Applied Statistics
    • /
    • v.16 no.2
    • /
    • pp.321-333
    • /
    • 2003
  • Self-organizing map (SOM), a unsupervised learning neural network, has been developed by T. Kohonen since 1980's. Main application areas were pattern recognition and text retrieval. Because of that, it has not been spread to statisticians until late. Recently, SOM's are frequently drawn in data mining fields. Kohonen's SOM, however, needs improvements to become a statistician's standard tool. First, there should be a good guideline as for the size of map. Second, an enhanced visualization mode is wanted. In this study, principal components self-organizing map (PC-SOM), a modification of Kohonen's SOM, is proposed to meet such needs. PC-SOM performs one-dimensional SOM during the first stage to decompose input units into node weights and residuals. At the second stage, another one-dimensional SOM is applied to the residuals of the first stage. Finally, by putting together two stages, one obtains two-dimensional SOM. Such procedure can be easily expanded to construct three or more dimensional maps. The number of grid lines along the second axis is determined automatically, once that of the first axis is given by the data analyst. Furthermore, PC-SOM provides easily interpretable map axes. Such merits of PC-SOM are demonstrated with well-known Fisher's iris data and a simulated data set.

Determination of Tumor Boundaries on CT Images Using Unsupervised Clustering Algorithm (비교사적 군집화 알고리즘을 이용한 전산화 단층영상의 병소부위 결정에 관한 연구)

  • Lee, Kyung-Hoo;Ji, Young-Hoon;Lee, Dong-Han;Yoo, Seoung-Yul;Cho, Chul-Koo;Kim, Mi-Sook;Yoo, Hyung-Jun;Kwon, Soo-Il;Chun, Jun-Chul
    • Journal of Radiation Protection and Research
    • /
    • v.26 no.2
    • /
    • pp.59-66
    • /
    • 2001
  • It is a hot issue to determine the spatial location and shape of tumor boundary in fractionated stereotactic radiotherapy (FSRT). We could get consecutive transaxial plane images from the phantom (paraffin) and 4 patients with brain tumor using helical computed tomography(HCT). K-means classification algorithm was adjusted to change raw data pixel value in CT images into classified average pixel value. The classified images consists of 5 regions that ate tumor region (TR), normal region (NR), combination region (CR), uncommitted region (UR) and artifact region (AR). The major concern was how to separate the normal region from tumor region in the combination area. Relative average deviation analysis was adjusted to alter average pixel values of 5 regions into 2 regions of normal and tumor region to define maximum point among average deviation pixel values. And then we drawn gross tumor volume (GTV) boundary by connecting maximum points in images using semi-automatic contour method by IDL(Interactive Data Language) program. The error limit of the ROI boundary in homogeneous phantom is estimated within ${\pm}1%$. In case of 4 patients, we could confirm that the tumor lesions described by physician and the lesions described automatically by the K-mean classification algorithm and relative average deviation analyses were similar. These methods can make uncertain boundary between normal and tumor region into clear boundary. Therefore it will be useful in the CT images-based treatment planning especially to use above procedure apply prescribed method when CT images intermittently fail to visualize tumor volume comparing to MRI images.

  • PDF