• Title/Summary/Keyword: Multi-class problem

Search Result 141, Processing Time 0.031 seconds

Modular neural network in prediction of protein function (단위 신경망을 이용한 단백질 기능 예측)

  • Hwang Doo-Sung
    • The KIPS Transactions:PartB
    • /
    • v.13B no.1 s.104
    • /
    • pp.1-6
    • /
    • 2006
  • The prediction of protein function basically make use of a protein-protein interaction map based on the concept of guilt-by-association. The method however cannot determine the functions of proteins in case that the target protein does not interact with proteins with known functions directly. This paper studies protein function prediction considering the given problem as a K-class classification problem and proposes a predictive approach utilizing a modular neural network. The proposed method uses interaction data and protein related attributes as well. The experimental results demonstrate that the proposed approach can predict the functional roles of Yeast proteins whose interaction knowledge is not known and shows better performance than the graph-based models that use protein interaction data.

A Study on Short-Term Load Forecasting System Using Data Mining (데이터 마이닝을 이용한 단기부하예측 시스템 연구)

  • Kim, Do-Wan;Park, Jin-Bae;Kim, Juhg-Chan;Joo, Young-Hoon
    • Proceedings of the KIEE Conference
    • /
    • 2003.11c
    • /
    • pp.588-591
    • /
    • 2003
  • This paper presents a new short-term load forecasting system using data mining. Since the electric load has very different pattern according to the day, it definitely gives rise to the forecasting error if only one forecasting model is used. Thus, to resolve this problem, the fuzzy model-based classifier and predictor are proposed for the forecasting of the hourly electric load. The proposed classifier is the multi-input and multi-output fuzzy system of which the consequent part is composed of the Bayesian classifier. The proposed classifier attempts to categorize the input electric load into Monday, Tuesday$\sim$Friday, Saturday, and Sunday electric load, Then, we construct the Takagi-Sugeno (T-S) fuzzy model-based predictor for each class. The parameter identification problem is converted into the generalized eigenvalue problem (GEVP) by formulating the linear matrix inequalities (LMIs). Finally, to show the feasibility of the proposed method, this paper provides the short-term load forecasting example.

  • PDF

Multi-level thresholding using Entropy-based Weighted FCM Algorithm in Color Image (Entropy 기반의 Weighted FCM 알고리즘을 이용한 컬러 영상 Multi-level thresholding)

  • Oh, Jun-Taek;Kwak, Hyun-Wook;Kim, Wook-Hyun
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.6
    • /
    • pp.73-82
    • /
    • 2005
  • This paper proposes a multi-level thresholding method using weighted FCM(Fuzzy C-Means) algorithm in color image. FCM algerian determines a more optimal thresholding value than the existing methods and can extend to multi-level thresholding. But FCM algerian is sensitive to noise because it doesn't include spatial information. To solve the problem, we can remove noise by applying a weight based on entropy that is obtained from neighboring pixels to FCM algerian. And we determine the optimal cluster number by using within-class distance in code image based on the clustered pixels of each color component. In the experiments, we show that the proposed method is more tolerant to noise and is more superior than the existing methods.

An improvement of estimators for the multinormal mean vector with the known norm

  • Kim, Jaehyun;Baek, Hoh Yoo
    • Journal of the Korean Data and Information Science Society
    • /
    • v.28 no.2
    • /
    • pp.435-442
    • /
    • 2017
  • Consider the problem of estimating a $p{\times}1$ mean vector ${\theta}$ (p ${\geq}$ 3) under the quadratic loss from multi-variate normal population. We find a James-Stein type estimator which shrinks towards the projection vectors when the underlying distribution is that of a variance mixture of normals. In this case, the norm ${\parallel}{\theta}-K{\theta}{\parallel}$ is known where K is a projection vector with rank(K) = q. The class of this type estimator is quite general to include the class of the estimators proposed by Merchand and Giri (1993). We can derive the class and obtain the optimal type estimator. Also, this research can be applied to the simple and multiple regression model in the case of rank(K) ${\geq}2$.

Online Selective-Sample Learning of Hidden Markov Models for Sequence Classification

  • Kim, Minyoung
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.15 no.3
    • /
    • pp.145-152
    • /
    • 2015
  • We consider an online selective-sample learning problem for sequence classification, where the goal is to learn a predictive model using a stream of data samples whose class labels can be selectively queried by the algorithm. Given that there is a limit to the total number of queries permitted, the key issue is choosing the most informative and salient samples for their class labels to be queried. Recently, several aggressive selective-sample algorithms have been proposed under a linear model for static (non-sequential) binary classification. We extend the idea to hidden Markov models for multi-class sequence classification by introducing reasonable measures for the novelty and prediction confidence of the incoming sample with respect to the current model, on which the query decision is based. For several sequence classification datasets/tasks in online learning setups, we demonstrate the effectiveness of the proposed approach.

A Study on the Relationship between Class Similarity and the Performance of Hierarchical Classification Method in a Text Document Classification Problem (텍스트 문서 분류에서 범주간 유사도와 계층적 분류 방법의 성과 관계 연구)

  • Jang, Soojung;Min, Daiki
    • The Journal of Society for e-Business Studies
    • /
    • v.25 no.3
    • /
    • pp.77-93
    • /
    • 2020
  • The literature has reported that hierarchical classification methods generally outperform the flat classification methods for a multi-class document classification problem. Unlike the literature that has constructed a class hierarchy, this paper evaluates the performance of hierarchical and flat classification methods under a situation where the class hierarchy is predefined. We conducted numerical evaluations for two data sets; research papers on climate change adaptation technologies in water sector and 20NewsGroup open data set. The evaluation results show that the hierarchical classification method outperforms the flat classification methods under a certain condition, which differs from the literature. The performance of hierarchical classification method over flat classification method depends on class similarities at levels in the class structure. More importantly, the hierarchical classification method works better when the upper level similarity is less that the lower level similarity.

Word Sense Classification Using Support Vector Machines (지지벡터기계를 이용한 단어 의미 분류)

  • Park, Jun Hyeok;Lee, Songwook
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.5 no.11
    • /
    • pp.563-568
    • /
    • 2016
  • The word sense disambiguation problem is to find the correct sense of an ambiguous word having multiple senses in a dictionary in a sentence. We regard this problem as a multi-class classification problem and classify the ambiguous word by using Support Vector Machines. Context words of the ambiguous word, which are extracted from Sejong sense tagged corpus, are represented to two kinds of vector space. One vector space is composed of context words vectors having binary weights. The other vector space has vectors where the context words are mapped by word embedding model. After experiments, we acquired accuracy of 87.0% with context word vectors and 86.0% with word embedding model.

Observer Design for Multi-Output Unobservable Nonlinear Systems (관측가능하지 않은 다중출력 비선형 시스템의 관측기 설계기법)

  • 조남훈
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.10 no.7
    • /
    • pp.575-582
    • /
    • 2004
  • The observer design problem is studied for a class of multi-output nonlinear systems that are not necessarily observable. Generalized nonlinear observer canonical form is introduced for multi-output nonlinear systems to design nonlinear observers. Sufficient conditions are given for a nonlinear system to be transformed by state-space change of coordinates into generalized nonlinear observer canonical form. Based on this canonical from, a sufficient condition is also given for the existence of nonlinear observers. An illustrative example is presented to show the design procedure of the proposed method.

Output Consensus of Non-identical and Stabilizable Linear Systems Having the Same Transfer Matrix (동일한 전달 행렬을 가지는 안정화 가능한 이종 시스템들의 출력 일치)

  • Kim, Ji-Su;Kim, Hong-Keun;Shim, Hyung-Bo;Back, Ju-Hoon
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.9
    • /
    • pp.857-862
    • /
    • 2011
  • This paper studies the output consensus problem for a class of heterogeneous linear multi-agent systems under a fixed directed communication network. The dynamics, as well as its dimension, of each agent can widely differ from the others, but all the agents are assumed to have the same transfer matrix. In addition, only the system outputs are constrained to be delivered through the network. Under these conditions, we show that the output consensus is reached by a group of identical controllers, which is designed to achieve the state consensus for the homogeneous multi-agent system obtained from the minimal realization of the transfer matrix. Finally, an example is given to demonstrate the proposed result.

Label Embedding for Improving Classification Accuracy UsingAutoEncoderwithSkip-Connections (다중 레이블 분류의 정확도 향상을 위한 스킵 연결 오토인코더 기반 레이블 임베딩 방법론)

  • Kim, Museong;Kim, Namgyu
    • Journal of Intelligence and Information Systems
    • /
    • v.27 no.3
    • /
    • pp.175-197
    • /
    • 2021
  • Recently, with the development of deep learning technology, research on unstructured data analysis is being actively conducted, and it is showing remarkable results in various fields such as classification, summary, and generation. Among various text analysis fields, text classification is the most widely used technology in academia and industry. Text classification includes binary class classification with one label among two classes, multi-class classification with one label among several classes, and multi-label classification with multiple labels among several classes. In particular, multi-label classification requires a different training method from binary class classification and multi-class classification because of the characteristic of having multiple labels. In addition, since the number of labels to be predicted increases as the number of labels and classes increases, there is a limitation in that performance improvement is difficult due to an increase in prediction difficulty. To overcome these limitations, (i) compressing the initially given high-dimensional label space into a low-dimensional latent label space, (ii) after performing training to predict the compressed label, (iii) restoring the predicted label to the high-dimensional original label space, research on label embedding is being actively conducted. Typical label embedding techniques include Principal Label Space Transformation (PLST), Multi-Label Classification via Boolean Matrix Decomposition (MLC-BMaD), and Bayesian Multi-Label Compressed Sensing (BML-CS). However, since these techniques consider only the linear relationship between labels or compress the labels by random transformation, it is difficult to understand the non-linear relationship between labels, so there is a limitation in that it is not possible to create a latent label space sufficiently containing the information of the original label. Recently, there have been increasing attempts to improve performance by applying deep learning technology to label embedding. Label embedding using an autoencoder, a deep learning model that is effective for data compression and restoration, is representative. However, the traditional autoencoder-based label embedding has a limitation in that a large amount of information loss occurs when compressing a high-dimensional label space having a myriad of classes into a low-dimensional latent label space. This can be found in the gradient loss problem that occurs in the backpropagation process of learning. To solve this problem, skip connection was devised, and by adding the input of the layer to the output to prevent gradient loss during backpropagation, efficient learning is possible even when the layer is deep. Skip connection is mainly used for image feature extraction in convolutional neural networks, but studies using skip connection in autoencoder or label embedding process are still lacking. Therefore, in this study, we propose an autoencoder-based label embedding methodology in which skip connections are added to each of the encoder and decoder to form a low-dimensional latent label space that reflects the information of the high-dimensional label space well. In addition, the proposed methodology was applied to actual paper keywords to derive the high-dimensional keyword label space and the low-dimensional latent label space. Using this, we conducted an experiment to predict the compressed keyword vector existing in the latent label space from the paper abstract and to evaluate the multi-label classification by restoring the predicted keyword vector back to the original label space. As a result, the accuracy, precision, recall, and F1 score used as performance indicators showed far superior performance in multi-label classification based on the proposed methodology compared to traditional multi-label classification methods. This can be seen that the low-dimensional latent label space derived through the proposed methodology well reflected the information of the high-dimensional label space, which ultimately led to the improvement of the performance of the multi-label classification itself. In addition, the utility of the proposed methodology was identified by comparing the performance of the proposed methodology according to the domain characteristics and the number of dimensions of the latent label space.