政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/111628
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文筆數/總筆數 : 114105/145137 (79%)
造訪人次 : 52183683      線上人數 : 455
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋
    政大機構典藏 > 資訊學院 > 資訊科學系 > 會議論文 >  Item 140.119/111628


    請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/111628


    題名: Integrating adaptive boosting and support vector machines with varying kernels
    作者: Hsu, Kuo-Wei
    徐國偉
    貢獻者: 資訊科學系
    關鍵詞: 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)
    日期: 2017-01
    上傳時間: 2017-08-03 14:13:58 (UTC+8)
    摘要: 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.
    關聯: 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
    資料類型: conference
    DOI 連結: http://dx.doi.org/10.1145/3022227.3022314
    DOI: 10.1145/3022227.3022314
    顯示於類別:[資訊科學系] 會議論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    a88-hsu.pdf290KbAdobe PDF2368檢視/開啟


    在政大典藏中所有的資料項目都受到原著作權保護.


    社群 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 ©   - 回饋