• Title/Summary/Keyword: Optimal clustering

Search Result 363, Processing Time 0.028 seconds

Statistical methods for testing tumor heterogeneity (종양 이질성을 검정을 위한 통계적 방법론 연구)

  • Lee, Dong Neuck;Lim, Changwon
    • The Korean Journal of Applied Statistics
    • /
    • v.32 no.3
    • /
    • pp.331-348
    • /
    • 2019
  • Understanding the tumor heterogeneity due to differences in the growth pattern of metastatic tumors and rate of change is important for understanding the sensitivity of tumor cells to drugs and finding appropriate therapies. It is often possible to test for differences in population means using t-test or ANOVA when the group of N samples is distinct. However, these statistical methods can not be used unless the groups are distinguished as the data covered in this paper. Statistical methods have been studied to test heterogeneity between samples. The minimum combination t-test method is one of them. In this paper, we propose a maximum combinatorial t-test method that takes into account combinations that bisect data at different ratios. Also we propose a method based on the idea that examining the heterogeneity of a sample is equivalent to testing whether the number of optimal clusters is one in the cluster analysis. We verified that the proposed methods, maximum combination t-test method and gap statistic, have better type-I error and power than the previously proposed method based on simulation study and obtained the results through real data analysis.

Implementation of CNN-based classification model for flood risk determination (홍수 위험도 판별을 위한 CNN 기반의 분류 모델 구현)

  • Cho, Minwoo;Kim, Dongsoo;Jung, Hoekyung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.3
    • /
    • pp.341-346
    • /
    • 2022
  • Due to global warming and abnormal climate, the frequency and damage of floods are increasing, and the number of people exposed to flood-prone areas has increased by 25% compared to 2000. Floods cause huge financial and human losses, and in order to reduce the losses caused by floods, it is necessary to predict the flood in advance and decide to evacuate quickly. This paper proposes a flood risk determination model using a CNN-based classification model so that timely evacuation decisions can be made using rainfall and water level data, which are key data for flood prediction. By comparing the results of the CNN-based classification model proposed in this paper and the DNN-based classification model, it was confirmed that it showed better performance. Through this, it is considered that it can be used as an initial study to determine the risk of flooding, determine whether to evacuate, and make an evacuation decision at the optimal time.

KOCED performance evaluation in the wide field of wireless sensor network (무선센서망 내 KOCED 라우팅 프로토콜 광역분야 성능평가)

  • Kim, TaeHyeon;Park, Sea Young;Yun, Dai Yeol;Lee, Jong-Yong;Jung, Kye-Dong
    • The Journal of the Convergence on Culture Technology
    • /
    • v.8 no.2
    • /
    • pp.379-384
    • /
    • 2022
  • In a wireless sensor network, a large number of sensor nodes are deployed in an environment where direct access is difficult. It is difficult to supply power, such as replacing the battery or recharging it. It is very important to use the energy with the sensor node. Therefore, an important consideration to increase the lifetime of the network is to minimize the energy consumption of each sensor node. If the energy of the wireless sensor node is exhausted and discharged, it cannot function as a sensor node. Therefore, it is a method proposed in various protocols to minimize the energy consumption of nodes and maintain the network for a long time. We consider the center point and residual energy of the cluster, and the plot point and K-means (WSN suggests optimal clustering). We want to evaluate the performance of the KOCED protocol. We compare protocols to which the K-means algorithm, one of the latest machine learning methods, is applied, and present performance evaluation factors.

Analysis of Characteristics of NPS Runoff and Pollution Contribution Rate in Songya-stream Watershed (송야천 유역의 비점오염물질 유출 특성 및 오염기여율 분석)

  • Kang Taeseong;Yu Nayeong;Shin Minhwan;Lim Kyoungjae;Park Minji;Park Baekyung;Kim Jonggun
    • Journal of Korean Society on Water Environment
    • /
    • v.39 no.4
    • /
    • pp.316-328
    • /
    • 2023
  • In this study, the characteristics of nonpoint pollutant outflow and contribution rate of pollution in Songya-stream mainstream and tributaries were analyzed. Further, water pollution management and improvement measures for pollution-oriented rivers were proposed. An on-site investigation was conducted to determine the inflow of major pollutants into the basin, and it was found that pollutants generated from agricultural land and livestock facilities flowed into the river, resulting in a high concentration of turbid water. Based on the analysis results of the pollution load data calculated through actual measurement monitoring (flow and water quality) and the occurrence and emission load data calculated using the national pollution source survey data, the S3 and S6 were selected as the concerned pollution tributaries in the Songya-stream basin. Results of cluster analysis using Pearson correlation coefficient evaluation and Density based spatial clustering of applications with noise (DBSCAN) technique showed that the S3 and S6 were most consistent with the C2 cluster (a cluster of Songya-stream mainstream owned area) corresponding to the mainstream of Songya-stream. The analysis results of the major pollutants in the concerned pollution tributaries showed that livestock and land pollutants were the major pollutants. Consequently, optimal management techniques such as fertilizer management, water gate management in paddy, vegetated filter strip and livestock manure public treatment were proposed to reduce livestock and land pollutants.

Recurrent Neural Network Model for Predicting Tight Oil Productivity Using Type Curve Parameters for Each Cluster (군집 별 표준곡선 매개변수를 이용한 치밀오일 생산성 예측 순환신경망 모델)

  • Han, Dong-kwon;Kim, Min-soo;Kwon, Sun-il
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.10a
    • /
    • pp.297-299
    • /
    • 2021
  • Predicting future productivity of tight oil is an important task for analyzing residual oil recovery and reservoir behavior. In general, productivity prediction is made using the decline curve analysis(DCA). In this study, we intend to propose an effective model for predicting future production using deep learning-based recurrent neural networks(RNN), LSTM, and GRU algorithms. As input variables, the main parameters are oil, gas, water, which are calculated during the production of tight oil, and the type curve calculated through various cluster analyzes. the output variable is the monthly oil production. Existing empirical models, the DCA and RNN models, were compared, and an optimal model was derived through hyperparameter tuning to improve the predictive performance of the model.

  • PDF

Development of Intelligent Load Balancing Algorithm in Application of Fuzzy-Neural Network (퍼지-뉴럴 네트워크를 응용한 지능형 로드밸런싱 알고리즘 개발)

  • Chu, Gyo-Soo;Kim, Wan-Yong;Jung, Jae-Yun;Kim, Hag-Bae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.2B
    • /
    • pp.36-43
    • /
    • 2005
  • This paper suggests a method to effectively apply an application model of fuzzy-neural network to the optimal load distribution algorithm, considering the complication and non-linearity of the web server environment. We use the clustering web server in the linux system and it consists of a load balancer that distributes the network loads and some of real servers that processes the load and responses to the client. The previous works considered only with the scrappy decision information such as the connections. That is, since the distribution algorithm depends on the input of the whole network throughput, it was proved inefficient in terms of performance improvement of the web server. With the proposed algorithm, it monitors the whole states of both network input and output. Then, it infers CPU and memory states of each real server and effectively distributes the requests of the clients. In this paper, the proposed model is compared with the previous method through simulations and we analysis the results to develop the optimal and intelligent load balancing model.

Program-level Maintenance Scheduling Support Model for Multiple University Facilities (프로그램레벨 다수 대학시설물 유지보수 일정계획 지원 모델)

  • Chae, Hong-Yun;Cho, Dong-Hyun;Park, Sang-Hun;Bae, Chang-Joon;Koo, Kyo-Jin
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.12
    • /
    • pp.303-312
    • /
    • 2018
  • The university facility is made up of multiple buildings and has many maintenance items. In addition, administrative constraints need to be handled within a limited period. Most maintenance work is small scale and multi-work construction, such as waterproofing, needs to be organized. The facility manager makes annual unit price contract with a maintenance company and carries out the maintenance work. On the other hand, delay and rework is occurring because existing maintenance work performed without scheduling based on the manpower input. This study proposed a scheduling model that can support the facility manager to manage maintenance works of multiple university facilities at the program level. The model consists of three stages in order. In object analysis, details of the maintenance items were analyzed and the quantity is calculated based on the quantity takeoff sheet. In resource analysis, the craftsmen and construction period of detailed works are derived for the effective input of craftsmen. In scheduling, the priority of each work and the optimal manpower input are derived. The optimal schedule is selected according to the goodness of fit. The applicability and effectiveness of the prototype was evaluated through a case study and interviews with case participants. The model was found to be an effective tool to support the scheduling of maintenance works for the facility manager.

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.

Personalized Recommendation System for IPTV using Ontology and K-medoids (IPTV환경에서 온톨로지와 k-medoids기법을 이용한 개인화 시스템)

  • Yun, Byeong-Dae;Kim, Jong-Woo;Cho, Yong-Seok;Kang, Sang-Gil
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.3
    • /
    • pp.147-161
    • /
    • 2010
  • As broadcasting and communication are converged recently, communication is jointed to TV. TV viewing has brought about many changes. The IPTV (Internet Protocol Television) provides information service, movie contents, broadcast, etc. through internet with live programs + VOD (Video on demand) jointed. Using communication network, it becomes an issue of new business. In addition, new technical issues have been created by imaging technology for the service, networking technology without video cuts, security technologies to protect copyright, etc. Through this IPTV network, users can watch their desired programs when they want. However, IPTV has difficulties in search approach, menu approach, or finding programs. Menu approach spends a lot of time in approaching programs desired. Search approach can't be found when title, genre, name of actors, etc. are not known. In addition, inserting letters through remote control have problems. However, the bigger problem is that many times users are not usually ware of the services they use. Thus, to resolve difficulties when selecting VOD service in IPTV, a personalized service is recommended, which enhance users' satisfaction and use your time, efficiently. This paper provides appropriate programs which are fit to individuals not to save time in order to solve IPTV's shortcomings through filtering and recommendation-related system. The proposed recommendation system collects TV program information, the user's preferred program genres and detailed genre, channel, watching program, and information on viewing time based on individual records of watching IPTV. To look for these kinds of similarities, similarities can be compared by using ontology for TV programs. The reason to use these is because the distance of program can be measured by the similarity comparison. TV program ontology we are using is one extracted from TV-Anytime metadata which represents semantic nature. Also, ontology expresses the contents and features in figures. Through world net, vocabulary similarity is determined. All the words described on the programs are expanded into upper and lower classes for word similarity decision. The average of described key words was measured. The criterion of distance calculated ties similar programs through K-medoids dividing method. K-medoids dividing method is a dividing way to divide classified groups into ones with similar characteristics. This K-medoids method sets K-unit representative objects. Here, distance from representative object sets temporary distance and colonize it. Through algorithm, when the initial n-unit objects are tried to be divided into K-units. The optimal object must be found through repeated trials after selecting representative object temporarily. Through this course, similar programs must be colonized. Selecting programs through group analysis, weight should be given to the recommendation. The way to provide weight with recommendation is as the follows. When each group recommends programs, similar programs near representative objects will be recommended to users. The formula to calculate the distance is same as measure similar distance. It will be a basic figure which determines the rankings of recommended programs. Weight is used to calculate the number of watching lists. As the more programs are, the higher weight will be loaded. This is defined as cluster weight. Through this, sub-TV programs which are representative of the groups must be selected. The final TV programs ranks must be determined. However, the group-representative TV programs include errors. Therefore, weights must be added to TV program viewing preference. They must determine the finalranks.Based on this, our customers prefer proposed to recommend contents. So, based on the proposed method this paper suggested, experiment was carried out in controlled environment. Through experiment, the superiority of the proposed method is shown, compared to existing ways.

Characterization of Bacteria Isolated from Rotted Onions (Allium cepa) (양파 부패병변에서 분리한 세균의 특성)

  • Lee Chan-Jung;Lim Si-Kyu;Kim Byung-Chun;Park Wan
    • Microbiology and Biotechnology Letters
    • /
    • v.33 no.4
    • /
    • pp.248-254
    • /
    • 2005
  • One hundred thirty nine bacteria were isolated from rotten onions collected from main producing districts, Chang-Nyung, Eui-Ryung, and Ham-Yang in Korea. The $18\%$ (25 strains) of bacterial isolates have carboxymethylcellulase (CMCase) activity and the $53\%$ (74 strains) have polygalacturonase (PGase) activity. Thirty one among randomly selected 45 strains of PGase producing bacteria have pathogenicity to onions. The isolates were classified into Pseudomonas sp. (18 strains), Bacillus sp. (11 strains), Yers-inia sp. (7 strains), and others (9 strains) on the basis of FAMEs patterns. Eighteen strains of Pseudomonas sp. were mainly divided into three cluster in the dendrogram and only the two clusters of them showed pathogenicity to onions. CMCase and PGase activities of Pseudomonas sp. weaker than those of Bacillus sp.. However, the pathogenicity of pseudomonas sp. to soften onions was stronger than that of Bacillus sp. Inoculation of $10^{2}$ cfu of Pseudomonas sp. gives rise to softening of onions. Pseudomonas sp. was identified as Pseudomonas gladioli by biochemical and physiological characteristics. P. gladioli is the first reported bacterium as a pathogen of onion in Korea. In low temperature, P. gladioli showed better growth and higher PGase activity than those of Bacillus sp. identified as Bacillus subtilis. And pH 9.0 is optimal pH for PGase activity of B. subtilis while that of P. gladioli is pH $5.0\∼6.0$ which is the acidity of onions. Taken together, P. gladioli may be a main pathogene of onion rot during the cold storage condition.