共查询到20条相似文献，搜索用时 93 毫秒
1.
2.
《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. 相似文献
3.
《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. 相似文献
4.
Fattane Zarrinkalam Mohsen Kahani Ebrahim Bagheri 《Information processing & management》2018,54(2):339-357
Inferring users’ interests from their activities on social networks has been an emerging research topic in the recent years. Most existing approaches heavily rely on the explicit contributions (posts) of a user and overlook users’ implicit interests, i.e., those potential user interests that the user did not explicitly mention but might have interest in. Given a set of active topics present in a social network in a specified time interval, our goal is to build an interest profile for a user over these topics by considering both explicit and implicit interests of the user. The reason for this is that the interests of free-riders and cold start users who constitute a large majority of social network users, cannot be directly identified from their explicit contributions to the social network. Specifically, to infer users’ implicit interests, we propose a graph-based link prediction schema that operates over a representation model consisting of three types of information: user explicit contributions to topics, relationships between users, and the relatedness between topics. Through extensive experiments on different variants of our representation model and considering both homogeneous and heterogeneous link prediction, we investigate how topic relatedness and users’ homophily relation impact the quality of inferring users’ implicit interests. Comparison with state-of-the-art baselines on a real-world Twitter dataset demonstrates the effectiveness of our model in inferring users’ interests in terms of perplexity and in the context of retweet prediction application. Moreover, we further show that the impact of our work is especially meaningful when considered in case of free-riders and cold start users. 相似文献
5.
《Information processing & management》2022,59(1):102755
General recommenders and sequential recommenders are two modeling paradigms of recommender. The main focus of a general recommender is to identify long-term user preferences, while the user’s sequential behaviors are ignored and sequential recommenders try to capture short-term user preferences by exploring item-to-item relations, failing to consider general user preferences. Recently, better performance improvement is reported by combining these two types of recommenders. However, most of the previous works typically treat each item separately and assume that each user–item interaction in a sequence is independent. This may be a too simplistic assumption, since there may be a particular purpose behind buying the successive item in a sequence. In fact, a user makes a decision through two sequential processes, i.e., start shopping with a particular intention and then select a specific item which satisfies her/his preferences under this intention. Moreover, different users usually have different purposes and preferences, and the same user may have various intentions. Thus, different users may click on the same items with an attention on a different purpose. Therefore, a user’s behavior pattern is not completely exploited in most of the current methods and they neglect the distinction between users’ purposes and their preferences. To alleviate those problems, we propose a novel method named, CAN, which takes both users’ purposes and preferences into account for the next-item recommendation. We propose to use Purpose-Specific Attention Unit (PSAU) in order to discriminately learn the representations of user purpose and preference. The experimental results on real-world datasets demonstrate the advantages of our approach over the state-of-the-art methods. 相似文献
6.
《Information processing & management》2022,59(5):103009
The rapid development of online social media makes Abusive Language Detection (ALD) a hot topic in the field of affective computing. However, most methods for ALD in social networks do not take into account the interactive relationships among user posts, which simply regard ALD as a task of text context representation learning. To solve this problem, we propose a pipeline approach that considers both the context of a post and the characteristics of interaction network in which it is posted. Specifically, our method is divided into pre-training and downstream tasks. First, to capture fine contextual features of the posts, we use Bidirectional Encoder Representation from Transformers (BERT) as Encoder to generate sentence representations. Later, we build a Relation-Special Network according to the semantic similarity between posts as well as the interaction network structural information. On this basis, we design a Relation-Special Graph Neural Network (RSGNN) to spread effective information in the interaction network and learn the classification of texts. The experiment proves that our method can effectively improve the detection effect of abusive posts over three public datasets. The results demonstrate that injecting interaction network structure into the abusive language detection task can significantly improve the detection results. 相似文献
7.
《Information processing & management》2020,57(5):102277
Graph neural networks (GNNs) have shown great potential for personalized recommendation. At the core is to reorganize interaction data as a user-item bipartite graph and exploit high-order connectivity among user and item nodes to enrich their representations. While achieving great success, most existing works consider interaction graph based only on ID information, foregoing item contents from multiple modalities (e.g., visual, acoustic, and textual features of micro-video items). Distinguishing personal interests on different modalities at a granular level was not explored until recently proposed MMGCN (Wei et al., 2019). However, it simply employs GNNs on parallel interaction graphs and treats information propagated from all neighbors equally, failing to capture user preference adaptively. Hence, the obtained representations might preserve redundant, even noisy information, leading to non-robustness and suboptimal performance. In this work, we aim to investigate how to adopt GNNs on multimodal interaction graphs, to adaptively capture user preference on different modalities and offer in-depth analysis on why an item is suitable to a user. Towards this end, we propose a new Multimodal Graph Attention Network, short for MGAT, which disentangles personal interests at the granularity of modality. In particular, built upon multimodal interaction graphs, MGAT conducts information propagation within individual graphs, while leveraging the gated attention mechanism to identify varying importance scores of different modalities to user preference. As such, it is able to capture more complex interaction patterns hidden in user behaviors and provide a more accurate recommendation. Empirical results on two micro-video recommendation datasets, Tiktok and MovieLens, show that MGAT exhibits substantial improvements over the state-of-the-art baselines like NGCF (Wang, He, et al., 2019) and MMGCN (Wei et al., 2019). Further analysis on a case study illustrates how MGAT generates attentive information flow over multimodal interaction graphs. 相似文献
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.
企业网络社群中的顾客契合全面刻画了移动互联网情境下企业与顾客、顾客与顾客间持续性互动、互惠的价值关系。研究以社会偏好理论为基础,采用复杂网络演化博弈的方法,基于小世界网络和无标度网络分别构建企业网络社群中顾客契合的演化博弈模型,并使用MATLAB_8.3编程对网络社群中顾客契合演化均衡及机制进行模拟仿真。研究发现社会偏好对小世界和无标度网络社群中的顾客契合演化都存在规律性驱动作用,强社会偏好的效果更为显著,且两种网络社群中的顾客契合演化机制表现出明显差异性。研究为移动互联网情景下用户群体策略演化及收益分析奠定理论基础,并提出打造深度关系的网络社群、建立社会偏好的激励体系、实施社群的差异化管理等推进有效顾客契合管理的策略建议,从而实现企业平台的多方利益共赢。 相似文献
10.
《Information processing & management》2019,56(6):102104
This paper focuses on temporal retrieval of activities in videos via sentence queries. Given a sentence query describing an activity, temporal moment retrieval aims at localizing the temporal segment within the video that best describes the textual query. This is a general yet challenging task as it requires the comprehending of both video and language. Existing research predominantly employ coarse frame-level features as the visual representation, obfuscating the specific details (e.g., the desired objects “girl”, “cup” and action “pour”) within the video which may provide critical cues for localizing the desired moment. In this paper, we propose a novel Spatial and Language-Temporal Tensor Fusion (SLTF) approach to resolve those issues. Specifically, the SLTF method first takes advantage of object-level local features and attends to the most relevant local features (e.g., the local features “girl”, “cup”) by spatial attention. Then we encode the sequence of the local features on consecutive frames by employing LSTM network, which can capture the motion information and interactions among these objects (e.g., the interaction “pour” involving these two objects). Meanwhile, language-temporal attention is utilized to emphasize the keywords based on moment context information. Thereafter, a tensor fusion network learns both the intra-modality and inter-modality dynamics, which can enhance the learning of moment-query representation. Therefore, our proposed two attention sub-networks can adaptively recognize the most relevant objects and interactions in the video, and simultaneously highlight the keywords in the query for retrieving the desired moment. Experimental results on three public benchmark datasets (obtained from TACOS, Charades-STA, and DiDeMo) show that the SLTF model significantly outperforms current state-of-the-art approaches, and demonstrate the benefits produced by new technologies incorporated into SLTF. 相似文献
11.
Chaogang Fu 《Information processing & management》2019,56(6):102075
Community question answering (CQA) services that enable users to ask and answer questions are popular on the internet. Each user can simultaneously play the roles of asker and answerer. Some work has aimed to model the roles of users for potential applications in CQA. However, the dynamic characteristics of user roles have not been addressed. User roles vary over time. This paper explores user representation by tracking user-role evolution, which could enable several potential applications in CQA, such as question recommendation. We believe this paper is the first to track user-role evolution and investigate its influence on the performance of question recommendation in CQA. Moreover, we propose a time-aware role model (TRM) to effectively track user-role evolution. With different independence assumptions, two variants of TRM are developed. Finally, we present the TRM-based approach to question recommendation, which provides a mechanism to naturally integrate the user-role evolution with content relevance between the answerer and the question into a unified probabilistic framework. Experiments using real-world data from Stack Overflow show that (1) the TRM is valid for tracking user-role evolution, and (2) compared with baselines utilizing role based methods, our TRM-based approach consistently and significantly improves the performance of question recommendation. Hence, our approach could enable several potential applications in CQA. 相似文献
12.
《Information processing & management》2023,60(5):103416
Recently, graph neural network (GNN) has been widely used in sequential recommendation because of its powerful ability to capture high-order collaborative relations, greatly promoting recommendation performance. However, some existing GNN-based methods fail to make full use of multiple relevant features of nodes and ignore the impact of semantic association between nodes on extracting user preferences. To this end, we propose a multi-feature fused collaborative attention network MASR, which sufficiently learns the temporal and positional features of nodes, and innovatively measures the importance of these two features for analyzing the nodes’ dynamic patterns. In addition, we incorporate semantic-enriched contrastive learning into collaborative filtering to enhance the semantic association between nodes and reduce the noise from the structural neighborhood, which has a positive effect on the sequential recommendation. Compared with the baseline models, the performance of MASR on MovieLens, CDs and Beauty datasets is improved by 2.0%, 2.1% and 1.7% respectively, proving its effectiveness in the sequential recommendation. 相似文献
13.
《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. 相似文献
14.
《Information processing & management》2023,60(4):103412
Recently, phishing scams have become one of the most serious types of crime involved in Ethereum, the second-largest blockchain-based cryptocurrency platform. The existing phishing scams detection techniques for Ethereum mostly use traditional machine learning or network representation learning to mine the key information from the transaction network and identify phishing addresses. However, these methods typically crop the temporal transaction graph into snapshot sequences or construct temporal random wanderings to model the dynamic evolution of the topology of the transaction graph. In this paper, we propose PDTGA, a method that applies graph representation learning based on temporal graphs attention to improve the effectiveness of phishing scams detection in Ethereum. Specifically, we learn the functional representation of time directly and model the time signal through the interactions between the time encoding function and node features, edge features, and the topology of the graph. We collected a real-world Ethereum phishing scam dataset, containing over 250,000 transaction records between more than 100,000 account addresses, and divided them into three datasets of different sizes. Through data analysis, we first summarized the periodic pattern of Ethereum phishing scam activities. Then we constructed 14 kinds of account node features and 3 kinds of transaction edge features. Experimental evaluations based on the above three datasets demonstrate that PDTGA with 94.78% AUC score and 88.76% recall score outperforms the state-of-the-art methods. 相似文献
15.
《Information processing & management》2023,60(4):103373
Detecting feature interactions is an important post-hoc method to explain black-box models. The literature on feature interactions mainly focus on detecting their existence and calculating their strength. Little attention has been given to the form how the features interact. In this paper, we propose a novel method to capture the form of feature interactions. First, the feature interaction sets in black-box models are detected by the high dimensional model representation-based method. Second, the pairwise separability of the detected feature interactions is determined by a novel model which is verified theoretically. Third, the set separability of the feature interactions is inferred based on pairwise separability. Fourth, the interaction form of each feature in product separable sets is explored. The proposed method not only provides detailed information about the internal structure of black-box models but also improves the performance of linear models by incorporating the appropriate feature interactions. The experimental results show that the accuracy of recognizing product separability in synthetic models is 100%. Experiments on three regression and three classification tasks demonstrate that the proposed method can capture the product separable form of feature interactions effectively and improve the prediction accuracy greatly. 相似文献
16.
In this paper, we propose a generative model, the Topic-based User Interest (TUI) model, to capture the user interest in the User-Interactive Question Answering (UIQA) systems. Specifically, our method aims to model the user interest in the UIQA systems with latent topic method, and extract interests for users by mining the questions they asked, the categories they participated in and relevant answer providers. We apply the TUI model to the application of question recommendation, which automatically recommends to certain user appropriate questions he might be interested in. Data collection from Yahoo! Answers is used to evaluate the performance of the proposed model in question recommendation, and the experimental results show the effectiveness of our proposed model. 相似文献
17.
User-model based personalized summarization 总被引：3，自引：0，他引：3
The potential of summary personalization is high, because a summary that would be useless to decide the relevance of a document if summarized in a generic manner, may be useful if the right sentences are selected that match the user interest. In this paper we defend the use of a personalized summarization facility to maximize the density of relevance of selections sent by a personalized information system to a given user. The personalization is applied to the digital newspaper domain and it used a user-model that stores long and short term interests using four reference systems: sections, categories, keywords and feedback terms. On the other side, it is crucial to measure how much information is lost during the summarization process, and how this information loss may affect the ability of the user to judge the relevance of a given document. The results obtained in two personalization systems show that personalized summaries perform better than generic and generic-personalized summaries in terms of identifying documents that satisfy user preferences. We also considered a user-centred direct evaluation that showed a high level of user satisfaction with the summaries. 相似文献
18.
《Information processing & management》2023,60(5):103464
Existing approaches to learning path recommendation for online learning communities mainly rely on the individual characteristics of users or the historical records of their learning processes, but pay less attention to the semantics of users’ postings and the context. To facilitate the knowledge understanding and personalized learning of users in online learning communities, it is necessary to conduct a fine-grained analysis of user data to capture their dynamical learning characteristics and potential knowledge levels, so as to recommend appropriate learning paths. In this paper, we propose a fine-grained and multi-context-aware learning path recommendation model for online learning communities based on a knowledge graph. First, we design a multidimensional knowledge graph to solve the problem of monotonous and incomplete entity information presentation of the single layer knowledge graph. Second, we use the topic preference features of users’ postings to determine the starting point of learning paths. We then strengthen the distant relationship of knowledge in the global context using the multidimensional knowledge graph when generating and recommending learning paths. Finally, we build a user background similarity matrix to establish user connections in the local context to recommend users with similar knowledge levels and learning preferences and synchronize their subsequent postings. Experiment results show that the proposed model can recommend appropriate learning paths for users, and the recommended similar users and postings are effective. 相似文献
19.
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. 相似文献