• Nuclear Engineering and Technology
• /
• v.47 no.2
• /
• pp.176-186
• /
• 2015

Pattern classifications have become important tools for fault diagnosis in nuclear power plants (NPP). However, it is often difficult to obtain training data under fault conditions to train a supervised classification model. By contrast, normal plant operating data can be easily made available through increased deployment of supervisory, control, and data acquisition systems. Such data can also be used to train classification models to improve the performance of fault diagnosis scheme. In this paper, a fault diagnosis scheme based on semisupervised classification (SSC) scheme is developed. In this scheme, new measurements collected from the plant are integrated with data observed under fault conditions to train the SSC models. The trained models are subsequently applied to new measurements for fault diagnosis. In comparison with supervised classifiers, the proposed scheme requires significantly fewer data collected under fault conditions to train the classifier. The developed scheme has been validated using different fault scenarios on a desktop NPP simulator as well as on a physical NPP simulator using a graph-based SSC algorithm. All the considered faults have been successfully diagnosed. The results have demonstrated that SSC is a promising tool for fault diagnosis in NPPs.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.16 no.2
• /
• pp.45-52
• /
• 2020

This paper is focused on the modulation scheme detection of the IEEE 802.11 standard. In the IEEE 802.11ac standard, the information of the modulation scheme is indicated by the modulation coding scheme (MCS) included in the VHT-SIG-A of the preamble field. Transmitting end determines the MCS index suitable for the low signal to noise ratio (SNR) situation and transmits the data accordingly. Since data field decoding can take place only when the receiving end acquires the MCS index information of the frame. Therefore, accurate MCS detection must be guaranteed before data field decoding. However, since the MCS index information is the information obtained through preamble field decoding, the detection rate can be affected significantly in a low SNR situation. In this paper, we propose a relatively robust modulation classification method based on deep learning to solve the low detection rate problem with a conventional method caused by a low SNR.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.2 no.1
• /
• pp.29-37
• /
• 1999

Land cover classification is an essential basic information in natural environment management; however, land cover classification studies in Korea have not yet been proceeded to a sufficient level. At the present, only a limited number of the precedent studies that only cover definite city area has been conducted. Furthermore, there is almost no research conducted on the land cover classification schemes that could accurately classify the Korea's land cover conditions. This study primarily focuses on the land cover classification scheme which carries the most urgent priority in order to classify and to map out the Korean land cover conditions. In order to develop the most suitable land cover classification scheme, many foreign land cover classification cases and projects that are being carried out were reviewed in depth. The land cover classification scheme this study proposes comprises 3 levels : The first level consists of 7 different classes; the second level consists of 22 different classes; and the third level is made up of 50 classes. The land cover classification map will serve many important roles in natural environment management, such as the conjecture of natural habitats and estimation of oxygen production or carbon dioxide absorption capability of a forest. In water pollution modelling, the land cover classification data can be used to estimate and locate non-point sources of water pollution. If applied to a watershed, modelling it will allow to estimate the total amount of pollution from non-point sources of pollution in the water shed. The land cover classification data will also be good as a barometer data that determines defusion of air pollutants in air pollution modelling.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.394-399
• /
• 2002

In this paper, Multisource data classification methods based on Bayesian formula are considered. For this decision fusion scheme, the individual data sources are handled separately by statistical classification algorithms and then Bayesian fusion method is applied to integrate from the available data sources. This method includes the combination of each expert decisions where the weights of the individual experts represent the reliability of the sources. The reliability measure used in the statistical approach is common to all pixels in previous work. In this experiment, the weight factors have been assigned to have different value for all pixels in order to improve the integrated classification accuracies. Although most implementations of Bayesian classification approaches assume fixed a priori probabilities, we have used adaptive a priori probabilities by iteratively calculating the local a priori probabilities so as to maximize the posteriori probabilities. The effectiveness of the proposed method is at first demonstrated on simulations with artificial and evaluated in terms of real-world data sets. As a result, we have shown that Bayesian statistical fusion scheme performs well on multispectral data classification.

• Management Science and Financial Engineering
• /
• v.12 no.2
• /
• pp.71-85
• /
• 2006

Collaborative filtering, among other recommender systems, has been known as the most successful recommendation technique. However, it requires the user-item rating data, which may not be easily available. As an alternative, some collaborative filtering algorithms have been developed recently by utilizing the market basket data in the form of the binary user-item matrix. Viewing the recommendation scheme as a two-class classification problem, we proposed a new collaborative filtering scheme using a regularized discriminant analysis applied to the binary user-item data. The proposed discriminant model was built in terms of the major principal components and was used for predicting the probability of purchasing a particular item by an active user. The proposed scheme was illustrated with two modified real data sets and its performance was compared with the existing user-based approach in terms of the recommendation precision.

• Knowledge Management Research
• /
• v.20 no.3
• /
• pp.139-154
• /
• 2019

With the increasing use of smartphone apps, many apps are coming out in various fields. In order to analyze the current status and trends of apps in a specific field, it is necessary to establish a classification scheme. Various schemes considering users' behavior and characteristics of apps have been proposed, but there is a problem in that many apps are released and a fixed classification scheme must be updated according to the passage of time. Although it is necessary to consider many aspects in establishing classification scheme, it is possible to grasp the trend of the app through the proposal of a classification scheme according to the characteristic of the app. This research proposes a method of establishing an app classification scheme through the description of the app written by the app developers. For this purpose, we collected explanations about apps in the tourism field and identified major categories through topic modeling. Using only the apps corresponding to the topic, we construct a network of words contained in the explanatory text and identify subcategories based on the networks of words. Six topics were selected, and Clauset Newman Moore algorithm was applied to each topic to identify subcategories. Four or five subcategories were identified for each topic.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.8
• /
• pp.741-751
• /
• 2000

To achieve high performance by exploiting instruction level parallelism aggressively in superscalar processors, it is necessary to overcome the limitation imposed by control dependences and data dependences which prevent instructions from executing parallel. Value prediction is a technique that breaks data dependences by predicting the outcome of an instruction and executes speculatively its data dependent instruction based on the predicted outcome. In this paper, a hybrid value prediction scheme with dynamic classification mechanism is proposed. We design a hybrid predictor by combining the last predictor, a stride predictor and a two-level predictor. The choice of a predictor for each instruction is determined by a dynamic classification mechanism. This makes each predictor utilized more efficiently than the hybrid predictor without dynamic classification mechanism. To show performance improvements of our scheme, we simulate the SPECint95 benchmark set by using execution-driven simulator. The results show that our scheme effect reduce of 45% hardware cost and 16% prediction accuracy improvements comparing with the conventional hybrid prediction scheme and two-level value prediction scheme.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.1
• /
• pp.25-36
• /
• 2008

Error Correcting Output Codes (ECOC) can improve generalization performance when applied to multicategory classification problem. In this study we propose a new criterion to select hyperparameters included in ECOC scheme. Instead of margins of a data we propose to use the probability of misclassification error since it makes the criterion simple. Using this we obtain an upper bound of leave-one-out error of OVA(one vs all) method. Our experiments from real and synthetic data indicate that the bound leads to good estimates of parameters.

• Korean Journal of Remote Sensing
• /
• v.30 no.4
• /
• pp.493-503
• /
• 2014

A hierarchical classification scheme, which can reduce the spectral ambiguity and also reflect crop cultivation patterns from past land-cover maps, is presented for the purpose of the early production of crop classification maps in large-scale crop areas. Specifically, the effects of mixed pixels are minimized not only by applying a hierarchical classification approach based on different spectral characteristics from crop growth cycles, but also by considering temporal contextual information derived from past crop cultivation patterns. The applicability of the presented classification scheme was evaluated by a case study of Iowa State in USA with time-series MODIS 250 m Normalized Difference Vegetation Index(NDVI) data sets and past Cropland Data Layers(CDLs). Corn and soybean, which are major crop types in the study area and also display spectral similarity, could be properly classified by applying different classification stages and accounting for past crop cultivation patterns. The classification result by the presented scheme showed increases of minimum 7.68%p and maximum 20.96%p in overall accuracy, compared with one based on purely spectral information. In addition, the combination of temporal contextual information during classification was less affected by the number of NDVI data sets and the best overall accuracy of 86.63% was achieved. Thus, it is expected that this classification scheme can be effectively used for the early production of large-area crop classification maps in major feed-grain importing countries.

• Journal of the Korea Society for Simulation
• /
• v.11 no.4
• /
• pp.15-23
• /
• 2002

As recently the network environment and application services have been more complex and diverse, there has. In this paper we introduce a scheme the extract useful information for network management by analyzing traffic data in user login file. For this purpose we use classification and association rule based on episode concept in data mining. Since login data has inherently time series characterization, convertible data mining algorithms cannot directly applied. We generate virtual transaction, classify transactions above threshold value in time window, and simulate the classification algorithm.