國立虎尾科技大學 |

Latent Variable Modeling for Networks and Text : = Algorithms, Models and Evaluation Techniques.

紀錄類型:	書目-語言資料,手稿 : Monograph/item
正題名/作者:	Latent Variable Modeling for Networks and Text :/
其他題名:	Algorithms, Models and Evaluation Techniques.
作者:	Foulds, James Richard.
面頁冊數:	1 online resource (287 pages)
附註:	Source: Dissertation Abstracts International, Volume: 75-11(E), Section: B.
標題:	Computer science. -
電子資源:	click for full text (PQDT)
ISBN:	9781321093810

Latent Variable Modeling for Networks and Text : = Algorithms, Models and Evaluation Techniques.
Foulds, James Richard.

Latent Variable Modeling for Networks and Text :Algorithms, Models and Evaluation Techniques. - 1 online resource (287 pages)

Source: Dissertation Abstracts International, Volume: 75-11(E), Section: B.

Thesis (Ph.D.)--University of California, Irvine, 2014.

Includes bibliographical references

In the era of the internet, we are connected to an overwhelming abundance of information. As more facets of our lives become digitized, there is a growing need for automatic tools to help us find the content we care about. To tackle the problem of information overload, a standard machine learning approach is to perform dimensionality reduction, transforming complicated high-dimensional data into a manageable, low-dimensional form. Probabilistic latent variable models provide a powerful and elegant framework for performing this transformation in a principled way. This thesis makes several advances for modeling two of the most ubiquitous types of online information: networks and text data.

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

Mode of access: World Wide Web

ISBN: 9781321093810Subjects--Topical Terms:

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

554714
Electronic books.

Latent Variable Modeling for Networks and Text : = Algorithms, Models and Evaluation Techniques.
LDR:03548ntm a2200373K 4500 001 915391
005 20180727125214.5
006 m o u
007 cr mn||||a|a||
008 190606s2014 xx obm 000 0 eng d
020 $a 9781321093810
035 $a (MiAaPQ)AAI3631094
035 $a (MiAaPQ)uci:12846
035 $a AAI3631094
040 $a MiAaPQ $b eng $c MiAaPQ
100 1 $a Foulds, James Richard. $3 1188725
245 1 0 $a Latent Variable Modeling for Networks and Text : $b Algorithms, Models and Evaluation Techniques.
264 0 $c 2014
300 $a 1 online resource (287 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: 75-11(E), Section: B.
500 $a Adviser: Padhraic Smyth.
502 $a Thesis (Ph.D.)--University of California, Irvine, 2014.
504 $a Includes bibliographical references
520 $a In the era of the internet, we are connected to an overwhelming abundance of information. As more facets of our lives become digitized, there is a growing need for automatic tools to help us find the content we care about. To tackle the problem of information overload, a standard machine learning approach is to perform dimensionality reduction, transforming complicated high-dimensional data into a manageable, low-dimensional form. Probabilistic latent variable models provide a powerful and elegant framework for performing this transformation in a principled way. This thesis makes several advances for modeling two of the most ubiquitous types of online information: networks and text data.
520 $a Our first contribution is to develop a model for social networks as they vary over time. The model recovers latent feature representations of each individual, and tracks these representations as they change dynamically. We also show how to use text information to interpret these latent features.
520 $a Continuing the theme of modeling networks and text data, we next build a model of citation networks. The model finds influential scientific articles and the influence relationships between the articles, potentially opening the door for automated exploratory tools for scientists. The increasing prevalence of web-scale data sets provides both an opportunity and a challenge. With more data we can fit more accurate models, as long as our learning algorithms are up to the task. To meet this challenge, we present an algorithm for learning latent Dirichlet allocation topic models quickly, accurately and at scale. The algorithm leverages stochastic techniques, as well as the collapsed representation of the model. We use it to build a topic model on 4.6 million articles from the open encyclopedia Wikipedia in a matter of hours, and on a corpus of 1740 machine learning articles from the NIPS conference in seconds.
520 $a Finally, evaluating the predictive performance of topic models is an important yet computationally difficult task. We develop one algorithm for comparing topic models, and another for measuring the progress of learning algorithms for these models. The latter method achieves better estimates than previous algorithms, in many cases with an order of magnitude less computational effort.
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
650 4 $a Statistics. $3 556824
650 4 $a Computer engineering. $3 569006
655 7 $a Electronic books. $2 local $3 554714
690 $a 0984
690 $a 0463
690 $a 0464
710 2 $a ProQuest Information and Learning Co. $3 1178819
710 2 $a University of California, Irvine. $b Computer Science. $3 1179555
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3631094 $z click for full text (PQDT)