東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Positive Unlabeled Learning: Optimization and Evaluation.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Positive Unlabeled Learning: Optimization and Evaluation./
作者:	Jaskie, Kristen.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2021,
面頁冊數:	221 p.
附註:	Source: Dissertations Abstracts International, Volume: 83-03, Section: B.
Contained By:	Dissertations Abstracts International83-03B.
標題:	Artificial intelligence. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28649660
ISBN:	9798535542645

Positive Unlabeled Learning: Optimization and Evaluation.
Jaskie, Kristen.

Positive Unlabeled Learning: Optimization and Evaluation. - Ann Arbor : ProQuest Dissertations & Theses, 2021 - 221 p.

Source: Dissertations Abstracts International, Volume: 83-03, Section: B.

Thesis (Ph.D.)--Arizona State University, 2021.

This item must not be sold to any third party vendors.

In many real-world machine learning classification applications, well labeled training data can be difficult, expensive, or even impossible to obtain. In such situations, it is sometimes possible to label a small subset of data as belonging to the class of interest though it is impractical to manually label all data not of interest. The result is a small set of positive labeled data and a large set of unknown and unlabeled data. This is known as the Positive and Unlabeled learning (PU learning) problem, a type of semi-supervised learning. In this dissertation, the PU learning problem is rigorously defined, several common assumptions described, and a literature review of the field provided. A new family of effective PU learning algorithms, the MLR (Modified Logistic Regression) family of algorithms, is described. Theoretical and experimental justification for these algorithms is provided demonstrating their success and flexibility. Extensive experimentation and empirical evidence are provided comparing several new and existing PU learning evaluation estimation metrics in a wide variety of scenarios. The surprisingly clear advantage of a simple recall estimate as the best estimate for overall PU classifier performance is described. Finally, an application of PU learning to the field of solar fault detection, an area not previously explored in the field, demonstrates the advantage and potential of PU learning in new application domains.

ISBN: 9798535542645Subjects--Topical Terms:

516317
Artificial intelligence.
Subjects--Index Terms:

Machine learning

Positive Unlabeled Learning: Optimization and Evaluation.
LDR:02588nmm a2200361 4500 001 2348617
005 20220912135619.5
008 241004s2021 ||||||||||||||||| ||eng d
020 $a 9798535542645
035 $a (MiAaPQ)AAI28649660
035 $a AAI28649660
040 $a MiAaPQ $c MiAaPQ
100 1 $a Jaskie, Kristen. $3 3687981
245 1 0 $a Positive Unlabeled Learning: Optimization and Evaluation.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2021
300 $a 221 p.
500 $a Source: Dissertations Abstracts International, Volume: 83-03, Section: B.
500 $a Advisor: Spanias, Andreas.
502 $a Thesis (Ph.D.)--Arizona State University, 2021.
506 $a This item must not be sold to any third party vendors.
520 $a In many real-world machine learning classification applications, well labeled training data can be difficult, expensive, or even impossible to obtain. In such situations, it is sometimes possible to label a small subset of data as belonging to the class of interest though it is impractical to manually label all data not of interest. The result is a small set of positive labeled data and a large set of unknown and unlabeled data. This is known as the Positive and Unlabeled learning (PU learning) problem, a type of semi-supervised learning. In this dissertation, the PU learning problem is rigorously defined, several common assumptions described, and a literature review of the field provided. A new family of effective PU learning algorithms, the MLR (Modified Logistic Regression) family of algorithms, is described. Theoretical and experimental justification for these algorithms is provided demonstrating their success and flexibility. Extensive experimentation and empirical evidence are provided comparing several new and existing PU learning evaluation estimation metrics in a wide variety of scenarios. The surprisingly clear advantage of a simple recall estimate as the best estimate for overall PU classifier performance is described. Finally, an application of PU learning to the field of solar fault detection, an area not previously explored in the field, demonstrates the advantage and potential of PU learning in new application domains.
590 $a School code: 0010.
650 4 $a Artificial intelligence. $3 516317
650 4 $a Computer science. $3 523869
650 4 $a Mathematics. $3 515831
650 4 $a Software. $2 gtt. $3 619355
650 4 $a Diabetes. $3 544344
650 4 $a Deep learning. $3 3554982
650 4 $a Datasets. $3 3541416
650 4 $a Signal processing. $3 533904
650 4 $a Dissertations & theses. $3 3560115
650 4 $a Genomes. $3 592593
650 4 $a Noise. $3 598816
650 4 $a Feedback. $3 677181
650 4 $a COVID-19. $3 3554449
650 4 $a Alzheimers disease. $3 3560855
650 4 $a Simulation. $3 644748
650 4 $a Principal components analysis. $3 565921
650 4 $a Classification. $3 595585
650 4 $a Probability. $3 518898
650 4 $a Literature reviews. $3 3559998
650 4 $a Algorithms. $3 536374
653 $a Machine learning
653 $a Positive unlabeled learning
653 $a PU learning
653 $a Semi-supervised learning
690 $a 0800
690 $a 0984
690 $a 0405
710 2 $a Arizona State University. $b Electrical Engineering. $3 1671741
773 0 $t Dissertations Abstracts International $g 83-03B.
790 $a 0010
791 $a Ph.D.
792 $a 2021
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28649660