語系:
繁體中文
English
說明(常見問題)
回圖書館首頁
手機版館藏查詢
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Improving Machine Learning Algorithm...
~
Cheng, Dehua.
FindBook
Google Book
Amazon
博客來
Improving Machine Learning Algorithms via Efficient Data Relevance Discovery.
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Improving Machine Learning Algorithms via Efficient Data Relevance Discovery./
作者:
Cheng, Dehua.
出版者:
Ann Arbor : ProQuest Dissertations & Theses, : 2018,
面頁冊數:
156 p.
附註:
Source: Dissertations Abstracts International, Volume: 80-06, Section: B.
Contained By:
Dissertations Abstracts International80-06B.
標題:
Computer science. -
電子資源:
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=11015975
Improving Machine Learning Algorithms via Efficient Data Relevance Discovery.
Cheng, Dehua.
Improving Machine Learning Algorithms via Efficient Data Relevance Discovery.
- Ann Arbor : ProQuest Dissertations & Theses, 2018 - 156 p.
Source: Dissertations Abstracts International, Volume: 80-06, Section: B.
Thesis (Ph.D.)--University of Southern California, 2018.
This item must not be sold to any third party vendors.
This is the era of big data, where both challenges and opportunities lie ahead for the machine learning research. The data are created nowadays at an unprecedented pace with a significant cost in collecting, storing, and computing with the current scale of data. As the computational power that we possess gradually plateaus, it is an ever-increasing challenge to fully utilize the wealth of big data, where better data reduction techniques and scalable algorithms are the keys to a solution. We observe that to answer a certain query, the data are not equally important: it is possible to complete the task at hand with fewer but relevant data without compromising accuracy. Based on the models and the query, we provide efficient access to the numerical scores of the data points that represent their relevance to the current task. It enables us to wisely devote the computation resources to the important data, which improves the scalability and the reliability. We present our work with three applications. We developed efficient numerical algorithms for tensor CP decomposition and random-walk matrix-polynomial sparsification, where we provide an efficient access to the statistical leverage scores for a faster randomized numerical routine. We obverse that the model structures, such as the low-rank models, can be leveraged to provide an efficient approximation to data relevance. We also present our matrix completability analysis framework based on both data and the model, which are both structured. And we show that the underlying completability pattern can be utilized to achieve a more reliable estimation of missing entries.Subjects--Topical Terms:
523869
Computer science.
Improving Machine Learning Algorithms via Efficient Data Relevance Discovery.
LDR
:02655nmm a2200301 4500
001
2205638
005
20190828120332.5
008
201008s2018 ||||||||||||||||| ||eng d
035
$a
(MiAaPQ)AAI11015975
035
$a
(MiAaPQ)US_Calif_463734
035
$a
AAI11015975
040
$a
MiAaPQ
$c
MiAaPQ
100
1
$a
Cheng, Dehua.
$3
3432501
245
1 0
$a
Improving Machine Learning Algorithms via Efficient Data Relevance Discovery.
260
1
$a
Ann Arbor :
$b
ProQuest Dissertations & Theses,
$c
2018
300
$a
156 p.
500
$a
Source: Dissertations Abstracts International, Volume: 80-06, Section: B.
500
$a
Publisher info.: Dissertation/Thesis.
500
$a
Liu, Yan.
502
$a
Thesis (Ph.D.)--University of Southern California, 2018.
506
$a
This item must not be sold to any third party vendors.
520
$a
This is the era of big data, where both challenges and opportunities lie ahead for the machine learning research. The data are created nowadays at an unprecedented pace with a significant cost in collecting, storing, and computing with the current scale of data. As the computational power that we possess gradually plateaus, it is an ever-increasing challenge to fully utilize the wealth of big data, where better data reduction techniques and scalable algorithms are the keys to a solution. We observe that to answer a certain query, the data are not equally important: it is possible to complete the task at hand with fewer but relevant data without compromising accuracy. Based on the models and the query, we provide efficient access to the numerical scores of the data points that represent their relevance to the current task. It enables us to wisely devote the computation resources to the important data, which improves the scalability and the reliability. We present our work with three applications. We developed efficient numerical algorithms for tensor CP decomposition and random-walk matrix-polynomial sparsification, where we provide an efficient access to the statistical leverage scores for a faster randomized numerical routine. We obverse that the model structures, such as the low-rank models, can be leveraged to provide an efficient approximation to data relevance. We also present our matrix completability analysis framework based on both data and the model, which are both structured. And we show that the underlying completability pattern can be utilized to achieve a more reliable estimation of missing entries.
590
$a
School code: 0208.
650
4
$a
Computer science.
$3
523869
690
$a
0984
710
2
$a
University of Southern California.
$3
700129
773
0
$t
Dissertations Abstracts International
$g
80-06B.
790
$a
0208
791
$a
Ph.D.
792
$a
2018
793
$a
English
856
4 0
$u
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=11015975
筆 0 讀者評論
館藏地:
全部
電子資源
出版年:
卷號:
館藏
1 筆 • 頁數 1 •
1
條碼號
典藏地名稱
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
W9382187
電子資源
11.線上閱覽_V
電子書
EB
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
評論
新增評論
分享你的心得
Export
取書館
處理中
...
變更密碼
登入