國立高雄大學圖資館 |

Language: English

Back

Mining News Content for Popularity P...

Alshangiti, Moayad.

Mining News Content for Popularity Prediction.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Mining News Content for Popularity Prediction.
Author:	Alshangiti, Moayad.
Description:	47 p.
Notes:	Source: Masters Abstracts International, Volume: 54-05.
Notes:	Adviser: Qi Yu.
Contained By:	Masters Abstracts International54-05(E).
Subject:	Computer science.
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1591217
ISBN:	9781321822403

Mining News Content for Popularity Prediction.
Alshangiti, Moayad.

Mining News Content for Popularity Prediction. - 47 p.

Source: Masters Abstracts International, Volume: 54-05.

Thesis (M.S.)--Rochester Institute of Technology, 2015.

The problem of popularity prediction has been studied extensively in various previous research. The idea behind popularity prediction is that the attention users give to online items is unequally distributed, as only a small fraction of all the available content receives serious users attention. Researchers have been experimenting with different methods to find a way to predict that fraction. However, to the best of our knowledge, none of the previous work used the content for popularity prediction; instead, the research looked at other features such as early user reactions (number of views/shares/comments) of the first hours/days to predict the future popularity. These models are built to be easily generalized to all data types from videos (e.g. YouTube videos) and images, to news stories. However, they are not considered very efficient for the news domain as our research shows that most stories get 90% to 100% of the attention that they will ever get on the first day. Thus, it would be much more efficient to estimate the popularity even before an item is seen by the users. In this thesis, we plan to approach the problem in a way that accomplishes that goal. We will narrow our focus to the news domain, and concentrate on the content of news stories. We would like to investigate the ability to predict the popularity of news articles by finding the topics that interest the users and the estimated audience of each topic. Then, given a new news story, we would infer the topics from the story's content, and based on those topics we would make a prediction for how popular it may become in the future even before it's released to the public.

ISBN: 9781321822403Subjects--Topical Terms:

199325
Computer science.

Mining News Content for Popularity Prediction.
LDR:02497nmm a2200289 4500 001 476013
005 20160418090139.5
008 160517s2015 ||||||||||||||||| ||eng d
020 $a 9781321822403
035 $a (MiAaPQ)AAI1591217
035 $a AAI1591217
040 $a MiAaPQ $c MiAaPQ
100 1 $a Alshangiti, Moayad. $3 730231
245 1 0 $a Mining News Content for Popularity Prediction.
300 $a 47 p.
500 $a Source: Masters Abstracts International, Volume: 54-05.
500 $a Adviser: Qi Yu.
502 $a Thesis (M.S.)--Rochester Institute of Technology, 2015.
520 $a The problem of popularity prediction has been studied extensively in various previous research. The idea behind popularity prediction is that the attention users give to online items is unequally distributed, as only a small fraction of all the available content receives serious users attention. Researchers have been experimenting with different methods to find a way to predict that fraction. However, to the best of our knowledge, none of the previous work used the content for popularity prediction; instead, the research looked at other features such as early user reactions (number of views/shares/comments) of the first hours/days to predict the future popularity. These models are built to be easily generalized to all data types from videos (e.g. YouTube videos) and images, to news stories. However, they are not considered very efficient for the news domain as our research shows that most stories get 90% to 100% of the attention that they will ever get on the first day. Thus, it would be much more efficient to estimate the popularity even before an item is seen by the users. In this thesis, we plan to approach the problem in a way that accomplishes that goal. We will narrow our focus to the news domain, and concentrate on the content of news stories. We would like to investigate the ability to predict the popularity of news articles by finding the topics that interest the users and the estimated audience of each topic. Then, given a new news story, we would infer the topics from the story's content, and based on those topics we would make a prediction for how popular it may become in the future even before it's released to the public.
590 $a School code: 0465.
650 4 $a Computer science. $3 199325
650 4 $a Information technology. $3 184390
650 4 $a Web studies. $3 708690
690 $a 0984
690 $a 0489
690 $a 0646
710 2 $a Rochester Institute of Technology. $b Computing and Information Sciences. $3 730232
773 0 $t Masters Abstracts International $g 54-05(E).
790 $a 0465
791 $a M.S.
792 $a 2015
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1591217