• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1989.10a
• /
• pp.25-29
• /
• 1989

본 고에서는 다차원 개체 clustering문제에 있어서 개체간 관계가 확률적이고 가중치가 부여된 경우를 위한 기대차이등급 clustering기법을 제시하였다. 기대차이등급 clustering기법은 해법의 필요성에 비해 상대적으로 해법개발이 미진한 분산정보시스팀을 대상으로 한 전산화 master plan의 수립이나 기계-부품 그룹형성, FMS에서의 주문선정(Part Type Selection)등에 기여할 수 있을 것으로 기대된다. 반면 해법의 타당성 검토를 위한 이론적 연구가 제시되지 않아 추후 이의 보완을 위한 연구가 요망된다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1692-1711
• /
• 2016

Energy is a scarce resource in wireless sensor networks (WSNs). A variety of clustering protocols for WSNs, such as the zone-based stable election protocol-enhanced (ZSEP-E), have been developed for energy optimization. The ZSEP-E is a heterogeneous zone-based clustering protocol that focuses on unbalanced energy consumption with parallel formation of clusters in zones and election of cluster heads (CHs). Most ZSEP-E research has assumed probabilistic election of CHs in the zones by considering the maximum residual energy of nodes. However, studies of the diverse CH election parameters are lacking. We investigated the performance of the ZSEP-E in such scenarios using a fuzzy logic approach based on three descriptors, i.e., energy, density, and the distance from the node to the base station. We proposed an efficient ZSEP-E scheme to adapt and elect CHs in zones using fuzzy variables and evaluated its performance for different energy levels in the zones.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.56 no.1
• /
• pp.11-20
• /
• 2014

Many classification studies for the community of densely-connected nodes are limited to the comprehensive analysis for detecting the communities in probabilistic networks with nodes and edge of the probabilistic distribution because of the difficulties of the probabilistic operation. This study aims to use convolution method for operating nodes and edge of probabilistic distribution. For the probabilistic hierarchy network with nodes and edges of the probabilistic distribution, the model of this study detects the communities of nodes to make the new probabilistic distribution with two distribution. The results of our model was verified through comparing with Monte-carlo Simulation and other community-detecting methods.

• Nuclear Engineering and Technology
• /
• v.54 no.9
• /
• pp.3336-3346
• /
• 2022

In general, a number of severe accident scenarios derived from Level 2 probabilistic safety assessment (PSA) are typically grouped into several categories to efficiently evaluate their potential impacts on the public with the assumption that scenarios within the same group have similar source term characteristics. To date, however, grouping by similar source terms has been completely reliant on qualitative methods such as logical trees or expert judgements. Recently, an exhaustive simulation approach has been developed to provide quantitative information on the source terms of a large number of severe accident scenarios. With this motivation, this paper proposes a machine learning-based categorization method based on exhaustive simulation for grouping scenarios with similar accident consequences. The proposed method employs clustering with an autoencoder for grouping unlabeled scenarios after dimensionality reductions and feature extractions from the source term data. To validate the suggested method, source term data for 658 severe accident scenarios were used. Results confirmed that the proposed method successfully characterized the severe accident scenarios with similar behavior more precisely than the conventional grouping method.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.13 no.1
• /
• pp.59-66
• /
• 2013

In this paper, we propose a probabilistic framework for model-based clustering of direction of arrival (DOA) data to obtain stable sound source localization (SSL) estimates. Model-based clustering has been shown capable of handling highly overlapped and noisy datasets, such as those involved in DOA detection. Although the Gaussian mixture model is commonly used for model-based clustering, we propose use of the von Mises mixture model as more befitting circular DOA data than a Gaussian distribution. The EM framework for the von Mises mixture model in a unit hyper sphere is degenerated for the 2D case and used as such in the proposed method. We also use a histogram of the dataset to initialize the number of clusters and the initial values of parameters, thereby saving calculation time and improving the efficiency. Experiments using simulated and real-world datasets demonstrate the performance of the proposed method.

• Smart Structures and Systems
• /
• v.15 no.3
• /
• pp.751-767
• /
• 2015

A new procedure is proposed for assessing probabilistic condition of structures considering effect of measured data uncertainty. In this procedure, multiple Finite Element (FE) models are identified by using weighting vectors that represent the uncertainty conditions of measured data. The distribution of structural parameters is analysed using a Principal Component Analysis (PCA) in relation to uncertainty conditions, and the identified models are classified into groups according to their similarity by using a K-means method. The condition of a structure is then assessed probabilistically using FE models in the classified groups, each of which represents specific uncertainty condition of measured data. Yeondae bridge, a steel-box girder expressway bridge in Korea, is used as an illustrative example. Probabilistic condition of the bridge is evaluated by the distribution of load rating factors obtained using multiple FE models. The numerical example shows that the proposed method can quantify uncertainty of measured data and subsequently evaluate efficiently the probabilistic condition of bridges.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.12
• /
• pp.2230-2234
• /
• 2006

A SCO is a learning resource that is retrieved by a learner in the SCORM. A storage policy is required a learner to search SCOs rapidly in e-learning environment. In this paper, We define the mathematical formulation of clustering method for SCOs. Also we present criteria for cluster evaluation and describe procedure to evaluate each SCO. We show the search based on proposed clustering method increase performance than the existing search though performance evaluation.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.54 no.8
• /
• pp.418-428
• /
• 2005

In this paper, a new probabilistic generation modeling method which can address the characteristics of changed electricity industry is proposed. The major contribution of this paper can be captured in the development of a probabilistic generation modeling considering generator maintenance outage and in the classification of market demand into multiple demand clusters for the applications to electricity markets. Conventional forced outage rates of generators are conceptually combined with maintenance outage of generators and, consequently, effective outage rates of generators are newly defined in order to properly address the probabilistic characteristic of generation in electricity markets. Then, original market demands are classified into several distinct demand clusters, which are defined by the effective outage rates of generators and by the inherent characteristic of the original demand. We have found that generators have different effective outage rates values at each classified demand cluster, depending on the market situation. From this, therefore, it can be seen that electricity markets can also be classified into several groups which show similar patterns and that the fundamental characteristics of power systems can be more efficiently analyzed in electricity markets perspectives, for this classification can be widely applicable to other technical problems in power systems such as generation scheduling, power flow analysis, price forecasts, and so on.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.05a
• /
• pp.109-112
• /
• 1999

Image segmentation is the critical first step in image information extraction for computer vision systems. Clustering methods have been used extensively in color image segmentation. Most analytic fuzzy clustering approaches are divided from the fuzzy c-means(FCM) algorithm. The FCM algorithm uses fie probabilistic constraint that the memberships of a data point across classes sum to 1. However, the memberships resulting from the FCM do not always correspond to the intuitive concept of degree of belonging or compatibility. Moreover, the FCM algorithm has considerable trouble under noisy environments in the feature space. Recently, a possibilistic approach to clustering(PCM) for solving above problems was proposed. In this paper, we used the PCM for color image segmentation. This approach differs from existing fuzzy clustering methods for color image segmentation in that the resulting partition of the data can be interpreted as a possibilistic partition. So, the problems in the FCM can be solved by the PCM. But, the clustering results by the PCM are not smoothly bounded, and they often have holes. The region growing was used as a postprocessing after smoothing the noise points in the pixel seeds. In our experiments, we illustrate that the PCM us reasonable than the FCM in noisy environments.

• Journal of Broadcast Engineering
• /
• v.3 no.1
• /
• pp.50-60
• /
• 1998

This paper addresses a problem of extraction of parameteric motion estimation and structural motion segmentation for compact image sequence representation and object-based generic video coding. In order to extract meaningful motion structure from image sequences, a direct parameteric motion estimation based on a pre-segmentation is proposed. The pre-segmentation which considers the motion of the moving objects is canied out based on probabilistic clustering with mixture models using optical flow and image intensities. Parametric motion segmentation can be obtained by iterated estimation of motion model parameters and region reassignment according to a criterion using Gauss-Newton iterative optimization algorithm. The efficiency of the proposed methoo is verified with computer simulation using elF real image sequences.