ASIA unversity:Item 310904400/4688
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 90451/105768 (86%)
造访人次 : 11112402      在线人数 : 669
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/4688


    题名: A parallel concept learning algorithm based upon version space strategy
    作者: T. P. Hong;S. S. Tseng
    贡献者: Department of Information Science and Applications
    日期: 1994
    上传时间: 2009-11-30 16:03:07 (UTC+8)
    出版者: Asia University
    摘要: Applies the technique of parallel processing to concept learning. A parallel version-space learning algorithm based upon the principle of divide-and-conquer is proposed. Its time complexity is analyzed to be O(k log2n) with n processors, where n is the number of given training instances and k is a coefficient depending on the application domains. For a bounded number of processors in real situations, a modified parallel learning algorithm is then proposed. Experimental results are then performed on a real learning problem, showing that our parallel learning algorithm works, and being quite consistent with the results of theoretical analysis. We conclude that when the number of training instances is large, it is worth learning in parallel because of its faster execution
    關聯: IEEE Transactions on Knowledge and Data Engineering 6(6):857-867
    显示于类别:[行動商務與多媒體應用學系] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    0KbUnknown340检视/开启
    310904400-4688.doc52KbMicrosoft Word312检视/开启


    在ASIAIR中所有的数据项都受到原著作权保护.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈