지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학위논문
- 저자정보
- 발행연도
- 2017
- 저작권
- 서울대학교 논문은 저작권에 의해 보호받습니다.
이용수0
이 논문의 연구 히스토리 (3)
- 이 논문의 후속연구가 궁금하신가요?
- 연관 학술논문 또는 학술발표를 통해 보다 발전된 연구결과를 확인하실 수 있습니다.
- 이 논문의 연구 히스토리 확인하기
초록· 키워드
오류제보하기
One-class classification (OCC) is a supervised learning technique for classification, where the classifier is constructed only by training the objects in the target class and determines whether new ones belong to the class or not. There have been attempts to solve OCC problem such as Support Vector Machines (SVM), Parzen Density Estimation (PDE) and other methods commonly used in multi-class classification.
In this paper, a new approach to OCC was proposed. The classifier consists of norm balls covering the objects in the target class: an object is classified in the target class if at least one of the norm balls covers it, otherwise it is rejected. We presented an algorithm of generating finite norm ball candidates. Then, by applying two conditions for ''good'' norm ball the final candidates were chosen out of the candidates. An integer programming model for the selection of the optimal norm balls was solved so that the norm balls with the minimum number effectively detect the target objects with the good predictive power.
The experiments were carried out to test the overall performance of our classifier using some artificial and real data from UCI Repository. The results showed that proposed model was comparable to OCC methods in the comparison group. Also, it had high sparsity leading to low testing burden compared to the other classifiers. In the noise experiment, maximum norm ball classifier was robust to noises.
In this paper, a new approach to OCC was proposed. The classifier consists of norm balls covering the objects in the target class: an object is classified in the target class if at least one of the norm balls covers it, otherwise it is rejected. We presented an algorithm of generating finite norm ball candidates. Then, by applying two conditions for ''good'' norm ball the final candidates were chosen out of the candidates. An integer programming model for the selection of the optimal norm balls was solved so that the norm balls with the minimum number effectively detect the target objects with the good predictive power.
The experiments were carried out to test the overall performance of our classifier using some artificial and real data from UCI Repository. The results showed that proposed model was comparable to OCC methods in the comparison group. Also, it had high sparsity leading to low testing burden compared to the other classifiers. In the noise experiment, maximum norm ball classifier was robust to noises.
목차
Abstract iContents ivList of Tables viiList of Figures xChapter 1 Introduction 11.1 Backgrounds 11.2 Literature Review 31.3 Motivations 6Chapter 2 Norm Ball Classifier 112.1 Definition of Norm Ball Classifier 112.2 Construction of Norm Ball Classifier 132.2.1 Generation of Norm Ball Candidates 132.2.2 Selection of Norm Balls 16Chapter 3 Experiments 213.1 Experiment Design 213.1.1 Data 213.1.2 NBCs and Comparison One-Class Classifier Group 223.1.3 Experimental Settings 233.1.4 Performance Measure 253.2 Computational Results 263.2.1 Artificial Data 263.2.2 Real Data 313.2.3 Noise Experiment 37Chapter 4 Conclusions 514.1 Discussions 514.2 Further Research 54Chapter 5 Appendix 57Bibliography 75국문초록 81
최근 본 자료
댓글(0)
0