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


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/109869


    题名: Active Learning with Sequential Sampling and Dimension Reduction for Analyzing Large-Scale Datasets
    作者: Wang, Charlotte;Chang, Yuan-chin Ivan
    关键词: active learning;clustering;D-optimal design;sequential sampling
    日期: 2016-12-09
    上传时间: 2017-03-10 02:19:47 (UTC+8)
    摘要: Active learning is a kind of semi-supervised learning methods in which learning algorithm is able to interactively query some information to get new subjects’ labels/classes. When labeling subjects is quite expensive, active learning is a possible solution to reduce cost because only the selected subjects need to be exanimated and labeled, such as in money laundering detection and disease screening. For analyzing large-scale datasets, the large sample size and high dimension become a challenge for both analysis and computation. In this talk, we will present an active learning algorithm for analyzing large-scale datasets. The proposed method is based on a logistic regression model with a modified iterative algorithm for estimating parameters in order to be more computational efficiency, without sacrificing too much in statistical efficiency. In addition, the methods of shrinkage estimation and subject clustering are considered for selecting effective variables and reducing subject-searching time when analyzing large-scale datasets. For the perspectives of uncertainty sampling and precision of parameter estimates, we search the representatives of subject clusters and select useful samples based on the concept of sequential D-optimal design. The real data applications and simulations will be used to evaluate the performance of the proposed active learning algorithm.
    關聯: no proceeding
    显示于类别:[數學學系暨研究所] 會議論文

    文件中的档案:

    档案 大小格式浏览次数
    index.html0KbHTML114检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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