共查询到20条相似文献，搜索用时 93 毫秒
1.
《Information processing & management》2020,57(2):102056
Identifying and extracting user communities is an important step towards understanding social network dynamics from a macro perspective. For this reason, the work in this paper explores various aspects related to the identification of user communities. To date, user community detection methods employ either explicit links between users (link analysis), or users’ topics of interest in posted content (content analysis), or in tandem. Little work has considered temporal evolution when identifying user communities in a way to group together those users who share not only similar topical interests but also similar temporal behavior towards their topics of interest. In this paper, we identify user communities through multimodal feature learning (embeddings). Our core contributions can be enumerated as (a) we propose a new method for learning neural embeddings for users based on their temporal content similarity; (b) we learn user embeddings based on their social network connections (links) through neural graph embeddings; (c) we systematically interpolate temporal content-based embeddings and social link-based embeddings to capture both social network connections and temporal content evolution for representing users, and (d) we systematically evaluate the quality of each embedding type in isolation and also when interpolated together and demonstrate their performance on a Twitter dataset under two different application scenarios, namely news recommendation and user prediction. We find that (1) content-based methods produce higher quality communities compared to link-based methods; (2) methods that consider temporal evolution of content, our proposed method in particular, show better performance compared to their non-temporal counter-parts; (3) communities that are produced when time is explicitly incorporated in user vector representations have higher quality than the ones produced when time is incorporated into a generative process, and finally (4) while link-based methods are weaker than content-based methods, their interpolation with content-based methods leads to improved quality of the identified communities. 相似文献
2.
《Information processing & management》2022,59(2):102797
In event-based social networks (EBSN), group event recommendation has become an important task for groups to quickly find events that they are interested in. Existing methods on group event recommendation either consider just one type of information, explicit or implicit, or separately model the explicit and implicit information. However, these methods often generate a problem of data sparsity or of model vector redundancy. In this paper, we present a Graph Multi-head Attention Network (GMAN) model for group event recommendation that integrates the explicit and implicit information in EBSN. Specifically, we first construct a user-explicit graph based on the user's explicit information, such as gender, age, occupation and the interactions between users and events. Then we build a user-implicit graph based on the user's implicit information, such as friend relationships. The incorporated both explicit and implicit information can effectively describe the user's interests and alleviate the data sparsity problem. Considering that there may be a correlation between the user's explicit and implicit information in EBSN, we take the user's explicit vector representation as the input of the implicit information aggregation when modeling with graph neural networks. This unified user modeling can solve the aforementioned problem of user model vector redundancy and is also suitable for event modeling. Furthermore, we utilize a multi-head attention network to learn richer implicit information vectors of users and events from multiple perspectives. Finally, in order to get a higher level of group vector representation, we use a vanilla attention mechanism to fuse different user vectors in the group. Through experimenting on two real-world Meetup datasets, we demonstrate that GMAN model consistently outperforms state-of-the-art methods on group event recommendation. 相似文献
3.
【 目的/意义】研究从用户群体的角度出发,依据用户特征对社区用户进行群体划分,以了解不同用户群体的
主题差异,从而更加全面清晰的了解社区主题,更好的为社区用户推荐资源。【方法/过程】研究利用社会网络分析
和Topsis算法对用户群体进行划分,再利用LDA模型分别对不同用户进行主题挖掘,最后采用谱聚类实现主题优
化。【结果/结论】科学网情报学社区的核心用户与一般用户群体主题有相同的部分,也存在差异,核心用户群体的
主题专指性较强,一般用户群体的主题较为广泛。基于虚拟学术社区用户群体主题挖掘模型,可以更加全面展示
社区用户关注的主题,更好地为社区用户推荐资源。【创新/局限】研究从用户群体的视角出发,提出了虚拟学术社
区用户群体主题挖掘模型,更好的为社区用户推荐资源,但本研究在数据量、主题模型以及社会网络分析指标的选
取等方面还需要拓展与延伸。 相似文献
4.
《Information processing & management》2020,57(2):102142
With the information explosion of news articles, personalized news recommendation has become important for users to quickly find news that they are interested in. Existing methods on news recommendation mainly include collaborative filtering methods which rely on direct user-item interactions and content based methods which characterize the content of user reading history. Although these methods have achieved good performances, they still suffer from data sparse problem, since most of them fail to extensively exploit high-order structure information (similar users tend to read similar news articles) in news recommendation systems. In this paper, we propose to build a heterogeneous graph to explicitly model the interactions among users, news and latent topics. The incorporated topic information would help indicate a user’s interest and alleviate the sparsity of user-item interactions. Then we take advantage of graph neural networks to learn user and news representations that encode high-order structure information by propagating embeddings over the graph. The learned user embeddings with complete historic user clicks capture the users’ long-term interests. We also consider a user’s short-term interest using the recent reading history with an attention based LSTM model. Experimental results on real-world datasets show that our proposed model significantly outperforms state-of-the-art methods on news recommendation. 相似文献
5.
《Information processing & management》2020,57(2):102031
Social media platforms allow users to express their opinions towards various topics online. Oftentimes, users’ opinions are not static, but might be changed over time due to the influences from their neighbors in social networks or updated based on arguments encountered that undermine their beliefs. In this paper, we propose to use a Recurrent Neural Network (RNN) to model each user’s posting behaviors on Twitter and incorporate their neighbors’ topic-associated context as attention signals using an attention mechanism for user-level stance prediction. Moreover, our proposed model operates in an online setting in that its parameters are continuously updated with the Twitter stream data and can be used to predict user’s topic-dependent stance. Detailed evaluation on two Twitter datasets, related to Brexit and US General Election, justifies the superior performance of our neural opinion dynamics model over both static and dynamic alternatives for user-level stance prediction. 相似文献
6.
【目的/意义】构建高校师德舆情微博用户评论LDA模型,可以更精准识别舆情演化特征和分析关键主题传
播路径,帮助高校和相关部门更为有效地进行舆情监管和舆情引导。【方法/过程】本文以“天津大学一教授学术造
假”事件为例,基于 LDA模型构建高校师德舆情下微博用户主题生成模型,采用困惑度评价指标确定 LDA模型最
优主题数,采用信息熵确定每一主题在不同日期的主题强度,通过关键词共现知识图谱、词云展现舆情话题的演
变,最后基于主题相似度确定主题传播路径。【结果/结论】LDA模型和信息熵可以解析出网络用户群体关注的重要
主题热点,精准识别舆情演化特征,识别主题最优传播路径进行舆论引导,对爆发的舆情实现预测和管制优化。【创
新/局限】文章创新性地构建高校学术道德舆情的LDA主题模型,有效确定微博用户群体主题、识别舆情演化特征、
分析主题间传播路径,具有普适性;进一步扩大高校师德其他舆情分析及结合网络舆情情感分析为下一步的研究
内容。 相似文献
7.
《Information processing & management》2020,57(2):102151
Learning latent representations for users and points of interests (POIs) is an important task in location-based social networks (LBSN), which could largely benefit multiple location-based services, such as POI recommendation and social link prediction. Many contextual factors, like geographical influence, user social relationship and temporal information, are available in LBSN and would be useful for this task. However, incorporating all these contextual factors for user and POI representation learning in LBSN remains challenging, due to their heterogeneous nature. Although the encouraging performance of POI recommendation and social link prediction are delivered, most of the existing representation learning methods for LBSN incorporate only one or two of these contextual factors. In this paper, we propose a novel joint representation learning framework for users and POIs in LBSN, named UP2VEC. In UP2VEC, we present a heterogeneous LBSN graph to incorporate all these aforementioned factors. Specifically, the transition probabilities between nodes inside the heterogeneous graph are derived by jointly considering these contextual factors. The latent representations of users and POIs are then learnt by matching the topological structure of the heterogeneous graph. For evaluating the effectiveness of UP2VEC, a series of experiments are conducted with two real-world datasets (Foursquare and Gowalla) in terms of POI recommendation and social link prediction. Experimental results demonstrate that the proposed UP2VEC significantly outperforms the existing state-of-the-art alternatives. Further experiment shows the superiority of UP2VEC in handling cold-start problem for POI recommendation. 相似文献
8.
《Information processing & management》2023,60(4):103402
In community-based social media, users consume content from multiple communities and provide feedback. The community-related data reflect user interests, but they are poorly used as additional information to enrich user-content interaction for content recommendation in existing studies. This paper employs an information seeking behavior perspective to describe user content consumption behavior in community-based social media, therefore revealing the relations between user, community and content. Based on that, the paper proposes a Community-aware Information Seeking based Content Recommender (abbreviated as CISCRec) to use the relations for better modeling user preferences on content and increase the reasoning on the recommendation results. CISCRec includes two key components: a two-level TransE prediction framework and interaction-aware embedding enhancement. The two-level TransE prediction framework hierarchically models users’ preferences for content by considering community entities based on the TransE method. Interaction-aware embedding enhancement is designed based on the analysis of users’ continued engagement in online communities, aiming to add expressiveness to embeddings in the prediction framework. To verify the effectiveness of the model, the real-world Reddit dataset (4,868 users, 115,491 contents, 850 communities, and 602,025 interactions) is chosen for evaluation. The results show that CISCRec outperforms 8 common baselines by 9.33%, 4.71%, 42.13%, and 14.36% on average under the Precision, Recall, MRR, and NDCG respectively. 相似文献
9.
基于主题细分的社交网络用户间交互特征分析 总被引：1，自引：0，他引：1
[目的/意义]针对一微博子网,从主题细分的角度对用户间历史交互记录进行研究,发现用户间交互的主题偏好特征,以期从微观层面了解用户信息传播行为的规律。[方法/过程]通过用户实例分析得出对用户间交互进行主题细分的必要性;利用主题模型(LDA)对用户间历史交互记录进行主题细分,采用多维向量表示用户间在不同主题下的交互强度;通过统计分析和网络分析方法探索用户间交互的主题特征。[结果/结论]各主题下用户间交互强度的分布具有长尾特征;用户间的交互内容在时序上具有主题相关性;基于多维的用户间交互强度,可抽取出特定主题下的用户交互子网。用户间交互在时序上具有主题相关性这一特征,以及特定主题的用户交互子网,可用于对特定主题的信息传播进行监控和预测。 相似文献
10.
Seyed Amin Mirlohi Falavarjani Fattane Zarrinkalam Jelena Jovanovic Ebrahim Bagheri Ali A. Ghorbani 《Information processing & management》2019,56(6):102070
The ever increasing presence of online social networks in users’ daily lives has led to the interplay between users’ online and offline activities. There have already been several works that have studied the impact of users’ online activities on their offline behavior, e.g., the impact of interaction with friends on an exercise social network on the number of daily steps. In this paper, we consider the inverse to what has already been studied and report on our extensive study that explores the potential causal effects of users’ offline activities on their online social behavior. The objective of our work is to understand whether the activities that users are involved with in their real daily life, which place them within or away from social situations, have any direct causal impact on their behavior in online social networks. Our work is motivated by the theory of normative social influence, which argues that individuals may show behaviors or express opinions that conform to those of the community for the sake of being accepted or from fear of rejection or isolation. We have collected data from two online social networks, namely Twitter and Foursquare, and systematically aligned user content on both social networks. On this basis, we have performed a natural experiment that took the form of an interrupted time series with a comparison group design to study whether users’ socially situated offline activities exhibited through their Foursquare check-ins impact their online behavior captured through the content they share on Twitter. Our main findings can be summarised as follows (1) a change in users’ offline behavior that affects the level of users’ exposure to social situations, e.g., starting to go to the gym or discontinuing frequenting bars, can have a causal impact on users’ online topical interests and sentiment; and (2) the causal relations between users’ socially situated offline activities and their online social behavior can be used to build effective predictive models of users’ online topical interests and sentiments. 相似文献
11.
同侪影响对用户贡献行为的作用研究———基于网络客观大数据的分析 《科学学研究》2021,39(12):2294-2304
本文将同侪影响引入在线创新社区的用户行为研究中,从广度和深度两方面考察同侪影响对用户贡献行为的影响,并分析感知收益的中介作用。研究以小米社区MIUI功能与讨论区的创意集市板块为对象构建S-O-R模型,采用6567名用户发布的8830条创意、5.26万条评论和收到的103.36万条评论数据,利用Mplus8.1分析检验,结果发现：同侪影响广度与深度均有利于促进用户贡献行为,综合收益在同侪影响广度、深度与用户贡献行为间起正向中介效应,情感收益仅在同侪影响广度、深度与主动贡献行为间起正向中介效应,而认知收益则在同侪影响深度与反应贡献行为间起负向中介效应。研究拓展了在线网络情境下知识管理与社会学领域的交叉研究,并为在线创新社区社交网络和知识管理提供重要启示。 相似文献
12.
针对传统知识推荐算法存在的语义缺失和精准性低问题,本文提出一种基于改进LDA-FCM的知识推荐算法。首先获取用户知识文档,采用主题优化的LDA模型挖掘用户知识主题。继而通过FCM算法将用户聚类,缩小相似度计算的遍历范围,并采用JS散度代替欧氏距离,实现FCM对象到用户的转换。最后基于UserCF算法构建用户对知识的兴趣指数并进行TOP-N推荐。爬取中国知网500篇期刊论文实测发现：与传统UserCF算法相比,改进算法的准确率、召回率和F1值分别提高了28.17%、59.62%、53.88%。 相似文献
13.
《Information processing & management》2020,57(6):102304
The way that users provide feedback on items regarding their satisfaction varies among systems: in some systems, only explicit ratings can be entered; in other systems textual reviews are accepted; and in some systems, both feedback types are accommodated. Recommender systems can readily exploit explicit ratings in the rating prediction and recommendation formulation process, however textual reviews -which in the context of many social networks are in abundance and significantly outnumber numeric ratings- need to be converted to numeric ratings. While numerous approaches exist that calculate a user's rating based on the respective textual review, all such approaches may introduce errors, in the sense that the process of rating calculation based on textual reviews involves an uncertainty level, due to the characteristics of the human language, and therefore the calculated ratings may not accurately reflect the actual ratings that the corresponding user would enter. In this work (1) we examine the features of textual reviews, which affect the reliability of the review-to-rating conversion procedure, (2) we compute a confidence level for each rating, which reflects the uncertainty level for each conversion process, (3) we exploit this metric both in the users’ similarity computation and in the prediction formulation phases in recommender systems, by presenting a novel rating prediction algorithm and (4) we validate the accuracy of the presented algorithm in terms of (i) rating prediction accuracy, using widely-used recommender systems datasets and (ii) recommendations generated for social network user satisfaction and precision, where textual reviews are abundant. 相似文献
14.
《Information processing & management》2023,60(5):103456
To achieve personalized recommendations, the recommender system selects the items that users may like by learning the collected user–item interaction data. However, the acquisition and use of data usually form a feedback loop, which leads to recommender systems suffering from popularity bias. To solve this problem, we propose a novel dual disentanglement of user–item interaction for recommendation with causal embedding (DDCE). Different from the existing work, our innovation is we take into account double-end popularity bias from the user-side and the item-side. Firstly, we perform a causal analysis of the reasons for user–item interaction and obtain the causal embedding representation of each part according to the analysis results. Secondly, on the item-side, we consider the influence of item attributes on popularity to improve the reliability of the item popularity. Then, on the user-side, we consider the effect of the time series when obtaining users’ interest. We model the contrastive learning task to disentangle users’ long–short-term interests, which avoids the bias of long–short-term interests overlapping, and use the attention mechanism to realize the dynamic integration of users’ long–short-term interests. Finally, we realize the disentanglement of user–item interaction reasons by decoupling user interest and item popularity. We experiment on two real-world datasets (Douban Movie and KuaiRec) to verify the significance of DDCE, the average improvement of DDCE in three evaluation metrics (NDCG, HR, and Recall) compared to the state-of-the-art model are 5.1106% and 4.1277% (MF as the backbone), 3.8256% and 3.2790% (LightGCN as the backbone), respectively. 相似文献
15.
《Information processing & management》2022,59(4):102990
Documenting the emergent social representations of COVID-19 in public communication is necessary for critically reflecting on pandemic responses and providing guidance for global pandemic recovery policies and practices. This study documents the dynamics of changing social representations of the COVID-19 pandemic on one of the largest Chinese social media, Weibo, from December 2019 to April 2020. We draw on the social representation theory (SRT) and conceptualize topics and topic networks as a form of social representation. We analyzed a dataset of 40 million COVID-19 related posts from 9.7 million users (including the general public, opinion leaders, and organizations) using machine learning methods. We identified 12 topics and found an expansion in social representations of COVID-19 from a clinical and epidemiological perspective to a broader perspective that integrated personal illness experiences with economic and sociopolitical discourses. Discussions about COVID-19 science did not take a prominent position in the representations, suggesting a lack of effective science and risk communication. Further, we found the strongest association of social representations existed between the public and opinion leaders and the organizations’ representations did not align much with the other two groups, suggesting a lack of organizations’ influence in public representations of COVID-19 on social media in China. 相似文献
16.
《Information processing & management》2005,41(5):1243-1262
The analysis of contextual information in search engine query logs enhances the understanding of Web users’ search patterns. Obtaining contextual information on Web search engine logs is a difficult task, since users submit few number of queries, and search multiple topics. Identification of topic changes within a search session is an important branch of search engine user behavior analysis. The purpose of this study is to investigate the properties of a specific topic identification methodology in detail, and to test its validity. The topic identification algorithm’s performance becomes doubtful in various cases. These cases are explored and the reasons underlying the inconsistent performance of automatic topic identification are investigated with statistical analysis and experimental design techniques. 相似文献
17.
[目的/意义]网络用户主要通过购物类、社交类和点评类三种常见网络类型平台发表带有情感倾向的评论,但是由于用户群体、可评论时间、可评论次数以及评论方式等的不同,使得这三种网站类型中的用户对于同一主题的情感表达存在较大差异。文章从用户情感表达特征角度对比评测购物类、社交类和点评类三种主流网络平台中用户情感评论特点,为情感分析数据源选择提供借鉴。[方法/过程]在情感分析的基础上,通过对评论特点、用户情感特征和用户痛点等的对比分析和实证分析,探索三种平台的情感表达特点。[结果/结论]实验结果表明,不同类型网络平台评论的主要内容、情感特征以及痛点表现方面均存在明显差异,进而对情感分析信息源选择提供依据。 相似文献
18.
Graph-based recommendation approaches use a graph model to represent the relationships between users and items, and exploit the graph structure to make recommendations. Recent graph-based recommendation approaches focused on capturing users’ pairwise preferences and utilized a graph model to exploit the relationships between different entities in the graph. In this paper, we focus on the impact of pairwise preferences on the diversity of recommendations. We propose a novel graph-based ranking oriented recommendation algorithm that exploits both explicit and implicit feedback of users. The algorithm utilizes a user-preference-item tripartite graph model and modified resource allocation process to match the target user with users who share similar preferences, and make personalized recommendations. The principle of the additional preference layer is to capture users’ pairwise preferences, provide detailed information of users for further recommendations. Empirical analysis of four benchmark datasets demonstrated that our proposed algorithm performs better in most situations than other graph-based and ranking-oriented benchmark algorithms. 相似文献
19.
【目的/意义】研究从用户节点和网络全局两个视角出发,基于用户相似度与信任度对虚拟学术社区中学者
进行推荐,提高学者推荐的质量。【方法/过程】首先,利用 LDA 主题模型挖掘学者发表的博文主题,计算博文相似
度;通过学者共同好友比例计算好友相似度;然后将博文相似度和好友相似度融合计算用户相似度;最后,融合用
户相似度和信任度进行学者推荐。【结果/结论】提出虚拟学术社区中基于用户相似度与信任度的学者推荐方法,综
合利用用户节点和网络全局信息,为虚拟学术社区用户进行学者推荐。【创新/局限】从用户节点和网络全局两个角
度进行学者信息融合,有效提高了虚拟学术社区中学者推荐的质量。局限在于本文主要考虑的是学者在网络全局
中的信任度,用户节点间的交互信任关系还有待进一步研究。 相似文献
20.
《Information processing & management》2022,59(3):102864
Textual data have been a major form to convey internet users’ content. How to effectively and efficiently discover latent topics among them has essential theoretical and practical value. Recently, neural topic models(NTMs), especially Variational Auto-encoder-based NTMs, proved to be a successful approach for mining meaningful and interpretable topics. However, they usually suffer from two major issues:(1)Posterior collapse: KL divergence will rapidly reach zeros resulting in low-quality representation in latent distribution; (2)Unconstrained topic generative models: Topic generative models are always unconstrained, which potentially leads to discovering redundant topics. To address these issues, we propose Autoencoding Sinkhorn Topic Model based on Sinkhorn Auto-encoder(SAE) and Sinkhorn divergence. SAE utilizes Sinkhorn divergence rather than problematic KL divergence to optimize the difference between posterior and prior, which is free of posterior collapse. Then, to reduce topic redundancy, Sinkhorn Topic Diversity Regularization(STDR) is presented. STDR leverages the proposed Salient Topic Layer and Sinkhorn divergence for measuring distance between salient topic features and serves as a penalty term in loss function facilitating discovering diversified topics in training. Several experiments have been conducted on 2 popular datasets to verify our contribution. Experiment results demonstrate the effectiveness of the proposed model. 相似文献