• Title/Summary/Keyword: K-means 클러스터링

Search Result 367, Processing Time 0.027 seconds

Implementation of App System for Personalized Health Information Recommendation (사용자 맞춤형 건강정보 추천 앱 구현)

  • Park, Seong-min;Park, Jeong-soo;Lee, Yoon-kyu;Chae, Woo-Joon;Shin, Moon-sun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2019.05a
    • /
    • pp.316-318
    • /
    • 2019
  • Recently, healthy life has become an issue in an aging society, and the number of people who have been interested in continuous health care for better life is increasing. In this paper, we implemented a personalized recommendation systm to provide convenient healthcare management for user. The PHR (Personal Health Record) of user could be stored in the server along with health related information such as lifestyle, disease, and physical condition. The users could be classified into similar clusters according to the PHR profile in order to provide healthcare contents to the users who had similar PHR profile. K-Means clustering was applied to generate clusters based on PHR profile and ACDT(Ant Colony Decision Tree) algorithm was used to provide personalised recommendation of health information stored in knowledge base. The app system developed in this paper is useful for users to perform healthcare themselves by providing information on serious diseases and lifestyle habits to be improved according to the clusters classified by PHR profile.

  • PDF

Automatic Augmentation Technique of an Autoencoder-based Numerical Training Data (오토인코더 기반 수치형 학습데이터의 자동 증강 기법)

  • Jeong, Ju-Eun;Kim, Han-Joon;Chun, Jong-Hoon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.5
    • /
    • pp.75-86
    • /
    • 2022
  • This study aims to solve the problem of class imbalance in numerical data by using a deep learning-based Variational AutoEncoder and to improve the performance of the learning model by augmenting the learning data. We propose 'D-VAE' to artificially increase the number of records for a given table data. The main features of the proposed technique go through discretization and feature selection in the preprocessing process to optimize the data. In the discretization process, K-means are applied and grouped, and then converted into one-hot vectors by one-hot encoding technique. Subsequently, for memory efficiency, sample data are generated with Variational AutoEncoder using only features that help predict with RFECV among feature selection techniques. To verify the performance of the proposed model, we demonstrate its validity by conducting experiments by data augmentation ratio.

Development of a Model for Dynamic Station Assignmentto Optimize Demand Responsive Transit Operation (수요대응형 모빌리티 최적 운영을 위한 동적정류장 배정 모형 개발)

  • Kim, Jinju;Bang, Soohyuk
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.21 no.1
    • /
    • pp.17-34
    • /
    • 2022
  • This paper develops a model for dynamic station assignment to optimize the Demand Responsive Transit (DRT) operation. In the process of optimization, we use the bus travel time as a variable for DRT management. In addition, walking time, waiting time, and delay due to detour to take other passengers (detour time) are added as optimization variables and entered for each DRT passenger. Based on a network around Anaheim, California, reserved origins and destinations of passengers are assigned to each demand responsive bus, using K-means clustering. We create a model for selecting the dynamic station and bus route and use Non-dominated Sorting Genetic Algorithm-III to analyze seven scenarios composed combination of the variables. The result of the study concluded that if the DRT operation is optimized for the DRT management, then the bus travel time and waiting time should be considered in the optimization. Moreover, it was concluded that the bus travel time, walking time, and detour time are required for the passenger.

Adaptive Security Management Model based on Fuzzy Algorithm and MAUT in the Heterogeneous Networks (이 기종 네트워크에서 퍼지 알고리즘과 MAUT에 기반을 둔 적응적 보안 관리 모델)

  • Yang, Seok-Hwan;Chung, Mok-Dong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.1
    • /
    • pp.104-115
    • /
    • 2010
  • Development of the system which provides services using diverse sensors is expanding due to the widespread use of ubiquitous technology, and the research on the security technologies gaining attention to solve the vulnerability of ubiquitous environment's security. However, there are many instances in which flexible security services should be considered instead of strong only security function depending on the context. This paper used Fuzzy algorithm and MAUT to be aware of the diverse contexts and to propose context-aware security service which provides flexible security function according to the context.

Design of FNN architecture based on HCM Clustering Method (HCM 클러스터링 기반 FNN 구조 설계)

  • Park, Ho-Sung;Oh, Sung-Kwun
    • Proceedings of the KIEE Conference
    • /
    • 2002.07d
    • /
    • pp.2821-2823
    • /
    • 2002
  • In this paper we propose the Multi-FNN (Fuzzy-Neural Networks) for optimal identification modeling of complex system. The proposed Multi-FNNs is based on a concept of FNNs and exploit linear inference being treated as generic inference mechanisms. In the networks learning, backpropagation(BP) algorithm of neural networks is used to updata the parameters of the network in order to control of nonlinear process with complexity and uncertainty of data, proposed model use a HCM(Hard C-Means)clustering algorithm which carry out the input-output dat a preprocessing function and Genetic Algorithm which carry out optimization of model The HCM clustering method is utilized to determine the structure of Multi-FNNs. The parameters of Multi-FNN model such as apexes of membership function, learning rates, and momentum coefficients are adjusted using genetic algorithms. An aggregate performance index with a weighting factor is proposed in order to achieve a sound balance between approximation and generalization abilities of the model. NOx emission process data of gas turbine power plant is simulated in order to confirm the efficiency and feasibility of the proposed approach in this paper.

  • PDF

Extraction of the shape feature according to the risk area of the segmented tumor region based on the small-animal PET (소동물 PET기반 종양분할영역 위험구간변화에 따른 형태특성추출)

  • Lee Joung-Min;Kim Hyeong-Min;Kim Myoung-Hee
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.06b
    • /
    • pp.376-378
    • /
    • 2006
  • 본 논문에서는 소동물 양전자방출단층촬영 영상(Positron Emission Tomography, PET) 내 종양영역을 자동분할하고 분할된 윤곽선주변의 기하학적 위험구간에 따른 종양의 형태특성을 분석하기 위한 방법을 제시한다. PET 영상내 검출된 종양영역의 신뢰성을 위해 위음성(False negative, FN) 및 위양성(False positive, FP)의 위험구간을 같이 제공하는 것이 필요하다. 따라서, 방사선 특이적 특성이 반영된 명암값을 기반으로 Fuzzy C-Means(FCM) 클러스터링을 수행하여 종양영역을 자동 분할한다. 분활된 종양영역의 위험구간은 클러스터 간 공유되는 영역의 소속값을 이용하여 위음성, 위양성을 계산한다. 또한, 임의의 소속값 임계치 변화를 통해 위험구간의 변화에 따른 종양의 형태적 특성변화를 관측한다. 이러한 지역적 변화의 관측을 통해 위험구간의 형태학적 위치를 판단할 수 있어 위험구간에 따른 추가적인 잔여 암의 위치 및 형태 파악을 용이하게 한다.

  • PDF

The Design of Granular-based Radial Basis Function Neural Network by Context-based Clustering (Context-based 클러스터링에 의한 Granular-based RBF NN의 설계)

  • Park, Ho-Sung;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.6
    • /
    • pp.1230-1237
    • /
    • 2009
  • In this paper, we develop a design methodology of Granular-based Radial Basis Function Neural Networks(GRBFNN) by context-based clustering. In contrast with the plethora of existing approaches, here we promote a development strategy in which a topology of the network is predominantly based upon a collection of information granules formed on a basis of available experimental data. The output space is granulated making use of the K-Means clustering while the input space is clustered with the aid of a so-called context-based fuzzy clustering. The number of information granules produced for each context is adjusted so that we satisfy a certain reconstructability criterion that helps us minimize an error between the original data and the ones resulting from their reconstruction involving prototypes of the clusters and the corresponding membership values. In contrast to "standard" Radial Basis Function neural networks, the output neuron of the network exhibits a certain functional nature as its connections are realized as local linear whose location is determined by the values of the context and the prototypes in the input space. The other parameters of these local functions are subject to further parametric optimization. Numeric examples involve some low dimensional synthetic data and selected data coming from the Machine Learning repository.

Disambiguation of Author Names Using Co-citation (동시인용정보를 이용한 동명이인 저자의 중의성 해소)

  • Kang, In-Su
    • Journal of Information Management
    • /
    • v.42 no.3
    • /
    • pp.167-186
    • /
    • 2011
  • Co-citation means that two or more studies are cited together by a later study. This paper deals with the relationship between co-citation and author disambiguation. Author disambiguation is to cluster same-name author instances into real-world individuals. Co-citation may influence author disambiguation in terms that two or more related research works performed by the same person may be co-cited by some later studies. This article describes automated steps to gather co-citation information from Google scholar, and proposes a new clustering algorithm to effectively integrate co-citation information with other author disambiguation features. Experiments showed that co-citation helps to improve the performance of author disambiguation.

VAD By Neural Network Under Wireless Communication Systems (Neural Network을 이용한 무선 통신시스템에서의 VAD)

  • Lee Hosun;Kim Sukyung;Park Sung-Kwon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.12C
    • /
    • pp.1262-1267
    • /
    • 2005
  • Elliptical basis function (EBF) neural network works stably under high-level background noise environment and makes the nonlinear processing possible. It can be adapted real time VAD with simple design. This paper introduces VAD implementation using EBF and the experimental results show that EBF VAD outperforms G729 Annex B and RBF neural networks. The best error rates achieved by the EBF networks were improved more than $70\%$ in speech and $50\%$ in silence while that achieved by G.729 Annex B and RBF networks respectively.

An Analysis of Energy Consumption Types Considering Life Patterns of Single-person Households (1인 가구 거주자의 생활패턴이 고려된 에너지소요량 유형 분석)

  • Lee, Seunghui;Jung, Sungwon;Lim, Ki-Taek
    • Journal of the Architectural Institute of Korea Planning & Design
    • /
    • v.35 no.1
    • /
    • pp.37-46
    • /
    • 2019
  • The energy of the building is influenced by the user 's activity due to the population, society, and economic characteristics of the building user. In order to obtain accurate energy information, the difference in the amount of energy consumption by the activities and characteristics of building users should be identified. The purpose of the study is to identify the difference in the amount of energy consumption by the user's activities in the same building, and to analyse the relationship between user's activities and demographic, social and economic characteristics. For research, energy simulation is performed based on actual user activity schedule. The results of the simulation were clustered by using K-Means clustering, a machine learning technique. As a result, four types of users were derived based on the amount of energy consumption. The more energy used in a cluster, the lower the user's income level and older. The longer a user's indoor activity times, the higher the energy use, and these activities relate to the user's characteristics. There is more than twice the difference between the group that uses the least energy consumption and the group that uses the most energy consumption.