• 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.

• Journal of the Korean Society for Library and Information Science
• /
• v.39 no.1
• /
• pp.45-58
• /
• 2005

This Paper is a comparative study of feature selection methods for Korean web documents clustering. First, we focused on how the term feature and the co-link of web documents affect clustering performance. We clustered web documents by native term feature, co-link and both, and compared the output results with the originally allocated category. And we selected term features for each category using $X^2$, Information Gain (IG), and Mutual Information (MI) from training documents, and applied these features to other experimental documents. In addition we suggested a new method named Max Feature Selection, which selects terms that have the maximum count for a category in each experimental document, and applied $X^2$ (or MI or IG) values to each term instead of term frequency of documents, and clustered them. In the results, $X^2$ shows a better performance than IG or MI, but the difference appears to be slight. But when we applied the Max Feature Selection Method, the clustering Performance improved notably. Max Feature Selection is a simple but effective means of feature space reduction and shows powerful performance for Korean web document clustering.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.12
• /
• pp.15-20
• /
• 2015

In this paper, we propose a modified fuzzy clustering algorithm which can overcome the center deviation due to the Euclidean distance commonly used in fuzzy clustering. Among fuzzy clustering methods, Fuzzy C-Means (FCM) is the most well-known clustering algorithm and has been widely applied to various problems successfully. In FCM, however, cluster centers tend leaning to high density clusters because the Euclidean distance measure forces high density cluster to make more contribution to clustering result. Proposed is an enhanced algorithm which modifies the objective function of FCM by adding a center-scattering term to make centers not to be close due to the cluster density. The proposed method converges more to real centers with small number of iterations compared to FCM. All the strengths can be verified with experimental results.

• Communications for Statistical Applications and Methods
• /
• v.18 no.3
• /
• pp.267-275
• /
• 2011

According to recent studies, Bayesian information criteria(BIC) is proposed to determine the structural dimension of the central subspace through sliced inverse regression(SIR) with high-dimensional predictors. The BIC may be useful in K-means clustering inverse regression(KIR) with high-dimensional predictors. However, the direct application of the BIC to KIR may be problematic, because the slicing scheme in SIR is not the same as that of KIR. In this paper, we present empirical penalty term studies of BIC in KIR to identify the most appropriate one. Numerical studies and real data analysis are presented.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.2
• /
• pp.108-112
• /
• 2012

A sustainable production of electricity is essential for low carbon green growth in South Korea. The generation of wind power as renewable energy has been rapidly growing around the world. Undoubtedly wind energy is unlimited in potential. However, due to its own intermittency and volatility, there are difficulties in the effective harvesting of wind energy and the integration of wind power into the current electric power grid. To cope with this, many works have been done for wind speed and power forecasting. It is reported that, compared with physical persistent models, statistical techniques and computational methods are more useful for short-term forecasting of wind power. Among them, support vector regression (SVR) has much attention in the literature. This paper proposes an SVR based wind speed forecasting. To improve the forecasting accuracy, a fuzzy clustering is adopted in the process of SVR modeling. An illustrative example is also given by using real-world wind farm dataset. According to the experimental results, it is shown that the proposed method provides better forecasts of wind power.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.55 no.4
• /
• pp.172-178
• /
• 2006

In this paper, an advanced demand clustering algorithm which can explore the planned maintenance outage of generators in changed electricity industry is proposed. The major contribution of this paper can be captured in the development of the long-term estimates for the generation availability considering planned maintenance outage. Two conflicting viewpoints, one of which is reliability-focused and the other is economy-focused, are incorporated in the development of estimates of maintenance outage based on the advanced demand clustering algorithm. Based on the advanced clustering algorithm, in each demand cluster, conventional effective outage of generators which conceptually capture maintenance and forced outage of generators, are newly defined in order to properly address the characteristic of the planned maintenance outage in changed electricity markets. First, initial market demand is classified into multiple demand clusters, which are defined by the effective outage rates of generators and by the inherent characteristic of the initial demand. Then, based on the advanced demand clustering algorithm, the planned maintenance outages and corresponding effective outages of generators are reevaluated. Finally, the conventional demand clusters are newly classified in order to reflect the improved effective outages of generation markets. We have found that the revision of the demand clusters can change the number of the initial demand clusters, which cannot be captured in the conventional demand clustering process. Therefore, it can be seen that electricity market situations, which can also be classified into several groups which show similar patterns, can be more accurately clustered. From this the fundamental characteristics of power systems can be more efficiently analyzed, for this advanced classification can be widely applicable to other technical problems in power systems such as generation scheduling, power flow analysis, price forecasts, and so on.

• Journal of the Korean Society for Library and Information Science
• /
• v.43 no.3
• /
• pp.399-416
• /
• 2009

In this study, clustering methods with related tags were discussed for improving search and exploration in the tag space. The experiments were performed on 10 Delicious tags and the strongly-related tags extracted by each 300 documents, and hierarchical and non-hierarchical clustering methods were carried out based on the tag co-occurrences. To evaluate the experimental results, cluster relevance was measured. Results showed that Ward's method with cosine coefficient, which shows good performance to term clustering, was best performed with consistent clustering tendency. Furthermore, it was analyzed that cluster membership among related tags is based on users' tagging purposes or interest and can disambiguate word sense. Therefore, tag clusters would be helpful for improving search and exploration in the tag space.

• Journal of Computing Science and Engineering
• /
• v.4 no.2
• /
• pp.97-109
• /
• 2010

Nonnegative matrix factorization (NMF) is a popular method for multivariate analysis of nonnegative data, which is to decompose a data matrix into a product of two factor matrices with all entries restricted to be nonnegative. NMF was shown to be useful in a task of clustering (especially document clustering), but in some cases NMF produces the results inappropriate to the clustering problems. In this paper, we present an algorithm for orthogonal nonnegative matrix factorization, where an orthogonality constraint is imposed on the nonnegative decomposition of a term-document matrix. The result of orthogonal NMF can be clearly interpreted for the clustering problems, and also the performance of clustering is usually better than that of the NMF. We develop multiplicative updates directly from true gradient on Stiefel manifold, whereas existing algorithms consider additive orthogonality constraints. Experiments on several different document data sets show our orthogonal NMF algorithms perform better in a task of clustering, compared to the standard NMF and an existing orthogonal NMF.

• Journal of the Korean Society for Library and Information Science
• /
• v.44 no.3
• /
• pp.155-173
• /
• 2010

In this study, a new keyword extraction algorithm is applied to a single document with term clustering. A single document is divided by multiple passages, and two ways of calculating similarities between two terms are investigated; the first-order similarity and the second-order distributional similarity. In this experiment, the best cluster performance is achieved with a 50-term passage from the second-order distributional similarity. From the results of first experiment, the second-order distribution similarity was also applied to various keyword extraction methods using statistic information of terms. In the second experiment, pf(paragraph frequency) and $tf{\times}ipf$(term frequency by inverse paragraph frequency) were found to improve the overall performance of keyword extraction. Therefore, it showed that the algorithm fulfills the necessary conditions which good keywords should have.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.2
• /
• pp.45-52
• /
• 2012

This paper proposes a new enhancing document clustering method using the important terms of cluster and the wikipedia. The proposed method can well represent the concept of cluster topics by means of selecting the important terms in cluster by the semantic features of NMF. It can solve the problem of "bags of words" to be not considered the meaningful relationships between documents and clusters, which expands the important terms of cluster by using of the synonyms of wikipedia. Also, it can improve the quality of document clustering which uses the expanded cluster important terms to refine the initial cluster by re-clustering. The experimental results demonstrate that the proposed method achieves better performance than other document clustering methods.