Next Article in Journal
Review on Corrosion Inhibitors for Oil and Gas Corrosion Issues
Previous Article in Journal
Improving Innovation from Science Using Kernel Tree Methods as a Precursor to Designed Experimentation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

User–Topic Modeling for Online Community Analysis

Department of Electrical and Computer Engineering, Pusan National University, Busan 46241, Korea
*
Author to whom correspondence should be addressed.
Appl. Sci. 2020, 10(10), 3388; https://doi.org/10.3390/app10103388
Submission received: 31 March 2020 / Revised: 30 April 2020 / Accepted: 8 May 2020 / Published: 14 May 2020
(This article belongs to the Section Computing and Artificial Intelligence)

Abstract

:
Analyzing user behavior in online spaces is an important task. This paper is dedicated to analyzing the online community in terms of topics. We present a user–topic model based on the latent Dirichlet allocation (LDA), as an application of topic modeling in a domain other than textual data. This model substitutes the concept of word occurrence in the original LDA method with user participation. The proposed method deals with many problems regarding topic modeling and user analysis, which include: inclusion of dynamic topics, visualization of user interaction networks, and event detection. We collected datasets from four online communities with different characteristics, and conducted experiments to demonstrate the effectiveness of our method by revealing interesting findings covering numerous aspects.

1. Motivation

The online community is an important virtual space where information spreads and users express their opinions and emotions. The efficiency and immediacy of online communication encourage users to be more active, and it becomes possible to overcome spatial and temporal restrictions, so that a large number of users can interact with each other at the same time and—albeit virtual—place. The high level of activity in online communities provides large amounts of information from various perspectives. Many commercial and social agencies, such as tourism [1], advertising [2], recruiting [3], and social security [4] have benefited by utilizing interaction data from these online spaces. On the other hand, this instant communication can cause serious problems, such as rapid propagation of fake news [5] and conflicts [6]. These side effects of web activity are not limited to the online space, rather they affect our lives profoundly. While attempting to resolve these social problems, it is important to analyze how users behave, how they communicate, and how they interact in this virtual space. Many researchers have focused on discovering the fundamental mechanism of a certain behavior, such as empathy [7] or conflict [6]. Some work concentrated on specific user types, such as contributors [8], anti-social users [9,10], and lurkers [11]. Others focused on changes in word usage [12,13], and the development of conventions [14].
This work is focused on analyzing user behavior from the perspective of topics. For this purpose, we utilize the latent Dirichlet allocation (LDA), originally developed for language processing tasks. LDA is one of the most successful language modeling methods, whose basic concept is that words appear according to their latent topics. It infers the latent topic of each word using a generative probabilistic model, which describes the concept. There have been many extensions to this method, adding more variables and dependencies reflecting a variety of features available in web communities [15,16,17]. These often involve substantial computation and a high degree of complexity in their implementation. Complex models have low flexibility, in that they tend to fail when part of a required data field is not available; for example, a model using rating scores cannot work for web communities that do not provide a user-rating system.
Instead of developing a complex probabilistic model for analyzing user behavior, we adopted the simple form of the topic modeling method to ensure flexibility, but we make an important and effective substitution. Specifically, we use the LDA technique, substituting the concept of “words” in the textual data with “users” in the online community. We also present a preprocessing method that should be considered when taking into account the exploitation of online community datasets, which enables the proposed method to capture both the temporal and thematic features of user behavior effectively. Although the concept itself has been introduced in our previous work [18], we provide extensive experimental results in this work especially focusing on demonstrating the capability of analyzing user behavior in web communities from many perspectives, which the previous work did not cover.
The contributions of this paper are as follows:
  • We present an analysis method, using topic modeling, for user behavior in online communities, with applications.
  • The proposed method is simple because it uses standard LDA with the small substitution of user participation for word occurrence. It is also flexible, because it does not use too many features, yet ensures sufficient functionality in many applications of user behavior analysis.
  • We also demonstrate the effectiveness of our method by conducting experiments on various datasets and revealing interesting findings.
The remainder of the paper is organized as follows. After briefly reviewing related work in Section 2, we introduce the main concept of the proposed method, including the analogy between standard topic modeling and our work, with procedural details, in Section 3. In Section 4, we describe the datasets which will be used for the case studies, showing the application of the proposed method in Section 5. We present our conclusions in Section 6.

2. Related Work

Topic modeling is one of the most successful methods in computational linguistics. The latent Dirichlet allocation (LDA, [19]) was presented as a generative probabilistic model to estimate the latent topics from observable words. This method was shown to be effective in many tasks in natural language processing, and it has seen many improvements and extensions over the last two decades. As a direct application, LDA has been used to analyze textual content in terms of topics in many document types, such as research articles [20] and software requirement documents [21]. More complex tasks involving textual data, such as link prediction of authors based on the contents of their work [22] have also benefited from the topic modeling method.
Topic modeling has also been exploited in domains other than conventional text. Table 1 lists several related studies that exploit the topic modeling method in different domains using appropriate analogies, similar to our work presented in this paper. Target domains include program source code [23], word network [24], information of the side effects of medical drugs [25], web browsing history [26], and item purchase lists [27]. Especially, several studies applied the topic modeling to user analysis [28,29,30]. These methods exploit the topic modeling technique to analyze the user network. This user network can be obtained directly from the dataset such as Twitter [28,29], or is constructed from a user co-occurrence relationship [30]. However, this network-based exploitation of topic modeling is not quite effective for online community analysis. We discuss the differences from the proposed method in detail in the experimental section.
Several extensions have also been presented for application to user modeling and web data. Li et al. presented an extended LDA that uses tagging and resource information in a social bookmarking web service [15]. Nguyen and Shirai proposed a prediction model based on LDA combining stock prices and articles from a financial forum [31]. Pu et al. extended topic modeling, including item and sentiment to analyze user reviews, and demonstrated their model’s use on movie and restaurant review datasets [17]. Other applications have also been considered, such as link prediction [16] and rating prediction [32]. A major challenge has been dealing with the dynamic way that topics change over time. After Blei and Lafferty presented dynamic topic modeling [33], which adds temporal components to the standard topic modeling method, several variations have been presented [34]. Some researchers took dynamic topic modeling into account in their applications [35]. Several studies have proposed the development of the topic modeling itself by considering the characteristics of the target domain (for example [36]).

3. Topical User Modeling

In this section, we present our proposed method, which we name the user–topic model. First, we briefly present the analogy between standard topic modeling and our proposed method, which is the core concept of the method. Then we present the topic assignment procedure, which consists of three parts: (i) preliminaries, which introduces the notation used in the remainder of the paper, (ii) preprocessing, which involves data filtering, and (iii) implementation, which describes the utilization of Gibbs sampling for topic estimation.

3.1. Analogy

The underlying concept of the proposed method is that the users in an online community leave comments according to their own behavioral characteristics, affected by personal behavior such as interests and active time slots, and environmental factors such as social events and influential incidents. This is analogous to the concept of the classical topic-modeling method, in which words appear in documents according to their latent topics. We use this conceptual similarity between user behavior and text modeling to analyze user behavior in online communities by exploiting classical topic modeling methods. The analogies listed in Table 2 show the correspondence between the two models.
An online community is analogous to a corpus of textual documents. When an article (or post, thread) is uploaded to an online community, users read it and are involved by leaving comments to it. Although a comment has a textual content, we use its writer to represent it. Therefore, an article is represented as a sequence of users (comment writers), which is analogous to a document being represented as a sequence of words. Recalling the generative probabilistic model of standard topic modeling, we can describe the generative procedure of our probabilistic model as follows. Let K be a prespecified number of topics. For each article a i , we randomly pick a K-dimensional multinomial distribution P ( τ | a i ) from the Dirichlet distribution with a prespecified parameter. For each comment, we randomly sample its latent topic τ { 1 , , K } from the multinomial distribution; let τ be the selected topic. Then a user is chosen from the distribution P ( x | τ ) . We need to estimate two probability distributions, P ( τ | a i ) and P ( x | τ ) , from the observed user sequence.

3.2. Topic Assignment Procedure

This subsection describes the procedure for estimating the latent topic in user–topic modeling.

3.2.1. Preliminaries

We denote by A = { a 1 , , a n } the set of n articles, each of which is represented as a sequence a i = u j ( i ) of users where u j ( i ) U indicates the user who wrote the j-th comment on the i-th article. The user set U consists of m users, and a specific user is denoted by x. The time at which article a i is posted is denoted by t ( a i ) .
Let K be the number of topics. In the topic assignment procedure, each individual user’s participation is labeled with one of the topics τ 1 , , τ K . We denote this assigned label as a latent variable z = z j ( i ) , where z j ( i ) { 1 , , K } indicates the topic assigned to the user contributing to the j-th comment in the i-th article.

3.2.2. Preprocessing

In topic modeling on natural language data, the input textual data is preprocessed before it is used in the main process. This includes such procedures as removing tokenization, lemmatization, stop word removal, and insignificant word filtering. Likewise, we need to preprocess the user sequence data rather than using it in its raw form. Although we utilize the same method, there are differences in characteristics between the two domains. Focusing on these differences, we propose our own preprocessing technique before applying the topic modeling method to user participation data.
Similar to preprocessing linguistic data, where documents that are too short are filtered out, we exclude articles that only a small number of users have participated in. On the other hand, unlike natural language data, where there are some words like “a” and “the” that appear in every document, we do not observe an individual user leaving comments on every article in the online community. What matters more in web community data are users who have an exceedingly short lifetime. These users have participated in only a small number of articles, then quit the community. If we analyze user behavior without excluding these temporary users, latent topics would be dominated by the lifetime of their engaged users, so we may fall into a trap where only temporal behavior is taken into account. Therefore, we only include users whose lifetime spans almost the full timeline of the dataset.
Let T ( x ) be the set of all timestamps of articles in which user x is involved:
T ( x ) = { t ( a i ) : a i A , u j ( i ) = x   for   some   j }
Then we define the lifetime λ ( x ) of user x as the number of articles between the first and last participation of x as a fraction of the total number of articles:
λ ( x ) = | { a i A : min T ( x ) t ( a i ) max T ( x ) } | A |
Figure 1 shows a topic distribution over time and provides an example of how this lifetime filter works. Figure 1a shows the topic distribution without applying the lifetime filter, where the distribution is dominated by time; for example, articles posted at the beginning are most likely to have Topic 6 and those at the end of the timeline are most likely to have Topic 1, regardless of what they contain and how users have responded. In Figure 1b, when the lifetime filter is applied, this excessive temporal dominance is moderated while dynamic features in topic variations can still be detected.
We also filter out articles in which too small a number of users participated, and users who participated in too small a number of articles. Specifically, we remove articles in which less than θ 1 users participated, and we also remove users who appeared in less than θ 2 articles. We repeat this removal until all the remaining articles have at least θ 1 users and all the remaining users participated in at least θ 2 articles.

3.2.3. Topic Assignment with Gibbs Sampling

After preprocessing, we estimate the latent topic for each occurrence of a user using Gibbs sampling. First we assign random topics for each latent variable z = z j ( i ) , where z j ( i ) indicates the latent topic of the user for the j-th comment in the i-th article. Subsequently, iterating each of indices i and j, we choose the latent topic z j ( i ) by random sampling, regarding the distribution of topics in the remainder of the assignment after removing z j ( i ) , denoted by z ^ j ( i ) . We also denote by z j ( i ) the partial assignment of z ^ j ( i ) corresponding to the i-th article; i.e., the topic assignment for the user participating in comments in the i-th article except its j-th comment. The probability for sampling can be computed as follows:
P ( z j ( i ) = k | z ^ j ( i ) , A ) = P ( z j ( i ) = k | z ^ j ( i ) , u j ( i ) ) P ( z j ( i ) = k , u j ( i ) | z ^ j ( i ) ) P ( u j ( i ) | z j ( i ) = k , z ^ j ( i ) ) P ( z j ( i ) = k | z ^ j ( i ) ) P ( u j ( i ) | z j ( i ) = k ) P ( z j ( i ) = k | z j ( i ) )
We define two matrices M and D where M k , x is the number of assignments of topic τ k to user x { 1 , , m } , and D i , k is the number of assignments of topic τ k in article a i . Then the first factor P ( u j ( i ) | z j ( i ) = k ) can be computed from the k-th row of M, and the second factor P ( z j ( i ) = k | z j ( i ) ) can be computed from the i-th row of D. Thus, we can compute this probability as follows:
P ( z j ( i ) = k | z ^ j ( i ) , A ) M k , x y = 1 m M k , y D i , k l = 1 K D i , l D i , k M k , x y = 1 m M k , y
We also use Laplace smoothing for these matrices by adding α (and β ) for every entry of matrix D (and M, respectively), in order to avoid dividing by zero. We used α = 1 and β = 0 . 1 in this work.

4. Dataset Description

Before presenting our use of the proposed method in the analysis of online communities, we provide a detailed description of the datasets used. We collected articles with attached comments from three online communities (Reddit, Slashdot, and PGR21) as in Table 3.
Reddit is one of the largest online communities in the United States, and it consists of a number of subcommunities called subreddits, among which we selected two subreddits: r/politics and r/AskReddit. Our reason for selecting these is two-fold. They are both popular subreddits with a large number of active users. In subreddit r/politics, the main topic is political issues, as its name indicates, and on average more than 650 articles are posted per day. In the dataset we collected, more than 209 k users participated in the articles, leaving a total of 4.1 M comments. In r/AskReddit, questions across a variety of fields, ranging from “personal stuff” to serious social problems, are uploaded, and users answer and discuss the questions they are interested in. There are 5 k articles per day on average, in which 1.2 M users leave a total of more than 13 M comments. The users in these two subreddits display different behaviors. The user interaction in r/politics is observed to be more intensive than that in the AskRedit subreddit. The number of articles receiving more than 10 comments in r/politics is 63.8% of all articles, while only 40.4% of articles in r/AskReddit achieved this. About 7% of users leave at least 50 comments in r/politics, while the portion of such users in r/AskReddit is only 3.6%.
Slashdot is a discussion-centric community with a moderate scale. This community supports many functionalities, such as categorization and comment-rating systems, to encourage intensive and constructive discussion across a variety of topics. The average number of articles posted per day is about 20, which is considerably smaller than for the Reddit datasets. Due to this difference in scale, we collected articles over 3 years from Slashdot, while the duration of the Reddit dataset is about 3 months. However, this difference in article generation rates provides another perspective on community characteristics. User participation in Slashdot is more active as the exposure of each individual article lasts much longer, and almost all articles have at least 10 comments, while about 36% of the articles in r/politics have less than 10 comments.
PGR21 is another moderate-scale community in South Korea, which also has a relatively low article generation rate, less than 20 articles per day. We collected articles from PGR21 freeboard for 3 years. This community is not as dedicated to discussion as Slashdot is. Users can post articles on any topic, ranging from “mild” stories of everyday life to controversial political issues. However, some community rules (for example each article should contain a certain amount of personal opinion from the article uploader), and a relatively longer exposure of articles (about 2–3 days on the front page), encourage users to actively communicate with each other, which sometimes leads to intense discussion.

5. Case Study: Experimental Results

In this section, we present some experimental results obtained using our proposed user–topic model. For the preprocessing step, we used the parameters θ 1 = 25 , θ 2 = 50 , except for PGR21 where θ 1 = θ 2 = 10 is used, due to its relatively small scale. For the implementation of Gibbs-sampling for topic modeling, we used GibbsLDA++ [37]. We performed topic modeling with the number of topics ranging from 2 to 64. From these we selected some notable results, which show the variety of ways in which our method can be applied.

5.1. Thematic and Temporal Analysis

User–topic modeling can be used to analyze the behavioral characteristics of community users in terms of thematic and temporal factors. A temporal topic is one that users actively engage with over a certain time period. A temporal topic can be generated from a significant event, or it can develop naturally when some particular users are consistently active over a certain time period. An article with a thematic topic is consistently addressed over time, and involves users who are interested in this topic.

5.1.1. Temporal Topic Flow

The basic method of demonstrating the characteristics of topics is to depict how active they are over time. We define topic flow φ k ( d ; w ) of a topic τ k starting at time d (in days), with time window size w, as the number of occurrences of τ k in the topic assignment within the given time interval; e.g., φ 2 ( 5 ; w = 10 ) indicates the number of occurrences of topic τ 2 within 10 days from the 5th day in the dataset.
φ k ( t ; w ) = a i A d d + w | { j : z j ( i ) = k } |
where A d d + w is the set of articles that are uploaded within the interval [ d , d + w ] :
A d d + w = { a i A : d t day ( a i ) < d + w }
Figure 2 shows the topic flow for the SD dataset with the number of topics K = 4 and w = 20 . We observe that Topic 1 occupies a large portion of the first half of the dataset, and the portion of Topic 3 gradually increases with time. Topics 2 and 4 are more evenly distributed over time than the other topics.
From the variation of a topic over time, we can distinguish temporal topics from thematic topics. Temporal topics are formed by users who actively participate in community activity over a certain time frame, therefore the temporal factor can be determined from the difference between the maximum and minimum degree of topic activation. We define the temporality of a topic τ k as follows:
temporality ( k ) = lg max d φ k ( d ) min d φ k ( d )
Note that temporal and thematic topic factors are not mutually exclusive, which means a topic can have both temporal and thematic factors. For example, if many users are involved in discussion of a political election, this user behavior can be detected as a topic that has political issues as a thematic factor, and the election period as a temporal factor.
Table 4 shows the temporality of each topic depicted in Figure 2. We also list the topic subjects, and their classification as temporal or thematic topics according to their temporalities. It is obvious that Topic 1 is a temporal topic, because it has gradually decreased over time, and its share has almost disappeared by the end of the dataset period. Topics 2 and 4 are classified as thematic topics due to low temporality measures. Their contents are climate change and OS development, respectively. Topic 3 is determined to be a combination of the two classes. Several articles regarding technology and business tend to have topics with this classification. Its portion gradually increases over time, but the change is not as great as that of Topic 1, which has shrunk almost to zero by the end of the period.

5.1.2. Qualitative Topic Assessment from Top Articles

We can qualitatively determine which thematic subjects belong to a topic by examining the articles whose engaged users mostly have the topic assigned to them. From the topic assignment we can easily compute the probability P ( τ k | a i ) , which indicates the portion of topic τ k in article a i . Table 5 shows the top-5 articles per topic in terms of probability P ( τ k | a i ) from the Slashdot dataset (SR) with K = 4 . Even though we did not use any textual information in our modeling, we observe that the resulting topics show thematic consistency in their textual contents. This demonstrates our underlying assumption that users would behave according to the thematic subjects with their own interests. More specifically, Topics 2 and 4 clearly show their related thematic topics from the titles of the top engaged articles. The articles of Topic 2 deal with environmental issues such as climate change. Although its top article does not seem to show this topic in its title, some users opened the discussion on this topic with the election pledges and statements of the presidential election candidates. Topic 4 deals with subjects in software development, such as operating systems and related software. Meanwhile, articles on Topic 3 are observed to be related to technology, economics and business, which cover a broader area than Topics 2 and 4. Lastly, articles on Topic 1 have a variety of subjects and are likely to be affected by temporal factors, as shown in Figure 2, where the distribution of Topic-1 articles is biased towards the first half of the dataset.

5.1.3. Comparison with Textual Topic Modeling

We also compared our proposed modeling with classical text-based topic modeling. For this comparison, we exploited the topic modeling method, using the textual content of the articles. Figure 3 shows the results of both user-based and text-based topic modeling. We depicted the relative portion of topics in order to show the temporal variation of the distribution clearly.
In the text-based topic modeling, the topics are more evenly distributed along the time axis compared to the user–topic modeling. This shows that text-based topic modeling is not appropriate for representing temporal factors, which change dynamically over time, in tasks such as event detection. On the other hand, our user–topic model shows more variation with time. It deals with the dynamic nature of topics in a way which addresses the concerns raised in the literature [33]. While other researchers have tackled this dynamicity problem using more complex probabilistic models [33,34], our proposed method can be used for dynamic analysis without any further modification other than the substitution of words with users.

5.2. User Clustering

As user–topic modeling is based on the assumption that users with similar latent topics are likely to be engaged in the same article, the proposed method can also be used for clustering purposes. Each user can be represented as a vector of its topic distribution, which means we can use any clustering method based on vector spaces. In this subsection, we conduct two experiments using this approach, one of which is for the purpose of visualization of the user interaction network, while the other is for the assessment of its effectiveness.

5.2.1. Visual Analytics with User Replying Network

The user replying network (or user interaction network) is a graph representing the intensity of user interactions, where each vertex represents a user, and an edge established between two vertices has a weight, indicating how many times two users exchange comments. It is important to visualize the user replying network, so that we can use visual analytics to determine the characteristics of user interactions and the induced community structure.
To visualize this network effectively, we use two graphs: (i) the placement graph, and (ii) the interaction graph.
First, we organize the placement graph, in which edge weights are determined by the similarity of the corresponding user vectors of the two end vertices. We set the vertices, each of which indicates a user, and is associated with its topical distribution. We compute the cosine measure for each pair of users as the similarity. For each user, we establish edges to its 10 nearest users with the computed cosine similarities as the weights. Then we perform the force-based layout method on this graph, in order to place the vertices.
With this vertex placement, we construct the interaction graph for the final visualization. We label the vertices with their dominant topic, to make the relationship between topics visually clear. Then we remove all the edges computed by the topical similarity among users. We reestablish edges using the user replying network, which completes the user interaction graph. The weight of an edge between users is set to the number of articles in which the two users wrote comments to each other. We visualized the constructed graph using Gephi [38].
Figure 4 and Figure 5 show the visualized user replying networks obtained using the user–topic model. Vertices are placed according to the dominant topic of the corresponding users. The dominant topics of different users are indicated using different colors. As described, the thickness of an edge indicates weight, which measures how many times the two users interacted. We also assigned different sizes to vertices to represent their degrees (the numbers of neighbors in terms of user interaction).
We see individual characteristics in these visualizations. Comparing the two Reddit datasets depicted in Figure 4, we observe that users with different topics in r/politics are separated more clearly than those in r/AskReddit. There are more thick edges observed in r/politics, which indicates two users meet and debate in many articles, while two users in r/AskReddit rarely meet each other again. This low probability is due to the excessively large numbers of users and articles.
Long-tailed user groups are observed in both Reddit datasets, on the right sides of the figures. If there are a number of users with the same topic whose nearest neighbors are similar to them, edges are unlikely to be connected outside this topic group. This leads to a protrusion (“long tail”) during the force-based vertex placement, and indicates that some users in this topic have generally participated only in some particular articles. In r/politics, they may be avid supporters or critics of a certain political group, although we should investigate more closely to discover the cause of this phenomenon. In r/AskReddit, articles include questions targeting specific groups of people such as transgender people, girls wearing long claw-like nails, and people with face tattoos. These articles also include questions asking users for their personal tips, experiences or preferences, that others do not have. Perhaps these target-specific questions cause the users who participate in these articles to group together tightly.
We also observe that users with related thematic topics are placed close together. Recall that we place the user vertices according to the similarity of their topical distribution vectors. Thus, users close to each other on the graph are likely to share behavioral characteristics. For example in r/politics, users interested in the special counsel investigation are at the top of the graph. Users who like to discuss people close to the president are located close to them (below and right), and users who frequently reacted to the White House Press Briefing are located below and left. As another example, users who are interested in Bernie Sanders are located at the bottom-left corner of the graph. Close to this group, we find several groups of users who have actively participated in articles with content on racism, gun control, and social inequality, issues closely related to this politician.
In r/AskReddit, there are also groups of users who are active at specific times. At the top left and center of the graph in Figure 4b, we find two user groups who usually participated in articles posted around 3–4 p.m. and 5–7 p.m. EDT time, respectively. We also find separate groups of users who leave comments in the articles with their own topics, although the group clusters are not as clear as those in r/politics. Users with related topics tend to be located nearby. For example, users interested in political questions are located close to those who answer country-specific questions such as “What is better in Europe than America?” There are also questions about serious social problems, such as asking opinions on suicide rates in America. Users who discuss such topics are also located close to the country-specific topics. We believe this is because these questions naturally involve comparisons among different countries.
Compared to the Reddit datasets, we observe different distributions in vertex degrees in the two datasets in Figure 5, indicated by the vertex sizes. We observe that there are a small number of users who are excessively active, and interact with a large number of other users, especially for controversial topics. We also observe that these users are clustered according to their interests. For example, in Slashdot, users interested in energy issues such as nuclear power are close to users who are concerned about climate change, as we find them close together at the bottom-right corner of the graph. In PGR21, users interested in political issues are located close to one another, and a number of small groups have been formed. Among these small groups, users sensitive to gender issues are in the middle of the other groups, which means they are likely to simultaneously participate in the articles with political topics around them. Users with these political topics tend to have large degrees, meaning they interact with a large number of users across many articles.

5.2.2. Clustering Coefficient

In order to demonstrate that user–topic modeling can be used in clustering users on user replying networks, we evaluate the proposed method, which assigns users to clusters according to their dominant topics, and compare it with other baseline methods. We used two baseline methods: (i) spectral clustering and (ii) random assignment. Spectral clustering is a popular clustering method for graph data. Using the adjacency matrix of the input graph, it decomposes the vertices into several groups to separate them as much as possible. Random assignment is used for comparison, to show how well both the proposed method and spectral clustering performed the clustering task. As evaluation measure we used the modularity on the user interaction graph, where edges having a weight less than θ were removed. The modularity of cluster C = { C i V ( G ) } on graph G is a measure of the probability of two vertices within the same cluster having an edge between them, compared to random chance, and is defined as follows:
modularity ( G , C ) = 1 | E ( G ) | j = 1 k ( Ψ C ( j ) Δ C ( j ) 2 )
where Ψ C ( j ) is the number of vertex pairs ( v , w ) C j × C j such that ( v , w ) E ( G ) , and Δ C ( j ) is the sum of the degrees of vertices v C j .
Table 6 shows the modularity obtained using the above three methods. For a small number of topics the user–topic method tends to outperform the spectral clustering method. If we choose a higher “threshold” θ , which makes the interaction graph more sparse, and each edge likely to represent more intense interaction, the difference in clustering quality becomes clearer, especially for a small number of topics.
Performing better for a small number of topics is an advantage in many qualitative assessments from which human analysts use the results. Clearly, interpreting results for more than 100 topics would be difficult compared to dealing with just 10 topics. We point out that the spectral clustering method is specialized for improving clustering measures, while our method is not dedicated to this particular task. Nevertheless, the user–topic method performs better than spectral clustering under certain conditions.
In addition, spectral clustering is not robust in some cases, while our method performs consistently. Spectral clustering sometimes fails, especially when the user interaction graph has very small clusters that are weakly connected to the remainder of the graph, resulting in a giant component and isolated small vertex groups after clustering.

5.3. User Behavior Analysis

As a result that users with similar behavior are likely to have the same topic in user–topic modeling, we can use this to analyze community characteristics from the behavioral perspective.

5.3.1. Temporal Behavior of Community Users

Users are active in different time slots; for example, some users connect to the community at night during weekdays, while others are online during working hours. This difference in active hours may affect user interactions. When a large number of articles are uploaded within a given time interval, it is difficult for users with different active hours to be involved in the same article, unless it is marked as a hot. article on the front page. On the other hand, if articles are exposed on the front page for several days due to a low article-upload rate, users are more likely to have a chance to participate in the same article, regardless of their active hours.
Figure 6 shows the active times of users in terms of hour and day of the week for two online communities (R1 and PG datasets). We performed topic modeling with K = 16 for both datasets, but different scales are used in the figures. In r/politics, we find some groups of users have common active times. For example, users with Topics 2 and 10 are highly active at 18:00–22:00 GMT. Users with Topic 2 are inactive on the weekend, while those with Topic 10 are just less active then. Topic 11 is active during 00:00–05:00 on weekdays. We deduce that these users may live in a different time zone, because their active hours are shifted 3–4 h later than other topic users.
However, these differences in users’ active hours are not observed in the PGR21 dataset. In this community, there is not a sufficient number of articles to push recent articles onto the next page of the article list. Newly uploaded articles can be exposed on the front page for several days, sufficient time for all users to participate, according to their interests. Consequently, the active hours are less important in separating user interactions than in the case of Reddit.

5.3.2. Herd Behavior and Event Detection

We can also detect herd behavior of users affected by high-impact social events. Figure 7a shows the topic flow of the PGR21 dataset with K = 8 . We see peaks in Topic 2 during the second half of the timeline. At that time, a series of events occurred in South Korea concerning the impeachment of the president, and the election of a new president. Moreover, around this time, community rules forced articles on sport and entertainment to be uploaded to a separate bulletin board, which gave the remaining users fewer choices of topics. As a result, almost all users in the community show a shared interest in this topic, resulting in the single-topic peaks at that time. Figure 7b shows another visualization of this topic flow using the dominant topic of articles, instead of topic distribution in individual assignments. For example, if an article has a topic distribution 0 . 1 , 0 . 1 , 0 . 2 , 0 . 6 with K = 4 , we simply count 1 for Topic 4 instead of summing the distribution vector itself. In this visualization, we can analyze the topic flow more focused on articles, while the original visualization places more emphasis on the user perspective. The peaks are observed much more significantly, which means the articles with this topic dominated the community. The time interval between two peaks of Topic 2 is the period between the impeachment judgment and the presidential election.

5.4. Comparison with Topic Models on User Network

In this subsection, we compare the proposed method with a topic modeling method based on user networks, which is the basic approach that was followed to apply the LDA technique to user analysis in many related studies [24,28,29,30]. Applying the topic modeling technique to user networks is probably effective for a certain type of data where a large user network, such as the Twitter network, is explicitly established, or in certain cases in which a small number of users are involved for an individual engagement; e.g., only a few authors contribute to a single research paper. However, in online community data, the number of users involved in an individual article is quite large; thus, we would not gain any advantage by constructing the user network over them. Furthermore, aggregating the user co-occurrences over articles would make each of the meaningful engagements indistinguishable. For example, we can suppose such a case in which user A and B have commonly participated in a politics-related article, B and C in a sports-related article, A and C in an art-related article. When we construct the user network here, these three users would form a triangle, which would render these users symmetric and indistinguishable. However, note that our proposed method would be able to distinguish the interests of each user in this case.
Figure 8 depicts the histogram of topic distributions of users by comparing the proposed method with the network-based method in which the user network is constructed using co-occurrences. For the purpose of illustration, we ran the topic modeling with two topics, thus each user has a probability distribution ( p , 1 p ) ; the histograms show the distribution of p over the users. In the proposed method, users are divided into two groups: those with p 0 and other with p 1 , and the other users are almost evenly distributed. This means that users can successfully be clustered using the topic probability. In contrast, network-based topic modeling produced distributions centered at p = 0 . 5 . This prevents two topics from being distinguished clearly.
For the purpose of quantitative evaluation, we measured the standard deviation of topic distributions as listed in Table 7. Considering a M × K matrix, where M is the number of users and K is the number of topics, let each row indicate the topic distribution of a user. We computed the standard deviation in both directions: row-wise (user-wise), and column-wise (topic-wise), after which we averaged the values. If the user-wise standard deviation is high, it means a small number of topics form a large portion while the other topics form a small portion; e.g., consider a user with the topic distribution (1,0,0,0). In other words, if this value is low, each topic forms a similar portion, thus they are insignificantly distinguishable; e.g., a user with the topic distribution (0.25,0.25,0.25,0.25) where the standard deviation is zero. On the other hand, the topic-wise standard deviation indicates user variation across a specific topic; e.g., if all users have 0.1 for Topic τ 1 , then the standard deviation would be 0 and it means τ 1 is not meaningful for distinguishing users. The proposed method consistently outperforms network-based modeling as the proposed method has higher standard deviations.
The second drawback of applying network-based topic modeling to online community data is that a direct way to obtain article-level results does not exist, despite the use of the proposed article–user topic modeling, where one of the learnt parameters, i.e., the article–topic matrix, explicitly represents the topic distribution of an article. One may think of computing the topic distribution of an article for the network-based topic modeling method in such a way that aggregates the topic distribution of users involved in the target article. However, this method is not effective as shown in Figure 9. Despite the topic distributions derived from the proposed method, in which topics are distributes widely, the network-based modeling results in very narrow distributions around p = 0 . 5 , which means every article has a similar topic distribution.

6. Conclusions

Analyzing user behavior in online communities is an important task. We have presented the user–topic model, which utilizes user participation instead of word occurrence, to analyze online communities in terms of topics. The contributions of our work are summarized as follows:
  • Textual coherence was observed in the measured topics, although the method is language-independent, as we did not use any textual data in the data processing. This showed that users’ behavior and interests are reflected in their interactions, especially in common engagement with related articles.
  • The user–topic model can reflect dynamic features that change over time better than the topic model, which uses only textual data.
  • Topic flow graphs and temporality measures were shown to be effective in distinguishing thematic and temporal factors in individual topics.
  • The user–topic model can be used to cluster users, with their behavioral features, from various perspectives such as topical interests and active hours.
  • The two-stage graph construction and visualization method presented here aids visual analysis of the user interaction network.
  • Event detection can also be effectively performed with the user–topic model, by analyzing dynamic topic flow.
The work presented here is a macroscopic analysis method from the perspective of users and articles, which concerns how topics are distributed, how they change over time, and what significant tendencies we can observe. Future studies should consider a microscopic perspective of the user–topic model, performing behavioral analysis within an individual article. We also plan to extend the proposed method in various directions. One extension would be concerned with the weighting problem in constructing pseudo-documents. In this work, we use the sequence of comment writers, which are viewed as a set of users associated with weights, and the weight of a user is to be the number of comments written by the user in an article. We may apply different functions such as log x and x 2 to this value and discover the different results that can be obtained with different weighting functions. In addition, many community-specific features exist other than user participation, such as rating, friend relationship, and replying structures. Furthermore, to extend the user–topic modeling method, we need a way to combine these additional features. As a result that one of the aspects we emphasized in this work was simplicity, we also plan to develop a simple method to combine multiple features rather than designing complicated probabilistic models specific to a particular domain.

Author Contributions

The authors contributed equally to this work. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by Basic Science Research Program through the National Research Foundation of Korea(NRF) funded by the Ministry of Education (NRF-2017R1D1A1A02018504).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Wang, Y.; Yu, Q.; Fesenmaier, D.R. Defining the Virtual Tourist Community: Implications for Tourism Marketing. Tour. Manag. 2002, 23, 407–417. [Google Scholar] [CrossRef]
  2. Dehghani, M.; Tumer, M. A Research on Effectiveness of Facebook Advertising on Enhancing Purchase Intension of Consumers. Comput. Hum. Behav. 2015, 49, 597–600. [Google Scholar] [CrossRef]
  3. Shatz, I. Fast, Free, and Targeted: Reddit as a Source for Recruiting Participants Online. Soc. Sci. Comput. Rev. 2017, 35, 537–549. [Google Scholar] [CrossRef]
  4. Blevins, T.; Kwiatkowski, R.; Macbeth, J.; McKeown, K.; Patton, D.; Rambow, O. Automatically Processing Tweets from Gang-Involved Youth: Towards Detecting Loss and Aggression. In Proceedings of the 26th International Conference on Computational Linguistics (COLING), Osaka, Japan, 11–16 December 2016; pp. 2196–2206. [Google Scholar]
  5. Lazer, D.M.J.; Baum, M.A.; Benkler, Y.; Berinsky, A.J.; Greenhill, K.M.; Menczer, F.; Metzger, M.J.; Nyhan, B.; Pennycook, G.; Rothschild, D.; et al. The science of fake news. Science 2018, 359, 1094–1096. [Google Scholar] [CrossRef] [PubMed]
  6. Kumar, S.; Hamilton, W.L.; Leskovec, J.; Jurafsky, D. Community Interaction and Conflict on the Web. In Proceedings of the 2018 World Wide Web Conference (WWW), Lyon, France, 23–27 April 2018; pp. 933–943. [Google Scholar]
  7. Pfeil, U.; Zaphiris, P. Patterns of Empathy in Online Communication. In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (CHI), San Jose, CA, USA, 28 April–3 May 2007; pp. 919–928. [Google Scholar]
  8. Jin, J.; Li, Y.; Zhong, X.; Zhai, L. Why Users Contribute Knowledge to Online Communities: An Empirical Study of an Online Social Q&A Community. Inf. Manag. 2015, 52, 840–849. [Google Scholar]
  9. Cheng, J.; Danescu-Niculescu-Mizil, C.; Leskovec, J. Antisocial Behavior in Online Discussion Communities. In Proceedings of the 9th International AAAI Conference on Weblogs and Social Media (ICWSM), Oxford, UK, 26–29 May 2015; pp. 61–70. [Google Scholar]
  10. Cheng, J.; Bernstein, M.; Danescu-Niculescu-Mizil, C.; Leskovec, J. Anyone Can Become a Troll: Causes of Trolling Behavior in Online Discussions. In Proceedings of the 2017 ACM Conference on Computer Supported Cooperative Work and Social Computing (CSCW), Portland, OR, USA, 25 February–1 March 2017; pp. 1217–1230. [Google Scholar]
  11. Chiang, C.-H.; Wang, J.-C. The Impact of Interaction Networks on Lurkers’ Behavior in Online Community. In Proceedings of the 48th Hawaii International Conference on System Sciences (HICSS), Kauai, HI, USA, 5–8 January 2015; pp. 1645–1657. [Google Scholar]
  12. Danescu-Niculescu-Mizil, C.; West, R.; Jurafsky, D.; Leskovec, J.; Potts, C. No Country for Old Members: User Lifecycle and Linguistic Change in Online Communities. In Proceedings of the 22nd International Conference on World Wide Web (WWW), Rio de Janeiro, Brazil, 13–17 May 2013; pp. 307–318. [Google Scholar]
  13. Cole, J.; Ghafurian, M.; Reitter, D. Word Adoption in Online Communities. IEEE Trans. Comput. Soc. Syst. 2019, 6, 178–188. [Google Scholar] [CrossRef]
  14. Kooti, F.; Yang, H.; Cha, M.; Gummadi, K.P.; Mason, W.A. The Emergence of Conventions in Online Social Networks. In Proceedings of the 6th International AAAI Conference on Weblogs and Social Media (ICWSM), Dublin, Ireland, 4–7 June 2012; pp. 194–201. [Google Scholar]
  15. Li, D.; He, B.; Tang, J.; Sugimoto, C.; Qin, Z.; Yan, E.; Li, J.; Dong, T. Community-Based Topic Modeling for Social Tagging. In Proceedings of the 19th ACM International Conference on Information and Knowledge (CIKM), Toronto, ON, Canada, 26–30 October 2010; pp. 1565–1568. [Google Scholar]
  16. Parimi, R.; Caragea, D. Predicting Friendship Links in Social Networks Using Topic Modeling Approach. In Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), Shenzhen, China, 24–27 May 2011; pp. 75–86. [Google Scholar]
  17. Pu, X.; Wu, G.; Yuan, C. User-Aware Topic Modeling of Online Reviews. Multimed. Syst. 2019, 25, 59–69. [Google Scholar] [CrossRef]
  18. Kim, S.H.; Tak, H.; Cho, H.G. Polarized Topic Modeling for User Characteristics in Online Discussion Community. In Proceedings of the 2019 IEEE International Conference on Big Data and Smart Computing (BigComp), Kyoto, Japan, 27 February–2 March 2019; pp. 1–4. [Google Scholar]
  19. Blei, D.M.; Ng, A.Y.; Jordan, M.I. Latent Dirichlet Allocation. J. Mach. Learn Res. 2003, 3, 993–1022. [Google Scholar]
  20. Sun, L.; Yin, Y. Discovering Themes and Trends in Transportation Research Using Topic Modeling. Transp. Res. Part C 2017, 77, 49–66. [Google Scholar] [CrossRef] [Green Version]
  21. Asuncion, H.U.; Asuncion, A.U.; Taylor, R.N. Software Traceability with Topic Modeling. In Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering (ICSE), Cape Town, South Africa, 1–8 May 2010; pp. 95–104. [Google Scholar]
  22. Chuan, P.M.; Son, L.H.; Ali, M.; Khang, T.D.; Huong, L.T.; Dey, N. Link prediction in co-authorship networks based on hybrid content similarity metric. Appl. Intell. 2018, 48, 2470–2486. [Google Scholar] [CrossRef]
  23. Linstead, E.; Rigor, P.; Bajracharya, S.; Lopes, C.; Baldi, P. Mining Concepts from Code with Probabilistic Topic Models. In Proceedings of the Twenty-Second IEEE/ACM International Conference on Automated Software Engineering (ASE), Atlanta, GA, USA, 5–9 November 2007; pp. 461–464. [Google Scholar]
  24. Zuo, Y.; Zhao, J.; Xu, K. Word Network Topic Model: A Simple but General Solution for Short and Imbalanced Texts. Knowl. Inf. Syst. 2016, 48, 379–398. [Google Scholar] [CrossRef] [Green Version]
  25. Bisgin, H.; Liu, Z.; Kelly, R.; Xu, X.; Tong, W. A phenome-guided drug repositioning through a latent variable model. BMC Bioinform. 2014, 15, 267. [Google Scholar] [CrossRef] [Green Version]
  26. Giri, R.; Choi, H.; Hoo, K.S.; Rao, B.D. User Behavior Modeling in a Cellular Network Using Latent Dirichlet Allocation. In Proceedings of the International Conference on Intelligent Data Engineering and Automated Learning (IDEAL), Salamanca, Spain, 10–12 September 2014; pp. 36–44. [Google Scholar]
  27. Zhao, G.; Lee, M.L.; Wynne, H. Utilizing Purchase Intervals in Latent Clusters for Product Recommendation. In Proceedings of the 8th Workshop on Social Network Mining and Analysis, New York, NY, USA, 24 August 2014; pp. 1–9. [Google Scholar]
  28. Zhao, G.; Lee, M.L.; Hsu, W.; Chen, W.; Hu, H. Community-Based User Recommendation in Uni-Directional Social Networks. In Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, San Francisco, CA, USA, 27 October–1 November 2013; pp. 189–198. [Google Scholar]
  29. Cha, Y.; Cho, J. Social-network analysis using topic models. In Proceedings of the 35th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR), Portland, OR, USA, 12–16 August 2012; pp. 565–574. [Google Scholar]
  30. Zhang, H.; Qiu, B.; Giles, C.L.; Foley, H.C.; Yen, J. An LDA-based community structure discovery approach for large-scale social networks. In Proceedings of the 2007 IEEE Intelligence and Security Informatics, New Brunswick, NJ, USA, 23–24 May 2007; pp. 200–207. [Google Scholar]
  31. Nguyen, T.H.; Shirai, K. Topic Modeling Based Sentiment Analysis on Social Media for Stock Market Prediction. In Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics, Beijing, China, 16–21 August 2015; pp. 1354–1364. [Google Scholar]
  32. Cheng, Z.; Ding, Y.; Zhu, L.; Kankanhalli, M. Aspect-Aware Latent Factor Model: Rating Prediction with Ratings and Reviews. In Proceedings of the 2018 World Wide Web Conference (WWW), Lyon, France, 23–27 April 2018; pp. 639–648. [Google Scholar]
  33. Blei, D.M.; Lafferty, J.D. Dynamic Topic Models. In Proceedings of the 23rd International Conference on Machine Learning (ICML), Pittsburgh, PA, USA, 25–29 June 2006; pp. 113–120. [Google Scholar]
  34. Gropp, C.; Herzog, A.; Safro, I.; Wilson, P.W.; Apon, A.M. Clustered Latent Dirichlet Allocation for Scientific Discovery. In Proceedings of the 2019 IEEE International Conference on Big Data (BigData), Los Angeles, CA, USA, 9–12 December 2019; pp. 4503–4511. [Google Scholar]
  35. Yang, M.; Qu, Q.; Chen, X.; Tu, W.; Shen, Y.; Zhu, J. Discovering Author Interest Evolution in Order-Sensitive and Semantic-Aware Topic Modeling. Inf. Sci. 2019, 486, 271–286. [Google Scholar] [CrossRef]
  36. Gerlach, M.; Peixoto, T.P.; Altmann, E.G. A Network Approach to Topic Models. Sci. Adv. 2007, 4, eaaq1360. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  37. Phan, X.H.; Nguyen, C.T. GibbsLDA++: A C/C++ Implementation of Latent Dirichlet Allocation (LDA). 2007. Available online: http://gibbslda.sourceforge.net (accessed on 14 May 2020).
  38. Bastian, M.; Heymann, S.; Jacomy, M. Gephi: An Open Source Software for Exploring and Manipulating Networks. In Proceedings of the 3rd International AAAI Conference on Weblogs and Social Media (ICWSM), San Jose, CA, USA, 17–20 May 2009. [Google Scholar]
Figure 1. Lifetime filter can moderate temporal biases caused by temporary users.
Figure 1. Lifetime filter can moderate temporal biases caused by temporary users.
Applsci 10 03388 g001
Figure 2. Temporal topic flow of Slashdot dataset with K = 4 .
Figure 2. Temporal topic flow of Slashdot dataset with K = 4 .
Applsci 10 03388 g002
Figure 3. Comparison of user–topic and text-topic modeling methods in the Slashdot dataset.
Figure 3. Comparison of user–topic and text-topic modeling methods in the Slashdot dataset.
Applsci 10 03388 g003
Figure 4. Visualizing the user replying network for Reddit datasets.
Figure 4. Visualizing the user replying network for Reddit datasets.
Applsci 10 03388 g004
Figure 5. Visualizing the user replying network for Slashdot and PGR21 datasets.
Figure 5. Visualizing the user replying network for Slashdot and PGR21 datasets.
Applsci 10 03388 g005
Figure 6. Active hours and days of the week for two different datasets.
Figure 6. Active hours and days of the week for two different datasets.
Applsci 10 03388 g006
Figure 7. Temporal topic flow of PGR21 dataset with K = 8 where Topic 2 has significant peaks at certain times.
Figure 7. Temporal topic flow of PGR21 dataset with K = 8 where Topic 2 has significant peaks at certain times.
Applsci 10 03388 g007
Figure 8. Topic distributions of users. Users are more clearly distinguished into two groups in the proposed method.
Figure 8. Topic distributions of users. Users are more clearly distinguished into two groups in the proposed method.
Applsci 10 03388 g008
Figure 9. Topic distributions of articles. The distribution of the proposed method is much wider.
Figure 9. Topic distributions of articles. The distribution of the proposed method is much wider.
Applsci 10 03388 g009
Table 1. Related work using analogies from latent Dirichlet allocation (LDA).
Table 1. Related work using analogies from latent Dirichlet allocation (LDA).
DomainAnalogyMain Goal
DocumentWord
[23]Java Program CodeSource fileTokenExtracting source code concepts
[24]Word NetworkWordAdjacent WordTopic modeling with short texts
[25]Phenome InformationDrugPhenotypeSearching similar drugs
[26]Web Browsing HistoryUserVisited URLAnalyzing mobile user preferences
[27]Purchase ListUserItemItem recommendation
[28]Twitter NetworkUserFollower/FolloweeUser (friend) recommendation
[29]Twitter NetworkUserFollower/FolloweeUser grouping and labeling
[30]Researcher NetworkAuthorCo-authorCommunity detection
Table 2. Analogies used in user–topic modeling.
Table 2. Analogies used in user–topic modeling.
Classical Topic ModelingUser–Topic Modeling
CorpusCommunity
DocumentArticle
WordComment Writer (User)
TopicBehavioral Characteristic of Users
Table 3. Datasets used in this paper.
Table 3. Datasets used in this paper.
idCommunityArticlesCommentsUsersPeriod
R1Reddit r/politics56 K4.1 M209 KMar 2018–Jun 2018(≈83 days)
R2Reddit r/AskReddit483 K13.6 M1.2 MMar 2018–Jun 2018(≈91 days)
SDSlashdot22 K3.5 M33.7 KJan 2015–Dec 2017(3 years)
PGPGR2117 K975 K9.1 KJan 2015–Dec 2017(3 years)
Table 4. Qualitative assessment of topics in Figure 2.
Table 4. Qualitative assessment of topics in Figure 2.
TopicTemporalityClassSubjects
13.44TemporalMixed
21.76ThematicClimate Change
32.44Thematic + TemporalTechnology, Business
41.11ThematicOS Development
Table 5. Top-5 articles per topic in Slashdot data ( K = 4 ).
Table 5. Top-5 articles per topic in Slashdot data ( K = 4 ).
TopicRankProbTitle
110.96Sending Angry Emails Just Makes You Angrier
20.95Connected Gun Lets Anyone Watch What Or Who You Are Shooting
30.95Judge: Warrantless Airport Seizure of Laptop ‘Cannot Be Justified’
40.94Secret Service Plans New Fence, Full Scale White House Replica, But No Moat
50.94New Molecular 3D Printer Can Create Billions of Compounds
210.97Top Democrats Request FBI Investigation of Trump Campaign Ties To Russia
20.96Scientists: What We’re Doing To The Earth Has No Parallel In 66 Million Years
30.96Climate Deal: US and China Join Paris Climate Accords
40.95Climate Change Is Altering Global Air Currents
50.95Ice Loss In West Antarctica Is Speeding Up
310.97Michigan Lets Autonomous Cars On Roads Without Human Driver
20.96Virtual Zuck Fails To Connect
30.96DNA Testing For Jobs May Be On Its Way, Warns Gartner
40.95India’s Infosys To Hire 10,000 American Workers After Trump Criticism
50.94Let Consumers Sue Companies
410.98Devuan’s Systemd-Free Linux Hits Beta 2
20.97Windows Switch To Git Almost Complete: 8500 Commits and 1760 Builds Each Day
30.97Mozilla Will Deprecate XUL Add-ons Before the End of 2017
40.97Debian 8 Jessie Released
50.96Ubuntu 15.04 Released, First Version To Feature systemd
Table 6. Clustering performance in terms of modularity.
Table 6. Clustering performance in terms of modularity.
DatasetTopics θ = 0 θ = 1
ProposedSpectralRandomProposedSpectralRandom
R120.0660.0340.0010.1060.0000.000
40.0740.092−0.0010.1140.000−0.002
80.0600.0930.0000.0940.0000.001
160.0440.092−0.0010.0700.0010.001
320.0290.087−0.0010.0490.002−0.001
640.0180.0740.0000.0320.180-0.001
R220.0350.0000.0000.0620.0000.001
40.0550.0000.0000.0810.0000.000
80.0460.0000.0010.0680.000−0.002
160.0330.0340.0000.0510.0010.000
320.0230.0980.0000.0360.0020.000
640.0160.0670.0000.0260.006−0.001
SD20.0380.0480.0000.0520.0000.000
40.0390.052−0.0010.0530.000−0.001
80.0320.043−0.0010.0440.000−0.001
160.0210.034−0.0010.0300.0010.000
320.0140.024−0.0010.0190.068−0.001
640.0070.000−0.0010.0110.050−0.002
PG20.0790.000−0.0010.1020.0000.002
40.0900.0000.0010.1160.0000.002
80.0720.0000.0000.0930.0010.001
160.0500.000−0.0010.0720.002−0.001
320.0330.038−0.0020.0500.004−0.002
640.0220.014−0.0010.0360.019−0.003
Table 7. Standard deviation of topic probability distribution of users.
Table 7. Standard deviation of topic probability distribution of users.
Dataset#TopicsUser-WiseTopic-Wise
ProposedNetwork-BasedProposedNetwork-Based
R120.3210.0550.3480.066
40.2740.0780.2800.072
80.2030.0710.2030.052
R220.3230.0450.3440.056
40.2760.0550.2830.053
80.1950.0400.1950.037
SD20.2680.1070.3100.090
40.2560.0920.2670.092
80.1940.0680.2000.053
PG20.3500.1490.3660.160
40.3040.1790.3080.148
80.2270.0970.2250.089

Share and Cite

MDPI and ACS Style

Kim, S.-H.; Cho, H.-G. User–Topic Modeling for Online Community Analysis. Appl. Sci. 2020, 10, 3388. https://doi.org/10.3390/app10103388

AMA Style

Kim S-H, Cho H-G. User–Topic Modeling for Online Community Analysis. Applied Sciences. 2020; 10(10):3388. https://doi.org/10.3390/app10103388

Chicago/Turabian Style

Kim, Sung-Hwan, and Hwan-Gue Cho. 2020. "User–Topic Modeling for Online Community Analysis" Applied Sciences 10, no. 10: 3388. https://doi.org/10.3390/app10103388

APA Style

Kim, S.-H., & Cho, H.-G. (2020). User–Topic Modeling for Online Community Analysis. Applied Sciences, 10(10), 3388. https://doi.org/10.3390/app10103388

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop