English  |  正體中文  |  简体中文  |  Items with full text/Total items : 63190/95884 (66%)
Visitors : 4664232      Online Users : 390
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/50525

    Title: Stray Example Sheltering by Loss Regularized SVM and k NN Preprocessor
    Authors: Yang, Chan-yun;Hsu, Che-chang;Yang, Jr-syu
    Contributors: 淡江大學機械與機電工程學系
    Keywords: k-nearest-neighbor preprocessor;Stray training examples;Support vector machines;Classification;Pattern recognition
    Date: 2009-02
    Issue Date: 2010-08-09 19:19:43 (UTC+8)
    Publisher: New York: Springer New York LLC
    Abstract: This paper presents a new model developed by merging a non-parametric k-nearest-neighbor (kNN) preprocessor into an underlying support vector machine (SVM) to provide shelters for meaningful training examples, especially for stray examples scattered around their counterpart examples with different class labels. Motivated by the method of adding heavier penalty to the stray example to attain a stricter loss function for optimization, the model acts to shelter stray examples. The model consists of a filtering kNN emphasizer stage and a classical classification stage. First, the filtering kNN emphasizer stage was employed to collect information from the training examples and to produce arbitrary weights for stray examples. Then, an underlying SVM with parameterized real-valued class labels was employed to carry those weights, representing various emphasized levels of the examples, in the classification. The emphasized weights given as heavier penalties changed the regularization in the quadratic programming of the SVM, and brought the resultant decision function into a higher training accuracy. The novel idea of real-valued class labels for conveying the emphasized weights provides an effective way to pursue the solution of the classification inspired by the additional information. The adoption of the kNN preprocessor as a filtering stage is effective since it is independent of SVM in the classification stage. Due to its property of estimating density locally, the kNN method has the advantage of distinguishing stray examples from regular examples by merely considering their circumstances in the input space. In this paper, detailed experimental results and a simulated application are given to address the corresponding properties. The results show that the model is promising in terms of its original expectations.
    Relation: Neural Processing Letters 29(1), pp.7-27
    DOI: 10.1007/s11063-008-9092-y
    Appears in Collections:[機械與機電工程學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    1370-4621_29(1)p7-27.pdf815KbAdobe PDF325View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback