• Title/Summary/Keyword: k-평균군집방법

Search Result 192, Processing Time 0.027 seconds

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.

MRI Data Segmentation Using Fuzzy C-Mean Algorithm with Intuition (직관적 퍼지 C-평균 모델을 이용한 자기 공명 영상 분할)

  • Kim, Tae-Hyun;Park, Dong-Chul;Jeong, Tai-Kyeong;Lee, Yun-Sik;Min, Soo-Young
    • Journal of IKEEE
    • /
    • v.15 no.3
    • /
    • pp.191-197
    • /
    • 2011
  • An image segmentation model using fuzzy c-means with intuition (FCM-I) model is proposed for the segmentation of magnetic resonance image in this paper. In FCM-I, a measurement called intuition level is adopted so that the intuition level helps to alleviate the effect of noises. A practical magnetic resonance image data set is used for image segmentation experiment and the performance is compared with those of some conventional algorithms. Results show that the segmentation method based on FCM-I compares favorably to several conventional clustering algorithms. Since FCM-I produces cluster prototypes less sensitive to noises and to the selection of involved parameters than the other algorithms, FCM-I is a good candidate for image segmentation problems.

Effect of Climate Factors on Tree-Ring Growth of Larix leptolepis Distributed in Korea (기후인자가 일본잎갈나무의 연륜생장에 미치는 영향 분석)

  • Lim, Jong Hwan;Sung, Joo Han;Chun, Jung Hwa;Shin, Man Yong
    • Journal of Korean Society of Forest Science
    • /
    • v.105 no.1
    • /
    • pp.122-131
    • /
    • 2016
  • This study was conducted to analyze the effect of climatic variables on tree-ring growth of Larix leptolepis distributed in Korea by dendroclimatological method. For this, annual tree-ring growth data of Larix leptolepis collected by the $5^{th}$ National Forest Inventory were first organized to analyze yearly growth patterns of the species. To explain the relationship between tree-ring growth of Larix leptolepis and climatic variables, monthly temperature and precipitation data from 1950 to 2010 were compared with tree-ring growth data for each county. When tree-ring growth data were analyzed through cluster analysis based on similarity of climatic conditions, six clusters were identified. In addition, index chronology of Larix leptolepis for each cluster was produced through cross-dating and standardization procedures. The adequacy of index chronologies was tested using basic statistics such as mean sensitivity, auto correlation, signal to noise ratio, and expressed population signal of annual tree-ring growth. Response function analysis was finally conducted to reveal the relationship between tree-ring growth and climatic variables for each cluster. The results of this study are expected to provide valuable information necessary for estimating local growth characteristics of Larix leptolepis and for predicting changes in tree growth patterns caused by climate change.

Analysis of deep learning-based deep clustering method (딥러닝 기반의 딥 클러스터링 방법에 대한 분석)

  • Hyun Kwon;Jun Lee
    • Convergence Security Journal
    • /
    • v.23 no.4
    • /
    • pp.61-70
    • /
    • 2023
  • Clustering is an unsupervised learning method that involves grouping data based on features such as distance metrics, using data without known labels or ground truth values. This method has the advantage of being applicable to various types of data, including images, text, and audio, without the need for labeling. Traditional clustering techniques involve applying dimensionality reduction methods or extracting specific features to perform clustering. However, with the advancement of deep learning models, research on deep clustering techniques using techniques such as autoencoders and generative adversarial networks, which represent input data as latent vectors, has emerged. In this study, we propose a deep clustering technique based on deep learning. In this approach, we use an autoencoder to transform the input data into latent vectors, and then construct a vector space according to the cluster structure and perform k-means clustering. We conducted experiments using the MNIST and Fashion-MNIST datasets in the PyTorch machine learning library as the experimental environment. The model used is a convolutional neural network-based autoencoder model. The experimental results show an accuracy of 89.42% for MNIST and 56.64% for Fashion-MNIST when k is set to 10.

An Empirical Comparison and Verification Study on the Containerports Clustering Measurement Using K-Means and Hierarchical Clustering(Average Linkage Method Using Cross-Efficiency Metrics, and Ward Method) and Mixed Models (K-Means 군집모형과 계층적 군집(교차효율성 메트릭스에 의한 평균연결법, Ward법)모형 및 혼합모형을 이용한 컨테이너항만의 클러스터링 측정에 대한 실증적 비교 및 검증에 관한 연구)

  • Park, Ro-Kyung
    • Journal of Korea Port Economic Association
    • /
    • v.34 no.3
    • /
    • pp.17-52
    • /
    • 2018
  • The purpose of this paper is to measure the clustering change and analyze empirical results. Additionally, by using k-means, hierarchical, and mixed models on Asian container ports over the period 2006-2015, the study aims to form a cluster comprising Busan, Incheon, and Gwangyang ports. The models consider the number of cranes, depth, birth length, and total area as inputs and container twenty-foot equivalent units(TEU) as output. Following are the main empirical results. First, ranking order according to the increasing ratio during the 10 years analysis shows that the value for average linkage(AL), mixed ward, rule of thumb(RT)& elbow, ward, and mixed AL are 42.04% up, 35.01% up, 30.47%up, and 23.65% up, respectively. Second, according to the RT and elbow models, the three Korean ports can be clustered with Asian ports in the following manner: Busan Port(Hong Kong, Guangzhou, Qingdao, and Singapore), Incheon Port(Tokyo, Nagoya, Osaka, Manila, and Bangkok), and Gwangyang Port(Gungzhou, Ningbo, Qingdao, and Kasiung). Third, optimal clustering numbers are as follows: AL(6), Mixed Ward(5), RT&elbow(4), Ward(5), and Mixed AL(6). Fourth, empirical clustering results match with those of questionnaire-Busan Port(80%), Incheon Port(17%), and Gwangyang Port(50%). The policy implication is that related parties of Korean seaports should introduce port improvement plans like the benchmarking of clustered seaports.

User-Class based Service Acceptance Policy using Cluster Analysis (군집분석 (Cluster Analysis)을 활용한 사용자 등급 기반의 서비스 수락 정책)

  • Park Hea-Sook;Baik Doo-Kwon
    • The KIPS Transactions:PartD
    • /
    • v.12D no.3 s.99
    • /
    • pp.461-470
    • /
    • 2005
  • This paper suggests a new policy for consolidating a company's profits by segregating the clients using the contents service and allocating the media server's resources distinctively by clusters using the cluster analysis method of CRM, which is mainly applied to marketing. In this case, CRM refers to the strategy of consolidating a company's profits by efficiently managing the clients, providing them with a more effective, personalized service, and managing the resources more effectively. For the realization of a new service policy, this paper analyzes the level of contribution $vis-\acute{a}-vis$ the clients' service pattern (total number of visits to the homepage, service type, service usage period, total payment, average service period, service charge per homepage visit) and profits through the cluster analysis of clients' data applying the K-Means Method. Clients were grouped into 4 clusters according to the contribution level in terms of profits. Likewise, the CRFA (Client Request Filtering algorithm) was suggested per cluster to allocate media server resources. CRFA issues approval within the resource limit of the cluster where the client belongs. In addition, to evaluate the efficiency of CRFA within the Client/Server environment the acceptance rate per class was determined, and an evaluation experiment on network traffic was conducted before and after applying CRFA. The results of the experiments showed that the application of CRFA led to the decrease in network expenses and growth of the acceptance rate of clients belonging to the cluster as well as the significant increase in the profits of the company.

An Analysis on Perception of Mothers about Career for Elementary Science-Gifted Children (초등과학영재 어머니들의 자녀 진로에 대한 인식 분석)

  • Kwon, Yoon-Ah;Kim, Hyo-Nam
    • Journal of The Korean Association For Science Education
    • /
    • v.37 no.4
    • /
    • pp.577-586
    • /
    • 2017
  • The purpose of this study is to try to structuralize the perception of the mothers of science-gifted elementary students using the concept mapping approach. The mothers who participated in this research had children who were 5th and 6th graders selected as science-gifted by a regional education office, a science high school and two national universities in a city. One of the authors interviewed 26 mothers, and extracted 50 general statements of their perceptions about the career path of their children. Ten mothers who participated in interviews sorted a shuffled pack of statement cards. The categorization of the statements into the dissimilarity matrix was carried out by SPSS multidimensional scaling analysis and hierarchical cluster analysis to generate a conceptual diagram. After that 140 mothers rated each statement using a Likert-type response scale from one to five. The result showed six clusters of parental views such as were 'Burden of private education, grades and going to the next grade,' 'Thinking about career guidance in gifted education and school,' 'Parental roles in child career education,' 'Difficulties in career guidance at home,' 'Demand for strengthening the parental capacity for career guidance,' and 'Demand for social support.' 'Demand for social support' obtained the highest sympathy from mothers of elementary science gifted.

A Study on Estimation of Quantile using Regional Scaling Model and Frequency Analysis (빈도해석과 지역 스케일 모델을 이용한 확률강우량 추정에 대한 연구)

  • Jung, Younghun;Kim, Sunghun;Kim, Hanbeen;Heo, Jun-Haeng
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2016.05a
    • /
    • pp.301-301
    • /
    • 2016
  • 국내의 경우 수공구조물을 설계하기 위해서는 빈도해석을 통해 설계수문량을 산정한다. 일반적으로 실무에서는 지점빈도해석을 수행하게 되는데 설계빈도보다 대부분 짧은 기간의 자료를 이용하여 산정한다. 지역빈도해석은 이러한 자료기간이 가지는 문제점을 극복하기 위하여 확률수문량의 정확도와 신뢰도를 향상시키는 기법이다. 스케일 모델은 지속기간별로 관측된 강우자료를 이용하여 재현기간에 대한 지속기간의 함수로 표현이 가능하며, 이를 통해 강우의 IDF곡선을 제시할 수 있는 수학적 모델이다. 대상지역의 강우관측소에서 관측된 강우자료가 일단위이면, 기준지속기간이 24시간이 되며, 기준지속기간에 대한 확률강우량으로부터 임의의 지속기간에 대한 확률강우량을 스케일 모델을 이용하여 추정할 수 있다. 따라서 짧은 자료를 보유한 지역이거나 미계측 지역에 대한 확률강우량을 추정을 위해 지역빈도해석과 지역 스케일 모델을 이용하여 확률강우량을 추정하여 지점빈도해석과 비교하고자 한다. 본 연구를 위해 한강유역의 강우 관측소를 이용하였으며, 군집분석 중 k-means방법을 적용하여 수문학적 동질성을 확보한 후 지역을 구분하였다. 구분된 지역은 지점 및 지역빈도해석을 수행한 후 상대평균제곱근오차(relative root mean square error, RRMSE)를 비교하여 정확도를 판단하였고, 정확도가 높은 빈도해석에 지역 스케일 모델을 적용하여 미계측 지점에 대한 임의의 시간에 대한 확률강우량을 추정하고자 한다.

  • PDF

A Study on Travel Pattern Analysis and Political Application using Transportation Card Data: In Gyeonggi-Do Case (교통카드자료를 이용한 통행패턴분석과 정책활용방안 연구 -경기도를 중심으로-)

  • Bin, Miyoung;Moon, Juback;Joh, Chang-Hyeon
    • Journal of the Economic Geographical Society of Korea
    • /
    • v.15 no.4
    • /
    • pp.615-627
    • /
    • 2012
  • This study analyzed the travel pattern with respect to use of public transportation by using transportation card data and presented the measures that can be used in a traffic policy. Transportation card data targeted Gyeonggi-Do area and as a utilization plan, a scenario that when a traffic policy decision maker improves bus stop facilities, the person selects a target site by using several variables that can be obtained from transportation card data was set and analyzed. The analysis result showed that K means cluster analysis which is decision making methodology and CHAID(Chi-squared automatic interaction detection) were used and it can be used usefully in policies in significance level of p <0.01. Also, based on these results, this study presented policy implications to be improved to actually use transportation card data in policies.

  • PDF

Privacy-Preserving K-means Clustering using Homomorphic Encryption in a Multiple Clients Environment (다중 클라이언트 환경에서 동형 암호를 이용한 프라이버시 보장형 K-평균 클러스터링)

  • Kwon, Hee-Yong;Im, Jong-Hyuk;Lee, Mun-Kyu
    • The Journal of Korean Institute of Next Generation Computing
    • /
    • v.15 no.4
    • /
    • pp.7-17
    • /
    • 2019
  • Machine learning is one of the most accurate techniques to predict and analyze various phenomena. K-means clustering is a kind of machine learning technique that classifies given data into clusters of similar data. Because it is desirable to perform an analysis based on a lot of data for better performance, K-means clustering can be performed in a model with a server that calculates the centroids of the clusters, and a number of clients that provide data to server. However, this model has the problem that if the clients' data are associated with private information, the server can infringe clients' privacy. In this paper, to solve this problem in a model with a number of clients, we propose a privacy-preserving K-means clustering method that can perform machine learning, concealing private information using homomorphic encryption.