• Title/Summary/Keyword: Group Model Clustering

Search Result 98, Processing Time 0.02 seconds

A SOFT-SENSING MODEL FOR FEEDWATER FLOW RATE USING FUZZY SUPPORT VECTOR REGRESSION

  • Na, Man-Gyun;Yang, Heon-Young;Lim, Dong-Hyuk
    • Nuclear Engineering and Technology
    • /
    • v.40 no.1
    • /
    • pp.69-76
    • /
    • 2008
  • Most pressurized water reactors use Venturi flow meters to measure the feedwater flow rate. However, fouling phenomena, which allow corrosion products to accumulate and increase the differential pressure across the Venturi flow meter, can result in an overestimation of the flow rate. In this study, a soft-sensing model based on fuzzy support vector regression was developed to enable accurate on-line prediction of the feedwater flow rate. The available data was divided into two groups by fuzzy c means clustering in order to reduce the training time. The data for training the soft-sensing model was selected from each data group with the aid of a subtractive clustering scheme because informative data increases the learning effect. The proposed soft-sensing model was confirmed with the real plant data of Yonggwang Nuclear Power Plant Unit 3. The root mean square error and relative maximum error of the model were quite small. Hence, this model can be used to validate and monitor existing hardware feedwater flow meters.

A Study on Partial Pattern Estimation for Sequential Agglomerative Hierarchical Nested Model (SAHN 모델의 부분적 패턴 추정 방법에 대한 연구)

  • Jang, Kyung-Won;Ahn, Tae-Chon
    • Proceedings of the KIEE Conference
    • /
    • 2005.10b
    • /
    • pp.143-145
    • /
    • 2005
  • In this paper, an empirical study result on pattern estimation method is devoted to reveal underlying data patterns with a relatively reduced computational cost. Presented method performs crisp type clustering with given n number of data samples by means of the sequential agglomerative hierarchical nested model (SAHN). Conventional SAHN based clustering requires large computation time in the initial step of algorithm. To deal with this concern, we modified overall process with a partial approach. In the beginning of this method, we divide given data set to several sub groups with uniform sampling and then each divided sub data group is applied to SAHN based method. The advantage of this method reduces computation time of original process and gives similar results. Proposed is applied to several test data set and simulation result with conceptual analysis is presented.

  • PDF

Neural-based Blind Modeling of Mini-mill ASC Crown

  • Lee, Gang-Hwa;Lee, Dong-Il;Lee, Seung-Joon;Lee, Suk-Gyu;Kim, Shin-Il;Park, Hae-Doo;Park, Seung-Gap
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.6
    • /
    • pp.577-582
    • /
    • 2002
  • Neural network can be trained to approximate an arbitrary nonlinear function of multivariate data like the mini-mill crown values in Automatic Shape Control. The trained weights of neural network can evaluate or generalize the process data outside the training vectors. Sometimes, the blind modeling of the process data is necessary to compare with the scattered analytical model of mini-mill process in isolated electro-mechanical forms. To come up with a viable model, we propose the blind neural-based range-division domain-clustering piecewise-linear modeling scheme. The basic ideas are: 1) dividing the range of target data, 2) clustering the corresponding input space vectors, 3)training the neural network with clustered prototypes to smooth out the convergence and 4) solving the resulting matrix equations with a pseudo-inverse to alleviate the ill-conditioning problem. The simulation results support the effectiveness of the proposed scheme and it opens a new way to the data analysis technique. By the comparison with the statistical regression, it is evident that the proposed scheme obtains better modeling error uniformity and reduces the magnitudes of errors considerably. Approximatly 10-fold better performance results.

Probability-based Deep Learning Clustering Model for the Collection of IoT Information (IoT 정보 수집을 위한 확률 기반의 딥러닝 클러스터링 모델)

  • Jeong, Yoon-Su
    • Journal of Digital Convergence
    • /
    • v.18 no.3
    • /
    • pp.189-194
    • /
    • 2020
  • Recently, various clustering techniques have been studied to efficiently handle data generated by heterogeneous IoT devices. However, existing clustering techniques are not suitable for mobile IoT devices because they focus on statically dividing networks. This paper proposes a probabilistic deep learning-based dynamic clustering model for collecting and analyzing information on IoT devices using edge networks. The proposed model establishes a subnet by applying the frequency of the attribute values collected probabilistically to deep learning. The established subnets are used to group information extracted from seeds into hierarchical structures and improve the speed and accuracy of dynamic clustering for IoT devices. The performance evaluation results showed that the proposed model had an average 13.8 percent improvement in data processing time compared to the existing model, and the server's overhead was 10.5 percent lower on average than the existing model. The accuracy of extracting IoT information from servers has improved by 8.7% on average from previous models.

A Brief Efficiency and Clustering Measurement Way of Containerport by Using the Game Cross-efficiency Model (게임교차효율성모형을 이용한 컨테이너항만의 효율성 및 클러스터링 측정방법 소고)

  • Park, Rokyung
    • Journal of Korea Port Economic Association
    • /
    • v.30 no.4
    • /
    • pp.151-168
    • /
    • 2014
  • The purpose of this paper is to show the brief efficiency and clustering measurement way by using the game cross-efficiency model which is newly introduced in this paper for 13 container ports during 3 years(2009, 2010, and 2013) with 3 input variables(depth, total area, and number of crane) and 1 output variable(container TEU). The main empirical results are as follows. First, the average rankings of game cross-efficiency model are Ningbo, Hongkong, Shanghai, Dubai, Singapore, Qingdao, Kaosiung, Busan, Tokyo, Incheon, Nagoya, Manila, Gwangyang ports in order. Second, according to ANOVA analysis, three models show the similar results in terms of the efficiency rankings. Third, in the clustering analysis using dendrogram, group A(Shangahi and Busan), group B(Ningbo and Nagoya), and group C(Incheon and Manila) show the common clustering ports during 3 or 2 years. The policy implication of this paper is that Korean port policy planner should introduce the game cross-efficiency method when measuring the individual port efficiency. Also port authority should consider the merits of the clustering ports for improving the port management and operations.

Movie Recommendation Using Co-Clustering by Infinite Relational Models (Infinite Relational Model 기반 Co-Clustering을 이용한 영화 추천)

  • Kim, Byoung-Hee;Zhang, Byoung-Tak
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.24 no.4
    • /
    • pp.443-449
    • /
    • 2014
  • Preferences of users on movies are observables of various factors that are related with user attributes and movie features. For movie recommendation, analysis methods for relation among users, movies, and preference patterns are mandatory. As a relational analysis tool, we focus on the Infinite Relational Model (IRM) which was introduced as a tool for multiple concept search. We show that IRM-based co-clustering on preference patterns and movie descriptors can be used as the first tool for movie recommender methods, especially content-based filtering approaches. By introducing a set of well-defined tag sets for movies and doing three-way co-clustering on a movie-rating matrix and a movie-tag matrix, we discovered various explainable relations among users and movies. We suggest various usages of IRM-based co-clustering, espcially, for incremental and dynamic recommender systems.

The Effect of Input Variables Clustering on the Characteristics of Ensemble Machine Learning Model for Water Quality Prediction (입력자료 군집화에 따른 앙상블 머신러닝 모형의 수질예측 특성 연구)

  • Park, Jungsu
    • Journal of Korean Society on Water Environment
    • /
    • v.37 no.5
    • /
    • pp.335-343
    • /
    • 2021
  • Water quality prediction is essential for the proper management of water supply systems. Increased suspended sediment concentration (SSC) has various effects on water supply systems such as increased treatment cost and consequently, there have been various efforts to develop a model for predicting SSC. However, SSC is affected by both the natural and anthropogenic environment, making it challenging to predict SSC. Recently, advanced machine learning models have increasingly been used for water quality prediction. This study developed an ensemble machine learning model to predict SSC using the XGBoost (XGB) algorithm. The observed discharge (Q) and SSC in two fields monitoring stations were used to develop the model. The input variables were clustered in two groups with low and high ranges of Q using the k-means clustering algorithm. Then each group of data was separately used to optimize XGB (Model 1). The model performance was compared with that of the XGB model using the entire data (Model 2). The models were evaluated by mean squared error-ob servation standard deviation ratio (RSR) and root mean squared error. The RSR were 0.51 and 0.57 in the two monitoring stations for Model 2, respectively, while the model performance improved to RSR 0.46 and 0.55, respectively, for Model 1.

Selective Encryption Algorithm for 3D Printing Model Based on Clustering and DCT Domain

  • Pham, Giao N.;Kwon, Ki-Ryong;Lee, Eung-Joo;Lee, Suk-Hwan
    • Journal of Computing Science and Engineering
    • /
    • v.11 no.4
    • /
    • pp.152-159
    • /
    • 2017
  • Three-dimensional (3D) printing is applied to many areas of life, but 3D printing models are stolen by pirates and distributed without any permission from the original providers. Moreover, some special models and anti-weapon models in 3D printing must be secured from the unauthorized user. Therefore, 3D printing models must be encrypted before being stored and transmitted to ensure access and to prevent illegal copying. This paper presents a selective encryption algorithm for 3D printing models based on clustering and the frequency domain of discrete cosine transform. All facets are extracted from 3D printing model, divided into groups by the clustering algorithm, and all vertices of facets in each group are transformed to the frequency domain of a discrete cosine transform. The proposed algorithm is based on encrypting the selected coefficients in the frequency domain of discrete cosine transform to generate the encrypted 3D printing model. Experimental results verified that the proposed algorithm is very effective for 3D printing models. The entire 3D printing model is altered after the encryption process. The decrypting error is approximated to be zero. The proposed algorithm provides a better method and more security than previous methods.

Domestic and Foreign Case Studies on the Residential Core Model of the Second Home Child Care Center (집과 같은 어린이집 모형 제안을 위한 국내외 사례연구)

  • Kim, Young-Aee;Choi, Mock-Wha;Park, Jung-A
    • Journal of the Korean housing association
    • /
    • v.24 no.1
    • /
    • pp.1-10
    • /
    • 2013
  • Number of children cared by child care centers has getting up almost half of the from zero to five year age group in korea. Home care children' activities are reported more active and natural than those of center care children. So this study seek the design guidelines for the residential core model of child care centers as second home in korea. The residential core model by Anita Lui Olds was selected and ten domestic center cases were surveyed for guidelines. Firstly, daily-residential core model is learning by daily life at home, and is equiped with cooking kitchenet and group activity area in group room. Secondly, play-residental core model is learning by playing by self, and is equiped with acting, eating and reading common area clustering two or three group room. Thirdly, eco-residental core model is learning by eco-friendly activities, and is equiped with companying, cooperating and sharing area. Fourthly, project-residental core model is learning by project by self, and is equiped with drawing, experimenting and presenting common area. Fifthly, the space of residential core model is organized with three or four group room and clustering living or common area. The larger the center is, the more the cluster is vertically. Facility area and outdoor playground per child is about 7 and $3m^2$.

Segmenting Inpatients by Mixture Model and Analytical Hierarchical Process(AHP) Approach In Medical Service (의료서비스에서 혼합모형(Mixture model) 및 분석적 계층과정(AHP)를 이용한 입원환자의 시장세분화에 관한 연구)

  • 백수경;곽영식
    • Health Policy and Management
    • /
    • v.12 no.2
    • /
    • pp.1-22
    • /
    • 2002
  • Since the early 1980s scholars have applied latent structure and other type of finite mixture models from various academic fields. Although the merits of finite mixture model are well documented, the attempt to apply the mixture model to medical service has been relatively rare. The researchers aim to try to fill this gap by introducing finite mixture model and segmenting inpatients DB from one general hospital. In section 2 finite mixture models are compared with clustering, chi-square analysis, and discriminant analysis based on Wedel and Kamakura(2000)'s segmentation methodology schemata. The mixture model shows the optimal segments number and fuzzy classification for each observation by EM(expectation-maximization algorism). The finite mixture model is to unfix the sample, to Identify the groups, and to estimate the parameters of the density function underlying the observed data within each group. In section 3 and 4 we illustrate results of segmenting 4510 patients data including menial and ratio scales. And then, we show AHP can be identify the attractiveness of each segment, in which the decision maker can select the best target segment.