淡江大學機構典藏:Item 987654321/109869
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 62805/95882 (66%)
造訪人次 : 3985908      線上人數 : 305
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/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.html0KbHTML227檢視/開啟

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

    TAIR相關文章

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