• Title/Summary/Keyword: One Class

Search Result 4,073, Processing Time 0.039 seconds

PoMEN based Latent One-Class SVM (PoMEN 기반의 Latent One-Class SVM)

  • Lee, Changki
    • Annual Conference on Human and Language Technology
    • /
    • 2012.10a
    • /
    • pp.8-11
    • /
    • 2012
  • One-class SVM은 데이터가 존재하는 영역을 추출하고, 이 영역을 서포트 벡터로 표현하며 표현된 영역 밖의 데이터들은 아웃라이어(outlier)로 간주된다. 본 논문에서는 데이터 포인트마다 숨겨진 변수(hidden variable) 혹은 토픽이 있다고 가정하고, 이를 반영하기 위해 PoMEN에 기반한 Latent One-class SVM을 제안한다. 실험결과 Latent One-class SVM이 대부분의 구간에서 One-class SVM 보다 성능이 높았으며, 특히 높은 정확율을 요구하는 경우에 더욱 효과적임을 알 수 있었다.

  • PDF

An Efficient One Class Classifier Using Gaussian-based Hyper-Rectangle Generation (가우시안 기반 Hyper-Rectangle 생성을 이용한 효율적 단일 분류기)

  • Kim, Do Gyun;Choi, Jin Young;Ko, Jeonghan
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.41 no.2
    • /
    • pp.56-64
    • /
    • 2018
  • In recent years, imbalanced data is one of the most important and frequent issue for quality control in industrial field. As an example, defect rate has been drastically reduced thanks to highly developed technology and quality management, so that only few defective data can be obtained from production process. Therefore, quality classification should be performed under the condition that one class (defective dataset) is even smaller than the other class (good dataset). However, traditional multi-class classification methods are not appropriate to deal with such an imbalanced dataset, since they classify data from the difference between one class and the others that can hardly be found in imbalanced datasets. Thus, one-class classification that thoroughly learns patterns of target class is more suitable for imbalanced dataset since it only focuses on data in a target class. So far, several one-class classification methods such as one-class support vector machine, neural network and decision tree there have been suggested. One-class support vector machine and neural network can guarantee good classification rate, and decision tree can provide a set of rules that can be clearly interpreted. However, the classifiers obtained from the former two methods consist of complex mathematical functions and cannot be easily understood by users. In case of decision tree, the criterion for rule generation is ambiguous. Therefore, as an alternative, a new one-class classifier using hyper-rectangles was proposed, which performs precise classification compared to other methods and generates rules clearly understood by users as well. In this paper, we suggest an approach for improving the limitations of those previous one-class classification algorithms. Specifically, the suggested approach produces more improved one-class classifier using hyper-rectangles generated by using Gaussian function. The performance of the suggested algorithm is verified by a numerical experiment, which uses several datasets in UCI machine learning repository.

Combining Positive and Negative Features for One-Class Document Classification (One-class 문서 분류를 위한 긍정 자질과 부정 자질의 결합)

  • Song, Ho-Jin;Kang, In-Su;Na, Seung-Hoon;Lee, Jong-Hyeok
    • Annual Conference on Human and Language Technology
    • /
    • 2005.10a
    • /
    • pp.35-42
    • /
    • 2005
  • 문서 분류에서의 one class 분류 문제는 오직 하나의 범주를 생성하고 새로운 문서가 주어졌을 때 그 문서가 미리 만들어진 하나의 범주에 속하는가를 판별하는 문제이다. 기존의 여러 범주로 이루어진 분류 문제를 해결할 때와는 달리 one class 분류에서는 학습 시에 관심의 대상이 되는 하나의 범주와 관련이 있는 문서들만을 사용하여 학습을 수행하기 때문에 범주의 경계를 정하는 것은 매우 어려운 작업이다. 이에 본 논문에서는 기존의 연구에서 one class 분류 문제를 해결할 때 관심의 대상이 되는 예제의 일부를 부정 예제로 간주하여 one class 문제를 two class 문제로 변환하고 추가적으로 새로운 가상 부정 예제를 설정하여 학습을 수행하였던 방법에서 더 나아가 범주화를 위한 적절한 부정자질을 선택하고 이를 긍정자질과 함께 사용하여 학습을 수행한 후 SVM을 통하여 범주화 성능을 학인 해 보기로 한다.

  • PDF

One-Class Document Classification using Pseudo Negative Examples (One-class 문서 분류를 위한 가상 부정 예제의 사용)

  • Song Ho-Jin;Kang In-Su;Na Seung-Hoon;Lee Jong-Hyeok
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07b
    • /
    • pp.469-471
    • /
    • 2005
  • 문서 분류에서의 one class classification 문제는 오직 하나의 범주를 생성하고 새로운 문서가 주어졌을 때 미리 만들어진 하나의 범주에 속하는가를 판별하는 문제이다. 기존의 여러 범주로 이루어진 분류 문제를 해결할 때와는 달리 one class classification에서는 학습 시에 이미 정해진 하나의 범주와 관련이 있는 문서들만을 사용하여 학습을 수행하기 때문에 범주의 경계를 정하는 것이 매우 어려운 작업이며 또한 분류기의 성능에 있어서도 매우 중요한 요소로 작용하게 된다. 본 논문에서는 기존의 연구에서 one class classification 문제를 해결할 때 관심의 대상이 되는 예제의 일부를 부정 예제로 간주하여 one class문제를 two class문제로 변경시켜 학습을 수행했던 것에서 더 나아가 추가적으로 새로운 가상 부정 예제를 설정하여 학습을 수행하고, SVM을 통하여 범주화 성능을 확인해 보기로 한다.

  • PDF

A Study on the Comparisons of Home Economics Educational Effect between Coeducational Class and One-sex Class of Middle School in a Chungnam Rural Area (충남 일부 농촌 중학교 남녀혼성반과 분리반의 가정교과의 교육 효과 비교 연구 -식생활 단원을 중심으로-)

  • 강경심;김갑영
    • Journal of Korean Home Economics Education Association
    • /
    • v.7 no.2
    • /
    • pp.51-66
    • /
    • 1995
  • The purpose of this thesis is to expound reference data on class management such as class formation and so on by comparing Home Economics Education effect of coeducational class and one-sex class in the coeducational middle school. The major findings were follow: 1. More than half of those teacher who answered choose a coeducational class style as an effective class style(51.7%) because of active class atmosphere, preparation for future home life and getting over fixed sexual ideas by equal curricula content. 2. The results of research for basic knowledge about the Part of Food and Nutritional Science, which was conducted before the class, showed that the score of the one-sex class was higher than that of the coeducational calss(p<0.05) 3. The results of evaluation after class were as follows: The score of one-sex class was higher in the protein food group(p<0.01) and carbohydrate food group(p<0.05). The difference of each class in the calcium food group, the mineral and vitamin food group and the oil and fats food group was very small. The total score of two classes was of little difference.

  • PDF

Trajectories of Self-rated Health among One-person Households: A Latent Class Growth Analysis (1인가구의 주관적 건강상태 변화: 잠재계층성장모형을 활용하여)

  • Kim, Eunjoo;Kim, Hyang;Yoon, Ju Young
    • Research in Community and Public Health Nursing
    • /
    • v.30 no.4
    • /
    • pp.449-459
    • /
    • 2019
  • Purpose: The aim of this study is to explore different types of self-rated health trajectories among one-person households in Korea. Methods: We used five time-point data derived from Korea Health Panel (2011~2015). A latent growth curve modeling was used to assess the overall feature of self-rated health trajectory in one-person households, and a latent class growth modeling was used to determine the number and shape of trajectories. We then applied multinomial logistic regression on each class to explore the predicting variables. Results: We found that the overall slope of self-rated health in one-person households decreases. In addition, latent class analysis demonstrated three classes: 1) High-Decreasing class (i.e., high intercept, significantly decreasing slope), 2) Moderate-Decreasing class (i.e., average intercept, significantly decreasing slope), and 3) Low-Stable class (i.e., low intercept, flat and nonsignificant slope). The multinomial logistic regression analysis showed that the predictors of each class were different. Especially, one-person households with poor health condition early were at greater risk of being Low-Stable class compared with High-Decreasing class group. Conclusion: The findings of this study demonstrate that more attentions to one-person households are needed to promote their health status. Policymakers may develop different health and welfare programs depending on different characteristics of one-person household trajectory groups in Korea.

Performance Analysis of ATM Switch Using Priority Control by Cell Transfer Ratio (셀 전송비율에 의한 우선순위 제어방식을 사용한 ATM 스위치의 성능 분석)

  • 박원기;김영선;최형진
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.12
    • /
    • pp.9-24
    • /
    • 1995
  • In this paper, we proposed and analysed two kinds of priority control mechanism to archive the cell loss rate requirement and the delay requirement of each class. The service classes of our concern are the high time priority class(class 1) and the high loss priority class(class 2). Two kinds of priority control mechanism is divided by the method of storing the arriving class 2 cell in buffer on case of buffer full. The first one is the method which discarding the arriving class 2 cell, the second one is the mothod which storing the arriving class 2 cell on behalf of pushing out the class 1 cell in buffer. In the proposed priority schemes, one cell of the class 1 is transmitted whenever the maximum K cells of the class 2 is transmitted on case of transmitting the class 1 cell and the class 2 cell sequentially. In this paper, we analysed the cell loss rate and the mean cell delay for each class of the proposed priority scheme by using the Markov chain. The analytical results show that the characteristic of the mean cell delay becomes better for the class 1 cell and that of the cell loss rate becomes better for the class 2 cell by selecting properly the cell transfer ratio according to the condition of input traffic.

  • PDF

Fuzzy One Class Support Vector Machine (퍼지 원 클래스 서포트 벡터 머신)

  • Kim, Ki-Joo;Choi, Young-Sik
    • Journal of Internet Computing and Services
    • /
    • v.6 no.3
    • /
    • pp.159-170
    • /
    • 2005
  • OC-SVM(One Class Support Vector Machine) avoids solving a full density estimation problem, and instead focuses on a simpler task, estimating quantiles of a data distribution, i.e. its support. OC-SVM seeks to estimate regions where most of data resides and represents the regions as a function of the support vectors, Although OC-SVM is powerful method for data description, it is difficult to incorporate human subjective importance into its estimation process, In order to integrate the importance of each point into the OC-SVM process, we propose a fuzzy version of OC-SVM. In FOC-SVM (Fuzzy One-Class Support Vector Machine), we do not equally treat data points and instead weight data points according to the importance measure of the corresponding objects. That is, we scale the kernel feature vector according to the importance measure of the object so that a kernel feature vector of a less important object should contribute less to the detection process of OC-SVM. We demonstrate the performance of our algorithm on several synthesized data sets, Experimental results showed the promising results.

  • PDF

Design of One-Class Classifier Using Hyper-Rectangles (Hyper-Rectangles를 이용한 단일 분류기 설계)

  • Jeong, In Kyo;Choi, Jin Young
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.41 no.5
    • /
    • pp.439-446
    • /
    • 2015
  • Recently, the importance of one-class classification problem is more increasing. However, most of existing algorithms have the limitation on providing the information that effects on the prediction of the target value. Motivated by this remark, in this paper, we suggest an efficient one-class classifier using hyper-rectangles (H-RTGLs) that can be produced from intervals including observations. Specifically, we generate intervals for each feature and integrate them. For generating intervals, we consider two approaches : (i) interval merging and (ii) clustering. We evaluate the performance of the suggested methods by computing classification accuracy using area under the roc curve and compare them with other one-class classification algorithms using four datasets from UCI repository. Since H-RTGLs constructed for a given data set enable classification factors to be visible, we can discern which features effect on the classification result and extract patterns that a data set originally has.

Creating Level Set Trees Using One-Class Support Vector Machines (One-Class 서포트 벡터 머신을 이용한 레벨 셋 트리 생성)

  • Lee, Gyemin
    • Journal of KIISE
    • /
    • v.42 no.1
    • /
    • pp.86-92
    • /
    • 2015
  • A level set tree provides a useful representation of a multidimensional density function. Visualizing the data structure as a tree offers many advantages for data analysis and clustering. In this paper, we present a level set tree estimation algorithm for use with a set of data points. The proposed algorithm creates a level set tree from a family of level sets estimated over a whole range of levels from zero to infinity. Instead of estimating density function then thresholding, we directly estimate the density level sets using one-class support vector machines (OC-SVMs). The level set estimation is facilitated by the OC-SVM solution path algorithm. We demonstrate the proposed level set tree algorithm on benchmark data sets.