The Scientific World Journal

Volume 2014 (2014), Article ID 734351, 8 pages

http://dx.doi.org/10.1155/2014/734351

Research Article

Hot News Recommendation System from Heterogeneous Websites Based on Bayesian Model

Zhengyou Xia, Shengwu Xu, Ningzhong Liu, and Zhengkang Zhao

Department of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, China

Received 16 March 2014; Accepted 16 June 2014; Published 26 June 2014

Academic Editor: Jorge Garcia Duque

Copyright © 2014 Zhengyou Xia et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

The most current news recommendations are suitable for news which comes from a single news website, not for news from different heterogeneous news websites. Previous researches about news recommender systems based on different strategies have been proposed to provide news personalization services for online news readers. However, little research work has been reported on utilizing hundreds of heterogeneous news websites to provide top hot news services for group customers (e.g., government staffs). In this paper, we propose a hot news recommendation model based on Bayesian model, which is from hundreds of different news websites. In the model, we determine whether the news is hot news by calculating the joint probability of the news. We evaluate and compare our proposed recommendation model with the results of human experts on the real data sets. Experimental results demonstrate the reliability and effectiveness of our method. We also implement this model in hot news recommendation system of Hangzhou city government in year 2013, which achieves very good results.

1. Introduction

Owing largely to the ever-increasing volume and sophistication of information on the web, we are able to access an enormous amount of information from around the globe [1]. Online news reading has become a popular way to read news articles from a huge collection of news sources around the globe. Recommending news stories in personalized web services has become an active research direction with the development of Internet technologies for fast accessing real-time information around the world [2, 3]. Recommender systems are usually classified into three categories, based on how the recommendations are made [4, 5]: content-based recommendation, collaborative filtering, and hybrid. Content-based recommender systems: these recommender systems recommend an item to the user similar to the ones the user preferred in the past [6, 7]. Collaborative recommender systems: these systems recommend an item to the user based on the people with similar tastes and preferences who have liked it in the past. They have the advantage that they can recommend items for which little or no semantic information is available (music, movies, and products) [8–11]. Hybrid recommender systems: these systems combine both the collaborative and content-based recommendation techniques in order to improve the accuracy of the recommendation [12–14].

In this work, we study how to dynamically recommend hot news for group customers (e.g., government staffs) from hundreds of different heterogeneous news websites. Although Liu et al. [15] discuss recommending quality book reviews from heterogeneous websites, most previous studies about recommender systems based on person are presented in many other domains [1, 15–18]; little work is studied on hot news recommendations for group customers (government staffs). Generally, news recommender systems are based on a single website or are used to recommend news to a single user. The basic idea of current news recommender system is based on feedback or user’s personal interests. For example, most websites recommend news to users based on article clicks, user’s personal interests, and social network relation, which is called personalized recommendation. However, for group customers (government staffs), they are only interested in the top 20 (or 50) hottest pieces of news from the whole different websites without considering personal preferences. Therefore, previous personalized recommendation methods are not reliable in this scenario. The detailed reasons are as follows: in China, since many news websites do not need the user to log in, user feedback, social network relation, and personal historical consumptions cannot be achieved; clicks number on news of different websites cannot compare with each other, because there is no display or calculated clicks number on news in some Chinese news websites. Inspired by the above mentioned reasons, we proposed a real time hot news recommendation model based on text summarization and Bayesian model from different websites. In our model, we calculate the probability of hot news for every summary of news contents according to the joint probability equation and rank the probability results in descending order. We select the top 20 (or top 50) hottest news headlines from hundreds of news websites and recommend them to government staffs.

This paper is organized as follows: in Section 2, we present our hot news recommender system based on Bayes model in detail, including the motivation, algorithm. In Section 3, we first analyze our model on the real data set and prove the rationality of parameter selection in our model. Finally we give our conclusion in Section 3.

2. Hot News Recommendation Model Based on Bayesian Model

In the previous researches, we know that most news recommendations depend on clicks ranking or personal interests (or social relation). Click numbers on different news pages are effective only within the same website. We cannot compare hot degree of news from heterogeneous websites by click number of news. For many news websites, we can read online news without logging in. Since some problems exist in the current hot news recommendation from heterogeneous websites, we propose a model based on Bayesian model to recommend top hot news.

2.1. Bayesian Model

Imagine that documents are drawn from a number of classes of documents which can be modeled as sets of words where the (independent) probability that the th word of a given document occurs in a document from class can be written as

For this treatment, we simplify things further by assuming that words are randomly distributed in the document—that is, words are not dependent on the length of the document, position within the document with relation to other words, or other document-contexts.

Then the probability that a given document contains all of the words , given a class , is

The question that we desire to answer is “what is the probability that a given document belongs to a given class ?” In order to answer the question, we define and as follows.

Definition 1. Consider

Definition 2. Consider

Bayes’ theorem manipulates these into a statement of probability in terms of likelihood. Consider

Assume for the moment that there are only two mutually exclusive classes, and (e.g., hot and not hot), such that every element (news) is in either one or the other:

Using the Bayesian result above, we can write

Dividing one by the other gives

Thus, the probability ratio   can be expressed in terms of a series of likelihood ratios. The actual probability can be easily computed from based on the observation that  .

Taking the logarithm of all these ratios, we have

Finally, the document can be classified as follows. It is hot if (i.e., ); otherwise, it is not hot.

2.2. Hot News Recommendation Algorithm Based on Bayesian Model

News headlines are generalization of news contents. Readers often can know the news content through this headline. This is because news headlines contain highly relevant keywords about news content. For news headline from different news websites, if the news contents are similar, they commonly exist in the same keywords as in headline, as shown in Figure 1.

(a)

(b)

(c)

(d)

Figure 1: (a) News headline in http://www.ifeng.com/, (b) news headline in http://www.163.com/, (c) news headline in http://www.people.com.cn/, and (d) news headline in http://www.sina.com.cn/.

As we can see in Figure 1, the vocabularies marked with red line are keywords in the current page. In four different websites, keywords of hot news are usually the same. Therefore, we firstly preprocess news headline. In this paper, we use the word segmentation technology to preprocess news headline. Each headline will be divided into vocabularies with nonfixed length and we calculate the statistic of the frequency of occurrence for each vocabulary. We define the frequency of occurrence of each vocabulary as vocabulary weight , which is defined as follows.

Definition 3. Weight : the frequency of occurrence of each vocabulary in all news headlines.

For different vocabulary, its probability that appears in the hot news is different. As shown in Figure 1, the vocabulary with high weight has high probability to appear in hot news. Therefore, we define an equation to calculate probability of vocabulary, which is shown as follows:

where is probability of vocabulary . The value of shows hot degree of vocabulary. represents the vocabulary . represents the weight of vocabulary , represents the max weight among all vocabularies. 0.9 is coefficient of (10), which is gotten by experience.

For each message, we use the model to determine whether or not it is hot news. We use to represent hot news event and to represent not hot news event, which is shown in Table 1. and represent two vocabularies segmented from news headline with high weight. To facilitate discussion, we use two vocabularies and to describe the basic idea of our model based on Bayesian.

Table 1: High weight vocabulary and hot news.

Event

Hot news

Exist
Exist
Yes

Not exist
Not exist
No

According to previous discussion, the vocabulary with high weight has high probability to appear in hot news. In Table 1, since and vocabularies with high weight exist in event , we consider that event may be a hot news. Similarly, since and vocabularies with high weight do not exist in event , we consider that it may not be a hot news. In order to more accurately express our ideas of model, we use probabilistic methods to reexpress Table 1 as Table 2.

Table 2: Vocabulary with high weight existing probability and hot news probability.

Event

Hot news

In Table 2, probability of vocabulary with high weight existing in hot news is presented as ; probability of vocabulary with high weight existing in hot news is presented as . represents the probability that the news is a hot news. According to above description in Table 2, we can calculate the probability of event and as hot news by solving the joint probability. The calculation equations are shown as follows:

where represents the probability of as a hot news and represents the probability of as a hot news. In the case of vocabulary and vocabulary, we get the probability of the hot news as follows:

Let , for (4), then we get the final equation:

where represents and represents .

We cannot determine whether the news is hot news only by using two vocabularies to analyze news headline in practical applications. Therefore, we should select appropriate number of vocabularies to analyze the news headline. Because length of every news headline is different, according to our practical experience data, we select four vocabularies with higher weight as keywords for a news headline. (We will discuss the reason of selecting four vocabularies in the next section.) For some news headline, their lengths are relatively short and could not be divided into four vocabularies. In this case, we add the default vocabularies to these news headlines. The probability of default vocabularies that exist in hot news is set to 0.4, which means that the default vocabularies are not important and are less than 0.5. The 0.4 is set by experience. Calculation equation of hot news probability finally is shown as follows:

where probability of four vocabularies is, respectively, , and represents the probability of hot news. According to above discussion, the detailed algorithm of hot news recommendation is shown as Algorithm 1.

Hot news recommendation algorithm based on titles

begin

T ← ally of titles

V ← ally of vocabularies

P ← ally of probability of hot news

for every title i in T

     for every vocabulary v in i

             if v exist in V

                      V[v] = V[v] + 1

             else

                      V[v] = 1

             end

     end

end

for every title i in T

     for every vocabulary v in i

             if v is the first four heaviest vocabularies in all vocabularies of i

                        ← 0.9 *

             end

     end

      P[i] ←

end

Sort P by descending

Select Top N from P

end

Algorithm 1: Hot news recommendation algorithm.

2.3. Experimental Results and Analysis

In order to verify the reliability of our model, we do experiments on real data sets. We collected news from 55 different news websites, from 2013.10 to 2013.12, which includes 15243 pieces of news. Because there are different updating frequencies from news website, news from different websites has different proportions of the total number of news as shown in Figure 2.

Figure 2: Distribution of news number for 55 different news websites.

In Figure 2, only a few websites publish more news. The vast majority of websites publish little news and the proportion of news number from these websites is below 0.06. This means that the number of news published and updated is less in most websites. We selected data of two days from our data set to further illustrate our above discussion, which is shown as in Figures 3(a) and 3(b).

(a)

(b)

Figure 3: Proportion of news from different news websites ((a) December 1; (b) December 2).

In Figure 3(a), we selected the data set on December 1 and 2, 2013. The 11 news websites updated news contents, and 8 of them are below 0.06. Figure 3(b) (December 2) also reflects the situation. This means that not all websites publish a lot of news every day, and only a few number of news websites publish more news. In order to observe the relationship between news number and time for different websites, we selected four news websites from the data set, as shown in Figures 4(a), 4(b), 4(c), and 4(d).

(a)

(b)

(c)

(d)

Figure 4: Relationship between news number and time for 4 different websites.

In Figure 4, from October 2013 to December 2013, two websites (a) and (d) have relatively few number of news every day, and two websites (b) and (c) have more number of news every day. For each website, news number has great changes over time, but fluctuated curves of four news websites are similar. It shows that regularities of the four websites published news are similar.

The weight of vocabularies reflects frequency of vocabularies in news headline. According to (2) in the above section, weight of vocabularies is proportional to hot degree of news. Therefore, the weight of vocabulary is one of the important parameters. In Figure 5, we observed the relationships between weight of vocabularies and frequency of weight of vocabularies in one day.

Figure 5: Relationship between weight of vocabularies and frequencies of weight of vocabularies.

In Figure 5, vocabularies with high weight have less frequency appearing in news headline, such as frequencies of vocabularies with weight value of 3 to 9 are less than 10. Frequencies of vocabularies with weight value of 1 are greater than 100. This phenomenon is consistent with the actual situation. In reality, news headline from different news websites may contain same vocabularies, and weights of these vocabularies will be relatively larger. News from different news websites has different focus; therefore, quantity of similar news is in the minority. Generally, these minority pieces of news are regarded as the hot news; namely, hot degree of news is related with weight of vocabularies. Figure 6 further verifies our ideas.

Figure 6: Relationship between vocabulary weight and frequency of vocabulary.

In Figure 6, the maximum of axis and the minimum of axis have apparent difference. In Figure 6, we can obviously observe that the number of vocabularies with weight of 1 makes up the vast majority in total vocabularies, which is close to 0.9. The number of vocabularies with high weight is almost equal to zero. Figure 6 demonstrates our idea.

In (14) of the above section, for each news headline, we selected four vocabularies with most high weight to calculate the probability. Figure 7 gives the reason of why we choose four vocabularies as the threshold of our Bayesian model.

Figure 7: Relationship between number of vocabularies and frequency of news headline.

In Figure 7, when news headlines are divided into vocabularies, very few numbers of news headlines consist of vocabularies less than 4. The vast majority of news headlines can split out the four vocabularies or more. Figure 7 shows that about three hundred pieces of news cannot be split out into four vocabularies in total of 15243 pieces of news. If we use the five vocabularies, the two thousand pieces of news cannot be split out. Therefore, using five vocabularies and more in our model is not suitable because several thousand pieces of news cannot be split out. In actual situation, news headlines with less than four vocabularies are often difficult to summarize the news content. Too many vocabularies often make the headline too complex. Therefore, we determine whether the news is hot news through calculating the joint probability of four vocabularies.

In order to verify the validity and reliability of our model, we randomly choose 2000 pieces of news from our news data set. Since there is little research work about hot news recommendation from plenty of different news websites, we cannot find related algorithms about our research. Therefore, we cannot compare our model with other previous works. We have to compare our model with human expert’s selection. We invited five news staffs to select top 10, 20, 30, 40, 50, 60, 70, 80, 90, and 100 hot pieces of news from the 2000 news data sets. We compare similarity of these two result sets, as shown in Figure 8.

Figure 8: Similarity results of our model and human experts.

In Figure 8, when we select the hottest top 10 pieces of news, similarity of the result of our method and human experts is relatively low because when the news quantity is less, the human experts’ subjective influences will make a difference for hot news. And with the increase of number of news, human experts’ subjective influences will decrease accordingly. Therefore, when the number of hot news reaches a certain value, the result of our model and human experts is similar. For these 2000 pieces of news, when the top number of hot news is 100, precision of results is ideal.

3. Conclusion

In this paper, we investigate the problem of hot news recommendation from plenty of heterogeneous news websites and try to resolve some critical issues of this problem, for example, without click number, personal history, and personal interests. To do so, we explore the hot news recommendation from different news websites based on Bayesian model. We do plenty of experiments on real data sets to illustrate the basic idea and motivation of our model. We compare the result of our model with the result of human news staffs. The experimental results show that our model can effectively extract top hot news from news data sets which are collected from different websites. We implement our model in hot news recommendation system of Hangzhou city government in 2013. Our hot news recommendation system dynamic provides top 30 oversea pieces of news, top 50 domestic pieces of news, and top 30 local city pieces of news from Hangzhou city government. Currently, our model cannot deal with “black hole phenomenon,” which means that news content is basically the same, but they have completely different headlines. For future work, we plan to investigate the “black hole phenomenon” of our model and propose the better methods to solve it.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgment

This work is supported by the NUAA Fundamental research funds (NS2013087).

References

Z. Xia and Z. Bu, “Community detection based on a semantic network,” Knowledge-Based Systems, vol. 26, pp. 30–39, 2012.

G. Adomavicius and A. Tuzhilin, “Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions,” IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 6, pp. 734–749, 2005.

E. Gabrilovich, S. Dumais, and E. Horvitz, “Newsjunkie: providing personalized newsfeeds via analysis of information novelty,” in Proceedings of the 13th International World Wide Web Conference (WWW '04), pp. 482–490, New York, NY, USA, May 2004.

A. Tuzhilin and G. Adomavicius, “Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions,” IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 6, pp. 734–749, 2005.

M. Balabanovic and Y. Shoham, “Fab: content-based, collaborative recommendation,” Communications of the ACM, vol. 40, no. 3, pp. 66–72, 1997.

J. Ahn, P. Brusilovsky, J. Grady, D. He, and S. Y. Syn, “Open user profiles for adaptive news systems: help or harm?” in Proceedings of the 16th International World Wide Web Conference (WWW '07), pp. 11–20, Banff, Canada, May 2007.

J. Wang, Q. Li, Y. P. Chen, J. Liu, C. Zhang, and Z. Lin, “News recommendation in forum-based social media,” in Proceedings of the 24th AAAI Conference on Artificial Intelligence and the 22nd Innovative Applications of Artificial Intelligence Conference, pp. 1449–1454, Atlanta, Ga, USA, July 2010.

Y. Seroussi, F. Bohnert, and I. Zukerman, “Personalised rating prediction for new users using latent factor models,” in Proceedings of the 22nd ACM Conference on Hypertext and Hypermedia (HT '11), pp. 47–56, New York, NY, USA, June 2011.

R. M. Rodríguez, M. Espinilla, P. J. Sánchez, and L. Martínez-López, “Using linguistic incomplete preference relations to cold start recommendations,” Internet Research, vol. 20, no. 3, pp. 296–315, 2010.

H. J. Ahn, “A new similarity measure for collaborative filtering to alleviate the new user cold-starting problem,” Information Sciences, vol. 178, no. 1, pp. 37–51, 2008.

L. Li, W. Chu, J. Langford, and R. E. Schapire, “A contextual-bandit approach to personalized news article recommendation,” in Proceedings of the 19th International Conference on World Wide Web (WWW '10), pp. 661–670, Raleigh, NC, USA, April 2010.

E. Hensinger, I. Flaounas, and N. Cristianini, “Modelling and explaining online news preferences,” in Pattern Recognition—Applications and Methods, vol. 204 of Advances in Intelligent Systems and Computing, pp. 65–77, Springer, Berlin, Germany, 2013.

L. Li, D. Wang, T. Li, D. Knox, and B. Padmanabhan, “SCENE: a scalable two-stage personalized news recommendation system,” in Proceedings of the 34th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '11), pp. 125–134, New York, NY, USA, July 2011.

R. Burke, “Hybrid systems for personalized recommendations,” in Intelligent Techniques for Web Personalization, B. Mobasher and S. S. Anand, Eds., vol. 3169 of Lecture Notes in Computer Science, pp. 133–152, Springer, Berlin, Germany, 2005.

D. Liu, W. Chen, and P. Chiu, “Recommending quality book reviews from heterogeneous websites,” Internet Research, vol. 23, no. 1, pp. 27–46, 2013.

R. Carreira, J. M. Crato, D. Gonçalves, and J. A. Jorge, “Evaluating adaptive user profiles for news classification,” in Proceedings of the 9th International Conference on Intelligent User Interfaces, 2004.

S. Kumar and M. Kulkarni, “Graph based techniques for user personalization of news streams,” in Proceedings of the 6th ACM India Computing Convention, vol. 12, pp. 1–7, ACM, Tamil Nadu, India, 2013.

J. Ahn, P. Brusilovsky, J. Grady, D. He, and S. Y. Syn, “Open user profiles for adaptive news systems: help or harm?” in Proceedings of the 16th International World Wide Web Conference (WWW '07), pp. 11–20, Banff, Canada, May 2007.