English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113822/144841 (79%)
Visitors : 51817756      Online Users : 634
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU 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
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version
    政大機構典藏 > 資訊學院 > 資訊科學系 > 會議論文 >  Item 140.119/111628


    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/111628


    Title: Integrating adaptive boosting and support vector machines with varying kernels
    Authors: Hsu, Kuo-Wei
    徐國偉
    Contributors: 資訊科學系
    Keywords: Adaptive boosting;Information management;Iterative methods;Learning algorithms;Support vector machines;Vector spaces;Base learners;Classification algorithm;Classification models;Classification performance;Collective classifications;Multi-class;Multiple kernels;Single kernel;Classification (of information)
    Date: 2017-01
    Issue Date: 2017-08-03 14:13:58 (UTC+8)
    Abstract: Adaptive Boosting, or AdaBoost, is a meta-learning algorithm that employs a classification algorithm as a base learner to train classification models and uses these models to perform collective classification. One of its main features is that iteratively it forces the base learner to work more on difficult samples. Usually it can achieve better overall classification performance, when compared to a single classification model trained by the classification algorithm used as the base learner. SVM, short for Support Vector Machine, is a learning algorithm that employs a kernel to project the original data space to a data space where a hyperplane that can linearly separate as many samples of classes as possible can be found. Because both are top algorithms, researchers have been exploring the use of AdaBoost with SVM. Unlike others simply using SVM with a single kernel as the base learner in AdaBoost, we propose an approach that uses SVM with multiple kernels as the base learners in a variant of AdaBoost. Its main feature is that it not only considers difficulties of samples but also classification performance of kernels, and accordingly it selects as well as switches between kernels in the boosting process. The experiment results show that we can obtain better classification performance by using the proposed approach. © 2017 ACM.
    Relation: Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017,
    11th International Conference on Ubiquitous Information Management and Communication, IMCOM 2017; Beppu; Japan; 5 January 2017 到 7 January 2017; 代碼 126221
    Data Type: conference
    DOI 連結: http://dx.doi.org/10.1145/3022227.3022314
    DOI: 10.1145/3022227.3022314
    Appears in Collections:[資訊科學系] 會議論文

    Files in This Item:

    File Description SizeFormat
    a88-hsu.pdf290KbAdobe PDF2360View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback