國立虎尾科技大學 |

Unsupervised Learning : = Evaluation, Distributed Setting, and Privacy.

Record Type:	Language materials, manuscript : Monograph/item
Title/Author:	Unsupervised Learning :/
Reminder of title:	Evaluation, Distributed Setting, and Privacy.
Author:	Tsikhanovich, Maksim.
Description:	1 online resource (134 pages)
Notes:	Source: Dissertation Abstracts International, Volume: 79-12(E), Section: B.
Contained By:	Dissertation Abstracts International79-12B(E).
Subject:	Computer science. -
Online resource:	click for full text (PQDT)
ISBN:	9780438206403

Unsupervised Learning : = Evaluation, Distributed Setting, and Privacy.
Tsikhanovich, Maksim.

Unsupervised Learning :Evaluation, Distributed Setting, and Privacy. - 1 online resource (134 pages)

Source: Dissertation Abstracts International, Volume: 79-12(E), Section: B.

Thesis (Ph.D.)--Rensselaer Polytechnic Institute, 2018.

Includes bibliographical references

Chapter 1 is an overview of topic modeling as a set of unsupervised learning tasks. We present the Latent Dirichlet Allocation (LDA) model, and show how k-means as well as non-negative matrix factorization (NMF) can also be interpreted as topic models. We present a variety of quantitative and qualitative evaluation techniques that aim to capture different properties of the model. Finally we show how we can leverage evaluation techniques and hyperparameter optimization tools to answer typical parameter selection questions. We hope to facilitate future research on topic modeling by encapsulating each of the above parts as a robust and re-usable set of tools, so that a future researcher can focus on one part at a time.

Electronic reproduction.
Ann Arbor, Mich. :
ProQuest,
2018

Mode of access: World Wide Web

ISBN: 9780438206403Subjects--Topical Terms:

573171
Computer science.
Index Terms--Genre/Form:

554714
Electronic books.

Unsupervised Learning : = Evaluation, Distributed Setting, and Privacy.
LDR:03217ntm a2200349Ki 4500 001 918996
005 20181106103645.5
006 m o u
007 cr mn||||a|a||
008 190606s2018 xx obm 000 0 eng d
020 $a 9780438206403
035 $a (MiAaPQ)AAI10751762
035 $a (MiAaPQ)rpi:11252
035 $a AAI10751762
040 $a MiAaPQ $b eng $c MiAaPQ $d NTU
100 1 $a Tsikhanovich, Maksim. $3 1193465
245 1 0 $a Unsupervised Learning : $b Evaluation, Distributed Setting, and Privacy.
264 0 $c 2018
300 $a 1 online resource (134 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertation Abstracts International, Volume: 79-12(E), Section: B.
500 $a Adviser: Malik Magdon-Ismail.
502 $a Thesis (Ph.D.)--Rensselaer Polytechnic Institute, 2018.
504 $a Includes bibliographical references
520 $a Chapter 1 is an overview of topic modeling as a set of unsupervised learning tasks. We present the Latent Dirichlet Allocation (LDA) model, and show how k-means as well as non-negative matrix factorization (NMF) can also be interpreted as topic models. We present a variety of quantitative and qualitative evaluation techniques that aim to capture different properties of the model. Finally we show how we can leverage evaluation techniques and hyperparameter optimization tools to answer typical parameter selection questions. We hope to facilitate future research on topic modeling by encapsulating each of the above parts as a robust and re-usable set of tools, so that a future researcher can focus on one part at a time.
520 $a In Chapter 2 we present two algorithms for the data-distributed non-negative matrix factorization (NMF) task, and one for the singular value decomposition (SVD). In the offline setting, M parties have already computed NMF models of their local data. Our algorithm ensembles these into a global model by minimizing an upper bound on the reconstruction error for the original data in terms of reconstruction error on the local models. In the online setting, the M parties are all participating in a synchronous distributed computation. We present an algorithm that reconstructs the centralized NMF solution exactly if given the same initialization. Finally we present an online SVD algorithm. We compare these algorithms in terms of how well they initialize NMF.
520 $a In Chapter 3 we study empirical measures of Distributional Differential Privacy. We want to measure to what extent one participant in a distributed computation can correctly identify the presence of a single document in another participant's database. We propose a measure based on the p -value of the Kolmogorov-Smirnov two-sample hypothesis test. We compare our measures to existing measures such as Differential Privacy, and use it to evaluate the privacy of our online algorithms.
533 $a Electronic reproduction. $b Ann Arbor, Mich. : $c ProQuest, $d 2018
538 $a Mode of access: World Wide Web
650 4 $a Computer science. $3 573171
655 7 $a Electronic books. $2 local $3 554714
690 $a 0984
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a Rensselaer Polytechnic Institute. $b Computer Science. $3 1190468
773 0 $t Dissertation Abstracts International $g 79-12B(E).
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10751762 $z click for full text (PQDT)