• Title/Summary/Keyword: 군집 통신

Search Result 325, Processing Time 0.026 seconds

Extensions of X-means with Efficient Learning the Number of Clusters (X-means 확장을 통한 효율적인 집단 개수의 결정)

  • Heo, Gyeong-Yong;Woo, Young-Woon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.4
    • /
    • pp.772-780
    • /
    • 2008
  • K-means is one of the simplest unsupervised learning algorithms that solve the clustering problem. However K-means suffers the basic shortcoming: the number of clusters k has to be known in advance. In this paper, we propose extensions of X-means, which can estimate the number of clusters using Bayesian information criterion(BIC). We introduce two different versions of algorithm: modified X-means(MX-means) and generalized X-means(GX-means), which employ one full covariance matrix for one cluster and so can estimate the number of clusters efficiently without severe over-fitting which X-means suffers due to its spherical cluster assumption. The algorithms start with one cluster and try to split a cluster iteratively to maximize the BIC score. The former uses K-means algorithm to find a set of optimal clusters with current k, which makes it simple and fast. However it generates wrongly estimated centers when the clusters are overlapped. The latter uses EM algorithm to estimate the parameters and generates more stable clusters even when the clusters are overlapped. Experiments with synthetic data show that the purposed methods can provide a robust estimate of the number of clusters and cluster parameters compared to other existing top-down algorithms.

A Study on the Distribution of Cold Water Occurrence using K-Means Clustering (K-Means Clustering을 활용한 냉수대 발생 분포에 관한 연구)

  • Kim, Bum-Kyu;Yoon, Hong-Joo;Lee, Jun Ho
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.16 no.2
    • /
    • pp.371-378
    • /
    • 2021
  • In this study, in order to analyze the spatial distribution of cold water occurred in the Southeast Sea of Korea, the K-means clustering method was used to analyze the ocean observatory buoy of Gori and Yangpo and GHTSST Level 4 from 2016 to 2018. The buoy data was used to identify the change in sea water temperature and the cold water occurrence at Gori and Yangpo in the Southeast Sea. As a result, the sea water temperature of Gori and Yangpo decreased equally at the cold water occurrence. Therefore, the reciprocal of the sea water temperature and the variance of SST were compared to see the changes of SST when the cold water occurs. When the reciprocal of the sea water temperature increases, the dispersion of SST also increases. Through this, it can be seen that there is a change in the water temperature distribution of SST in the sea when the cold water occurs. After that, K-means clustering was used to classify the cold water. After analyzing the optimal K value for clustering by using the Elbow method, it was possible to classify a region with cold water. Through this, it is estimated that the spatial distribution and diffusion range of the cold water, and it can be estimated and used in future studies to identify damage caused by the cold water and predict spatial spread.

Influence of Self-driving Data Set Partition on Detection Performance Using YOLOv4 Network (YOLOv4 네트워크를 이용한 자동운전 데이터 분할이 검출성능에 미치는 영향)

  • Wang, Xufei;Chen, Le;Li, Qiutan;Son, Jinku;Ding, Xilong;Song, Jeongyoung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.6
    • /
    • pp.157-165
    • /
    • 2020
  • Aiming at the development of neural network and self-driving data set, it is also an idea to improve the performance of network model to detect moving objects by dividing the data set. In Darknet network framework, the YOLOv4 (You Only Look Once v4) network model was used to train and test Udacity data set. According to 7 proportions of the Udacity data set, it was divided into three subsets including training set, validation set and test set. K-means++ algorithm was used to conduct dimensional clustering of object boxes in 7 groups. By adjusting the super parameters of YOLOv4 network for training, Optimal model parameters for 7 groups were obtained respectively. These model parameters were used to detect and compare 7 test sets respectively. The experimental results showed that YOLOv4 can effectively detect the large, medium and small moving objects represented by Truck, Car and Pedestrian in the Udacity data set. When the ratio of training set, validation set and test set is 7:1.5:1.5, the optimal model parameters of the YOLOv4 have highest detection performance. The values show mAP50 reaching 80.89%, mAP75 reaching 47.08%, and the detection speed reaching 10.56 FPS.

PID-based Consensus and Formation Control of Second-order Multi-agent System with Heterogeneous State Information (이종 상태 정보를 고려한 이차 다개체 시스템의 PID 기반 일치 및 편대 제어)

  • Min-Jae Kang;Han-Ho Tack
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.24 no.2
    • /
    • pp.103-111
    • /
    • 2023
  • Consensus, that aims to converge the states of agents to the same states through information exchanges between agents, has been widely studied to control the multi-agent systems. In real systems, the measurement variables of each agent may be different, the loss of information across communication may occur, and the different networks for each state may need to be constructed for safety. Moreover, the input saturation and the disturbances in the system may cause instability. Therefore, this paper studies the PID(Proportional-Integral-Derivative)-based consensus control to achieve the swarm behavior of the multi-agent systems considering the heterogeneous state information, the input saturations, and the disturbances. Specifically, we consider the multiple follower agents and the single leader agent modeled by the second-order systems, and investigate the conditions to achieve the consensus based on the stability of the error system. It is confirmed that the proposed algorithm can achieve the consensus if only the connectivity of the position graph is guaranteed. Moreover, by extending the consensus algorithm, we study the formation control problem for the multi-agent systems. Finally, the validity of the proposed algorithm was verified through the simulations.

A Comparative Study of IT Outsourcing Research in Korea and China on Author Bibliographic Coupling Analysis (저자서지결합분석을 통한 한중 IT 아웃소싱 연구 비교)

  • Hyoung Jin Min;Sung Sik Park;Yuchen Jin
    • Information Systems Review
    • /
    • v.22 no.4
    • /
    • pp.1-20
    • /
    • 2020
  • This study uses the bibliometric analysis and author bibliographic coupling analysis (ABCA) to analyse the study of IT outsourcing in Korea and China by 2017 and determine the subject areas of the researcher and the intellectual structure which lays the foundation for future researchers in IT outsourcing area. For this study, through the National Digital Science Library (NDSL) of Korea and China Academic Journal network publishing Database (CAJD) of China, it collected the connected documents and found out authors whose work had been published more than twice. ABCA is utilized to visualize the author map which could find out the researchers and areas in meaningful way. The result show that the study of IT outsourcing in Korea came out earlier and developed further than that of China. The study in Korea has already come to the mature period. By contrast, China remains at somewhere between developing period and bottleneck period. The distribution of papers are still in the dispersed state. The author map shows a hot subject area in Korean researchers IT outsourcing strategy is and in chinese scholars IT outsourcing management.

Usefulness of Data Mining in Criminal Investigation (데이터 마이닝의 범죄수사 적용 가능성)

  • Kim, Joon-Woo;Sohn, Joong-Kweon;Lee, Sang-Han
    • Journal of forensic and investigative science
    • /
    • v.1 no.2
    • /
    • pp.5-19
    • /
    • 2006
  • Data mining is an information extraction activity to discover hidden facts contained in databases. Using a combination of machine learning, statistical analysis, modeling techniques and database technology, data mining finds patterns and subtle relationships in data and infers rules that allow the prediction of future results. Typical applications include market segmentation, customer profiling, fraud detection, evaluation of retail promotions, and credit risk analysis. Law enforcement agencies deal with mass data to investigate the crime and its amount is increasing due to the development of processing the data by using computer. Now new challenge to discover knowledge in that data is confronted to us. It can be applied in criminal investigation to find offenders by analysis of complex and relational data structures and free texts using their criminal records or statement texts. This study was aimed to evaluate possibile application of data mining and its limitation in practical criminal investigation. Clustering of the criminal cases will be possible in habitual crimes such as fraud and burglary when using data mining to identify the crime pattern. Neural network modelling, one of tools in data mining, can be applied to differentiating suspect's photograph or handwriting with that of convict or criminal profiling. A case study of in practical insurance fraud showed that data mining was useful in organized crimes such as gang, terrorism and money laundering. But the products of data mining in criminal investigation should be cautious for evaluating because data mining just offer a clue instead of conclusion. The legal regulation is needed to control the abuse of law enforcement agencies and to protect personal privacy or human rights.

  • PDF

Video Analysis System for Action and Emotion Detection by Object with Hierarchical Clustering based Re-ID (계층적 군집화 기반 Re-ID를 활용한 객체별 행동 및 표정 검출용 영상 분석 시스템)

  • Lee, Sang-Hyun;Yang, Seong-Hun;Oh, Seung-Jin;Kang, Jinbeom
    • Journal of Intelligence and Information Systems
    • /
    • v.28 no.1
    • /
    • pp.89-106
    • /
    • 2022
  • Recently, the amount of video data collected from smartphones, CCTVs, black boxes, and high-definition cameras has increased rapidly. According to the increasing video data, the requirements for analysis and utilization are increasing. Due to the lack of skilled manpower to analyze videos in many industries, machine learning and artificial intelligence are actively used to assist manpower. In this situation, the demand for various computer vision technologies such as object detection and tracking, action detection, emotion detection, and Re-ID also increased rapidly. However, the object detection and tracking technology has many difficulties that degrade performance, such as re-appearance after the object's departure from the video recording location, and occlusion. Accordingly, action and emotion detection models based on object detection and tracking models also have difficulties in extracting data for each object. In addition, deep learning architectures consist of various models suffer from performance degradation due to bottlenects and lack of optimization. In this study, we propose an video analysis system consists of YOLOv5 based DeepSORT object tracking model, SlowFast based action recognition model, Torchreid based Re-ID model, and AWS Rekognition which is emotion recognition service. Proposed model uses single-linkage hierarchical clustering based Re-ID and some processing method which maximize hardware throughput. It has higher accuracy than the performance of the re-identification model using simple metrics, near real-time processing performance, and prevents tracking failure due to object departure and re-emergence, occlusion, etc. By continuously linking the action and facial emotion detection results of each object to the same object, it is possible to efficiently analyze videos. The re-identification model extracts a feature vector from the bounding box of object image detected by the object tracking model for each frame, and applies the single-linkage hierarchical clustering from the past frame using the extracted feature vectors to identify the same object that failed to track. Through the above process, it is possible to re-track the same object that has failed to tracking in the case of re-appearance or occlusion after leaving the video location. As a result, action and facial emotion detection results of the newly recognized object due to the tracking fails can be linked to those of the object that appeared in the past. On the other hand, as a way to improve processing performance, we introduce Bounding Box Queue by Object and Feature Queue method that can reduce RAM memory requirements while maximizing GPU memory throughput. Also we introduce the IoF(Intersection over Face) algorithm that allows facial emotion recognized through AWS Rekognition to be linked with object tracking information. The academic significance of this study is that the two-stage re-identification model can have real-time performance even in a high-cost environment that performs action and facial emotion detection according to processing techniques without reducing the accuracy by using simple metrics to achieve real-time performance. The practical implication of this study is that in various industrial fields that require action and facial emotion detection but have many difficulties due to the fails in object tracking can analyze videos effectively through proposed model. Proposed model which has high accuracy of retrace and processing performance can be used in various fields such as intelligent monitoring, observation services and behavioral or psychological analysis services where the integration of tracking information and extracted metadata creates greate industrial and business value. In the future, in order to measure the object tracking performance more precisely, there is a need to conduct an experiment using the MOT Challenge dataset, which is data used by many international conferences. We will investigate the problem that the IoF algorithm cannot solve to develop an additional complementary algorithm. In addition, we plan to conduct additional research to apply this model to various fields' dataset related to intelligent video analysis.

A Study on the Methodology of Extracting the vulnerable districts of the Aged Welfare Using Artificial Intelligence and Geospatial Information (인공지능과 국토정보를 활용한 노인복지 취약지구 추출방법에 관한 연구)

  • Park, Jiman;Cho, Duyeong;Lee, Sangseon;Lee, Minseob;Nam, Hansik;Yang, Hyerim
    • Journal of Cadastre & Land InformatiX
    • /
    • v.48 no.1
    • /
    • pp.169-186
    • /
    • 2018
  • The social influence of the elderly population will accelerate in a rapidly aging society. The purpose of this study is to establish a methodology for extracting vulnerable districts of the welfare of the aged through machine learning(ML), artificial neural network(ANN) and geospatial analysis. In order to establish the direction of analysis, this progressed after an interview with volunteers who over 65-year old people, public officer and the manager of the aged welfare facility. The indicators are the geographic distance capacity, elderly welfare enjoyment, officially assessed land price and mobile communication based on old people activities where 500 m vector areal unit within 15 minutes in Yongin-city, Gyeonggi-do. As a result, the prediction accuracy of 83.2% in the support vector machine(SVM) of ML using the RBF kernel algorithm was obtained in simulation. Furthermore, the correlation result(0.63) was derived from ANN using backpropagation algorithm. A geographically weighted regression(GWR) was also performed to analyze spatial autocorrelation within variables. As a result of this analysis, the coefficient of determination was 70.1%, which showed good explanatory power. Moran's I and Getis-Ord Gi coefficients are analyzed to investigate spatially outlier as well as distribution patterns. This study can be used to solve the welfare imbalance of the aged considering the local conditions of the government recently.

Data processing techniques applying data mining based on enterprise cloud computing (데이터 마이닝을 적용한 기업형 클라우드 컴퓨팅 기반 데이터 처리 기법)

  • Kang, In-Seong;Kim, Tae-Ho;Lee, Hong-Chul
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.8
    • /
    • pp.1-10
    • /
    • 2011
  • Recently, cloud computing which has provided enabling convenience that users can connect from anywhere and user friendly environment that offers on-demand network access to a shared pool of configurable computing resources such as smart-phones, net-books and PDA etc, is to be watched as a service that leads the digital revolution. Now, when business practices between departments being integrated through a cooperating system such as cloud computing, data streaming between departments is getting enormous and then it is inevitably necessary to find the solution that person in charge and find data they need. In previous studies the clustering simplifies the search process, but in this paper, it applies Hash Function to remove the de-duplicates in large amount of data in business firms. Also, it applies Bayesian Network of data mining for classifying the respect data and presents handling cloud computing based data. This system features improved search performance as well as the results Compared with conventional methods and CPU, Network Bandwidth Usage in such an efficient system performance is achieved.

Empirical Research on Search model of Web Service Repository (웹서비스 저장소의 검색기법에 관한 실증적 연구)

  • Hwang, You-Sub
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.4
    • /
    • pp.173-193
    • /
    • 2010
  • The World Wide Web is transitioning from being a mere collection of documents that contain useful information toward providing a collection of services that perform useful tasks. The emerging Web service technology has been envisioned as the next technological wave and is expected to play an important role in this recent transformation of the Web. By providing interoperable interface standards for application-to-application communication, Web services can be combined with component-based software development to promote application interaction and integration within and across enterprises. To make Web services for service-oriented computing operational, it is important that Web services repositories not only be well-structured but also provide efficient tools for an environment supporting reusable software components for both service providers and consumers. As the potential of Web services for service-oriented computing is becoming widely recognized, the demand for an integrated framework that facilitates service discovery and publishing is concomitantly growing. In our research, we propose a framework that facilitates Web service discovery and publishing by combining clustering techniques and leveraging the semantics of the XML-based service specification in WSDL files. We believe that this is one of the first attempts at applying unsupervised artificial neural network-based machine-learning techniques in the Web service domain. We have developed a Web service discovery tool based on the proposed approach using an unsupervised artificial neural network and empirically evaluated the proposed approach and tool using real Web service descriptions drawn from operational Web services repositories. We believe that both service providers and consumers in a service-oriented computing environment can benefit from our Web service discovery approach.