English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 109951/140887 (78%)
Visitors : 46270098      Online Users : 1509
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
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 資訊學院 > 資訊科學系 > 會議論文 >  Item 140.119/111624
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/111624


    Title: Heterogeneous AdaBoost with stochastic algorithm selection
    Authors: Hsu, Kuo-Wei
    徐國偉
    Contributors: 資訊科學系
    Keywords: Adaptive boosting;Classification (of information);Information management;Random processes;Stochastic systems;Algorithm selection;Boosting;Ensemble;Ensemble learning;Ensemble learning algorithm;Stochastic algorithms;Training data sets;Learning algorithms
    Date: 2017-01
    Issue Date: 2017-08-03 14:13:12 (UTC+8)
    Abstract: We propose an ensemble learning algorithm based on AdaBoost and employing heterogeneous algorithms with a stochastic process for algorithm selection. Diversity is an important factor in ensemble learning and AdaBoost creates diversity by manipulating training data sets. However, we observe that AdaBoost generates training data sets of low diversity in later iterations. Some researchers suggest the employment of heterogeneous algorithms in ensemble learning to achieve better diversity. Following the idea, we extend AdaBoost and propose an algorithm that employs different base learning algorithms in different iterations. The most distinguishing feature of our algorithm is that it selects algorithms using a stochastic process where their earlier performance is considered. The results from experiments on several data sets show the utility of our algorithm: It could outperform AdaBoost on 22 to 33, depending on settings, out of 40 data sets considered in experiments. © 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.3022266
    DOI: 10.1145/3022227.3022266
    Appears in Collections:[資訊科學系] 會議論文

    Files in This Item:

    File Description SizeFormat
    a40-hsu.pdf339KbAdobe PDF2321View/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