User Interest Mining Research Articles

Interest HD: An Interest Frame Model for Recommendation Based on HD Image Generation.

This work is inspired by high-definition (HD) image generation techniques. When the user's interests are viewed as different frames of varying clarity, the unclear parts of one interest frame can be clarified by other interest frames. The user's overall HD interest portrait can be viewed as a fusion of multiple interest frames through detail compensation. Based on this inspiration, we propose a model for generating HD interest portrait called interest frame for recommendation (IF4Rec). First, we present a fine-grained pixel-level user interest mining method, Pixel embedding (PE) uses positional coding techniques to mine atomic-level interest pixel matrices in multiple dimensions, such as time, space, and frequency. Then, using an atomic-level interest pixel matrix, we propose Item2Frame to generate several interest frames for a user. The similarity score of each item is calculated to fill the multi-interest pixel clusters, through an improved self-attention mechanism. Finally, stimulated by HD image generation techniques, we initially present an interest frame noise compensation method. By utilizing the multihead attention mechanism, pixel-level optimization and noise complementation are performed between multi-interest frames, and an HD interest portrait is achieved. Experiments show that our model mines users' interests well. On five publicly available datasets, our model outperforms the baselines.

Enhancing cross-market recommendations by addressing negative transfer and leveraging item co-occurrences

Real-world multinational e-commerce companies, such as Amazon and eBay, serve in multiple countries and regions. Some markets are data-scarce, while others are data-rich. In recent years, cross-market recommendation (CMR) has been proposed to bolster data-scarce markets by leveraging auxiliary information from data-rich markets. Previous CMR algorithms have employed techniques such as sharing market-agnostic parameters or incorporating inter-market similarity to optimize the performance of CMR. However, the existing approaches have several limitations: (1) They do not fully utilize the valuable information on item co-occurrences obtained from data-rich markets (such as the consistent purchase of mice and keyboards). (2) They ignore the issue of negative transfer stemming from disparities across diverse markets. To address these limitations, we introduce a novel attention-based model that exploits users’ historical behaviors to mine general patterns from item co-occurrences and designs market-specific embeddings to mitigate negative transfer. Specifically, we propose an attention-based user interest mining module to harness the potential of common items as bridges for mining general knowledge from item co-occurrence patterns through rich data derived from global markets. In order to mitigate the adverse effects of negative transfer, we decouple the item representations into market-specific embeddings and market-agnostic embeddings. The market-specific embeddings effectively model the inherent biases associated with different markets, while the market-agnostic embeddings learn generic representations of the items. Extensive experiments conducted on seven real-world datasets illustrate our model’s effectiveness.11Our codes and checkpoints are available at https://github.com/laowangzi/ACMR. Our model outperforms the suboptimal model by an average of 4.82%, 6.82%, 3.87%, and 5.34% across four variants of two metrics. Extensive experiments and analysis demonstrate the effectiveness of our proposed model in mining general item co-occurrence patterns and avoiding negative transfer for data-sparse markets.

An Empirical Study on Personalized Product Recommendation Based on Cross-Border E-Commerce Customer Data Analysis

Thanks to the rapid growth of cross-border e-commerce platforms, numerous cross-border items are now available to customers. Several serious issues with cross-border e-commerce platforms related to item promotion and consumer product screening have arisen. Particular importance should be placed on studying and implementing personalized recommendation systems based on international e-commerce. In light of the quick expansion of commodities, when making individualized suggestions, traditional recommendation algorithms have had to deal with issues such as scant data, a chilly start to the market, and trouble identifying user preferences. To automatically mine the implicit and latent relationships between users and objects in recommendation systems, this study employs deep learning with nonlinear learning capabilities, which resolves the challenges of user interest mining. The weaknesses of the existing global recommendation research are emphasized, the study of conventional recommendation algorithms mixed with deep learning technology is deep factorization machine (DeepFM) and neural matrix factorization (NeuMF) models. Both models excel in recommending implicit feedback data. The DeepFM model yields the lowest loss function values, while the NeuMF model outperforms the competing models in terms of HR@20 (a commonly used indicator to measure the recall rate) and loss functions. In summary, this research addresses critical issues in cross-border e-commerce by developing personalized recommendation systems and integrating deep learning with traditional recommendation algorithms to enhance global recommendations.

Evolving Interest with Feature Co-action Network for CTR Prediction

Recently, many deep learning-based models have been successfully applied to click-through rate prediction. However, most previous models focus only on feature-level interactions between a single user behavior and the target item or only treat the user’s historical behavior as a sequence to uncover the hidden interests behind it when mining user interests. This can lead to user interest that evolves over time dynamically being ignored or the interest shown by a single user’s behavior not being exploited. Based on the above problems, we propose evolving interest with feature co-action network (EIFCN). Specifically, we first design user dynamic interest network to treat the user’s historical behavior as a sequence of information, and tap into the user’s hidden interests over time. In this part, we use a multi-head self-attention mechanism to initially process the data and then pass it into the deep learning network. Then a feature co-action network is designed to mine the user’s single behavior and the displayed feature-level interactions of the target item. Experimental results show that the EIFCN model performs better than other models.

Improve Session-Based Recommendation with Triplet Mining and Dynamic Perturbations Graph Neural Networks

Session-based recommendation (SBR) emphasizes mining user interests to predict the next click based on recent interactions within sessions. Most current SBR methods suffer from insufficient interactive information problems and fail to distinguish session representations with high similarities, which can neglect the inherent features within sessions. To fill the gap, we propose a triplet mining enhanced graph neural networks (TME-GNN) approach to enhance the recommendation systems by mining structural and inherent information. Technically, we first generate anchor, positive and negative embeddings based on the given session and set a triplet mining task to improve the recommendation task with subtle features by pushing positive pairs close and pulling negative pairs away. Second, to robust the model, we employ a self-supervised auxiliary task by adding dynamic perturbations to the embedding space. We conduct extensive experiments to demonstrate the superiority of our method against other state-of-the-art algorithms. Our implementations are available on the following site https://github.com/Info4Rec/TME-GNN .

Individual Online Learning Behavior Analysis Based on Hadoop.

The online individual behavior analysis is an important means for mining user interests. The user retweeting behavior prediction is typical problem for online individual behavior analysis. In order to make online learning behavior prediction method more suitable for the application of large-scale datasets, the improved condensed K nearest neighbor (ICKNN) method is proposed in this paper. Inspired by the idea of compressing samples in the condensed nearest neighbor (CNN) algorithm, this proposed method has adopted the Hadoop platform to parallelize the traditional CNN algorithm. For the traditional CNN method, as the value of K increases, the compression ratio decreases and so as the efficiency. The proposed ICKNN method can parallelize the traditional CNN method under the Hadoop framework to enhance efficiency. The proposed ICKNN method in this paper is validated by actual Twitter retweeting dataset. It can be seen that the proposed method in this paper has a higher compression rate than the traditional CNN algorithm. In terms of accuracy, the classification accuracy of the proposed ICKNN method has decreased compared with the traditional KNN method. However, the time consumed by the ICKNN method has significantly reduced compared with the traditional KNN method and CNN method, which can greatly improve the efficiency.

FedCTR: Federated Native Ad CTR Prediction with Cross-platform User Behavior Data

Native ad is a popular type of online advertisement that has similar forms with the native content displayed on websites. Native ad click-through rate (CTR) prediction is useful for improving user experience and platform revenue. However, it is challenging due to the lack of explicit user intent, and user behaviors on the platform with native ads may be insufficient to infer users’ interest in ads. Fortunately, user behaviors exist on many online platforms that can provide complementary information for user-interest mining. Thus, leveraging multi-platform user behaviors is useful for native ad CTR prediction. However, user behaviors are highly privacy-sensitive, and the behavior data on different platforms cannot be directly aggregated due to user privacy concerns and data protection regulations. Existing CTR prediction methods usually require centralized storage of user behavior data for user modeling, which cannot be directly applied to the CTR prediction task with multi-platform user behaviors. In this article, we propose a federated native ad CTR prediction method named FedCTR, which can learn user-interest representations from cross-platform user behaviors in a privacy-preserving way. On each platform a local user model learns user embeddings from the local user behaviors on that platform. The local user embeddings from different platforms are uploaded to a server for aggregation, and the aggregated ones are sent to the ad platform for CTR prediction. Besides, we apply local differential privacy and differential privacy to the local and aggregated user embeddings, respectively, for better privacy protection. Moreover, we propose a federated framework for collaborative model training with distributed models and user behaviors. Extensive experiments on real-world dataset show that FedCTR can effectively leverage multi-platform user behaviors for native ad CTR prediction in a privacy-preserving manner.

The Impact of Personality and Demographic Variables in Collaborative Filtering of User Interest on Social Media

The advent of social networks and micro-blogging sites online has led to an abundance of user-generated content. Hence, the enormous amount of content is viewed as inappropriate and unimportant information by many users on social media. Therefore, there is a need to use personalization to select information related to users’ interests or searchers on social media platforms. Therefore, in recent years, user interest mining has been a prominent research area. However, almost all of the emerging research suffers from significant gaps and drawbacks. Firstly, it suffers from focusing on the explicit content of the users to determine the interests of the users while neglecting the multiple facts as the personality of the users; demographic data may be a valuable source of influence on the interests of the users. Secondly, existing work represents users with their interesting topics without considering the semantic similarity between the topics based on clusters to extract the users’ implicit interests. This paper is aims to propose a novel user interest mining approach and model based on demographic data, big five personality traits and similarity between the topics based on clusters. To demonstrate the leverage of combining user personality traits and demographic data into interest investigation, various experiments were conducted on the collected data. The experimental results showed that looking at personality and demographic data gives more accurate results in mining systems, increases utility, and can help address cold start problems for new users. Moreover, the results also showed that interesting topics were the dominant factor. On the other hand, the results showed that the current users’ implicit interests can be predicted through the cluster based on similar topics. Moreover, the hybrid model based on graphs facilitates the study of the patterns of interaction between users and topics. This model can be beneficial for researchers, people on social media, and for certain research in related fields.

A multi-agent based model for user interest mining on Sina Weibo

User interest mining on Sina Weibo is the basis of personalized recommendations, advertising, marketing promotions, and other tasks. Although great progress has been made in this area, previous studies have ignored the differences among users: the varied behaviors and habits that lead to unique user data characteristics. It is unreasonable to use a single strategy to mine interests from such varied user data. Therefore, this paper proposes an adaptive model for user interest mining based on a multi-agent system whose input includes self-descriptive user data, microblogs and correlations. This method has the ability to select the appropriate strategy based on each user's data characteristics. The experimental results show that the proposed method performs better than the baselines.

Analysing Reviewer’s Credibility and Sentiment to Build A Profile Model for Product Recommendation of User

Understanding a particular customers product needs, likes, and dislikes and to make an automation based on it is a very convolute job. This project augments heuristic-driven user interest profiling with reviewer credibility analysis and fine-grained feature sentiment analysis to conceive a vigorous recommendation methodology. The proposed credibility, interest and sentiment enhanced recommendation (CISER) model has five modules: candidate, feature extraction, reviewer credibility analysis, user interest mining, candidate feature sentiment assignment, and recommendation module. Review corpus is given as an input. The first module uses context and sentiment confidence to procure useful, crucial features.To detect the untrustworthy reviews and reviewers, reviewer credibility analysis proffers an approach to weigh reviews according to the parameters of credibility. The user interest mining module, uses fairness of review writing as heuristics for interest-pattern mining. The candidate feature sentiment assignment module comparesexisting features in review based on their fast Text sentiment polarity. The final module uses credible sentiment scoring for purchase recommendations. The proposed recommendation modelutilizes not only numeric reviewsbut also uses sentiment expressions connected with components, customer preference profiles, and reviewer credibility for quantitative analysis of various alternative products. The mean average precision (MAP@1) for CISER is 93%, and MAP@3 is 49%, which is better than current state-of-the-art systems.

Recommendation Model Based on Probabilistic Matrix Factorization, Integrating User Trust Relationship, Interest Mining, and Item Correlation

Personalized recommendation has gained widespread attention in the academic and industrial fields to minimize information overload and has produced good benefits. Current research shows that social recommendations that effectively utilize user trust relationships can solve data sparsity and cold start problems common in traditional collaborative filtering algorithms. However, existing social recommendation models have focused only on direct trust relationships between users and have ignored indirect trust relationships and item correlations. To address these problems, we propose a probabilistic matrix factorization-based recommendation model based on trust relationships, interest mining, and item correlation. The proposed recommendation model considers the direct and indirect trust relationships between users, the similarities in users’ preferences for item attributes, and the correlations between items. Finally, the rating of the item is predicted by the target user and provides the target user with personalized item recommendations. We evaluate the recommendation performances of the proposed recommendation model on the FilmTrust and the CiaoDVD datasets and find that it alleviates the user’s cold start problem and provides higher recommendation accuracy and diversity than popular algorithms.

Network user interest mining method based on Neutrosophic cluster analysis

These days’ user interests have become more critical for companies and firms to introduce their content due to the growth in networks and the internet. So this method used neutrosophic sets for network user interest. In this paper, we proposed five main criteria and seventeen sub-criteria to show user interest in the network. The multi-criteria decision-making (MCDM) method is used to deal with various criteria and sub-criteria. So the Analytical Hierarchal Process (AHP) is used to show weights of criteria and sub-criteria to present the user interest in the network. An illustrative example provides to show calculations of the proposed method.

Who Are Like-Minded: Mining User Interest Similarity in Online Social Networks

In this paper, we mine and learn to predict how similar a pair of users’ interests towards videos are, based on demographic, social and interest information of these users. We use the video access patterns of active users as ground truth. We adopt tag-based user profiling to establish this ground truth. We then show the effectiveness of the different features, and their combinations and derivatives, in predicting user interest similarity, based on different machine-learning methods for combining multiple features. We propose a hybrid tree-encoded linear model for combining the features, and show that it out-performs other linear and tree-based models. Our methods can be used to predict user interest similarity when the ground-truth is not available, e.g. for new users, or inactive users whose interests may have changed from old access data, and is useful for video recommendation.

Product Adoption Maximization Leveraging Social Influence and User Interest Mining

A Social Networking Service (SNS) platform provides digital footprints to discover users’ interests and track the social diffusion of product adoptions. How to identify a small set of seed users in a SNS who is potential to adopt a new promoting product with high probability, is a key question in social networks. Existing works approached this as a social influence maximization problem. However, these approaches relied heavily on text information for topic modeling and neglected the impact of seed users’ relation in the model. To this end, in this paper, we first develop a general product adoption function integrating both users’ interest and social influence, where the user interest model relies on historical user behavior and the seed users’ evaluations without any text information. Accordingly, we formulate a product adoption maximization problem and prove NP-hardness of this problem. We then design an efficient algorithm to solve this problem. We further devise a method to automatically learn the parameter in the proposed adoption function from users’ past behaviors. Finally, experimental results show the soundness of our proposed adoption decision function and the effectiveness of the proposed seed selection method for product adoption maximization.

Personality-Aware Product Recommendation System Based on User Interests Mining and Metapath Discovery

A recommendation system is an integral part of any modern online shopping or social network platform. The product recommendation system as a typical example of the legacy recommendation systems suffers from two major drawbacks: recommendation redundancy and unpredictability concerning new items (cold start). These limitations take place because the legacy recommendation systems rely only on the user's previous buying behavior to recommend new items. Incorporating the user's social features, such as personality traits and topical interest, might help alleviate the cold start and remove recommendation redundancy. Therefore, in this article, we propose Meta-Interest, a personality-aware product recommendation system based on user interest mining and metapath discovery. Meta-Interest predicts the user's interest and the items associated with these interests, even if the user's history does not contain these items or similar ones. This is done by analyzing the user's topical interests and, eventually, recommending the items associated with the user's interest. The proposed system is personality-aware from two aspects; it incorporates the user's personality traits to predict his/her topics of interest and to match the user's personality facets with the associated items. The proposed system was compared against recent recommendation methods, such as deep-learning-based recommendation system and session-based recommendation systems. Experimental results show that the proposed method can increase the precision and recall of the recommendation system, especially in cold-start settings.

ComPath: User Interest Mining in Heterogeneous Signed Social Networks for Internet of People

The Internet of People (IoP) is a human-centric computing paradigm, where the people are not considered merely as end users, but become the center of the computing architecture. The computing model of IoP requires that the system understand the social characters of the users, such as the users’ emotions, personality types, and interests. User interest detection is an important task in IoP. In this article, we propose a user interest detection framework for user interest detection in the context of a signed social network for IoP. First, we propose a new proximity function that measures the similarity between users based on their interests/disinterests with respect to the relative popularity of these interests/disinterests among other users. Second, we propose a greedy community detection algorithm that detects communities of users with common interests with possible overlapping communities using the adaptive clique relaxation technique. Finally, we introduce a novel link prediction algorithm named ComPath that leverages the community affiliation information to predict the unknown links in heterogeneous signed social networks. Experimental results show that ComPath outperforms other computational-based baselines as well as deep-learning-based baselines especially in the cold start phase with only a few training data.

Mining user interest based on personality-aware hybrid filtering in social networks

With the emergence of online social networks and microblogging websites, user interest mining has been an active research topic for the past few years. However, most of the existing works suffer from two significant drawbacks, firstly, they focus on the user’s explicit content and social network structure to predicate the user’s interests, neglecting the fact that the user’s personality might be a rich source to infer the topical interests. Secondly, they represent the user’s content using the bag-of-words model that ignores the chronological order of the posted content, hence the predicted interests might contain outdated topics that the user does not interest anymore. In this paper, we propose a novel user interest mining system based on Big Five personality traits and dynamic interests. To prove the effectiveness of incorporating the user’s personality traits in the interest mining process, we have implemented a social network for news sharing and conducted different experiments on the collected data. The experiment results show that considering personality traits can increase the precision and recall of interest mining systems, as well as can help to tackle the cold start problem.

DIM: Adaptively Combining User Interests Mined at Different Stages Based on Deformable Interest Model

User interest mining is widely used in the fields of personalized search and personalized recommendation. Traditional methods ignore the formation of user interest which is a process that evolves over time. This leads to the inability to accurately describe the distribution of user interest. In this paper, we propose the interest tracking model (ITM). To add the timing, ITM uses Dirichlet distribution and multinomial distribution to describe the evolutional process of interest topics and frequent patterns, which well adapts to the evolution of user interest hidden in short texts between different time slices. In addition, it is well known that user interest is composed of long-term interest and situational interest including short-term interest and social hot topics. State-of-the-art methods simply regard the users’ long-term interest as the users’ final interest, which makes those unable to completely describe the user interest distribution. To solve this problem, we propose the deformable interest model (DIM) which designs an objective function to combine users’ long-term interest and situational interest and more comprehensively and accurately mine user interest. Furthermore, we present the degree of deformation which measures the subinterest's degree of influence on final interest and propose in DIM the influence real-time update mechanism. The mechanism adaptively updates the degree of deformation through the linear iteration and reduces the degree of dependence of the interest model on training sets. We present results via a dataset consisting of Flickr users and their uploaded information in three months, a dataset consisting of Twitter users and their tweets in three months, and a dataset consisting of Instagram users and their uploaded information in three months, showing that the perplexity is reduced to 0.378, the average accuracy is increased to 94%, and the average NMI is increased to 0.20, which prove better interest prediction.

Reviewer Credibility and Sentiment Analysis Based User Profile Modelling for Online Product Recommendation

Deciphering user purchase preferences, their likes and dislikes is a very tricky task even for humans, making its automation a very complex job. This research work augments heuristic-driven user interest profiling with reviewer credibility analysis and fine-grained feature sentiment analysis to devise a robust recommendation methodology. The proposed credibility, interest and sentiment enhanced recommendation (CISER) model has five modules namely candidate feature extraction, reviewer credibility analysis, user interest mining, candidate feature sentiment assignment and recommendation module. Review corpus is given as an input to the CISER model. Candidate feature extraction module uses context and sentiment confidence to extract features of importance. To make our model robust to fake and unworthy reviews and reviewers, reviewer credibility analysis proffers an approach of associating expertise, trust and influence scores with reviewers to weigh their opinion according to their credibility. The user interest mining module uses aesthetics of review writing as heuristics for interest-pattern mining. The candidate feature sentiment assignment module scores candidate features present in review based on their fastText sentiment polarity. Finally, the recommendation module uses credibility weighted sentiment scoring of user preferred features for purchase recommendations. The proposed recommendation methodology harnesses not only numeric ratings, but also sentiment expressions associated with features, customer preference profile and reviewer credibility for quantitative analysis of various alternative products. The mean average precision (MAP@1) for CISER is 93% and MAP@3 is 49%, which is better than current state-of-the-art systems.

A Method of Interest Degree Mining Based on Behavior Data Analysis

Based on big data, this paper starts from the behavior data of users on social media, and studies and explores the core issues of user modeling under personalized services. Focusing on the goal of user interest modeling, this paper proposes corresponding improvement measures for the existing interest model, which has great difference in interest description among different users and it is difficult to find the user interest change in time. For the above problems, this paper takes user-generated content and user behavior information as the analysis object, and uses natural language processing, knowledge warehouse, data fusion and other methods and techniques to numerically analyze user interest mining based on text mining and multi-source data fusion. We propose a user interest label space mapping method to avoid data sparse problem caused by too many dimensions in interest analysis. At the same time, we propose a method to extract and blend the long-term and short-term interests, and realize the comprehensive evaluation of interests. In the analysis of the big data phase, the user preference social property application preference value law, it is expected to achieve user Internet social media application preference data mining from the perspective of big data.