Hashtag Recommendation Based on Multi-Features of Microblogs

Hashtag recommendation for microblogs is a very hot research topic that is useful to many applications involving microblogs. However, since short text in microblogs and low utilization rate of hashtags will lead to the data sparsity problem, it is difficult for typical hashtag recommendation methods to achieve accurate recommendation. In light of this, we propose HRMF, a hashtag recommendation method based on multi-features of microblogs in this article. First, our HRMF expands short text into long text, and then it simultaneously models multi-features (i.e., user, hashtag, text) of microblogs by designing a new topic model. To further alleviate the data sparsity problem, HRMF exploits hashtags of both similar users and similar microblogs as the candidate hashtags. In particular, to find similar users, HRMF combines the designed topic model with typical user-based collaborative filtering method. Finally, we realize hashtag recommendation by calculating the recommended score of each hashtag based on the generated topical representations of multi-features. Experimental results on a real-world dataset crawled from Sina Weibo demonstrate the effectiveness of our HRMF for hashtag recommendation.     

Hashtag Recommendation Approach Based on Content and User Characteristics

ABSTRACT

Twitter has become a popular microblogging service that allows millions of active users share news, emergent social events, personal opinions, etc. That leads to a large amount of data producing every day and the problem of managing tweets becomes extremely difficult. To categorize the tweets and make easily in searching, the users can use the hashtags embedding in their tweets. However, valid hashtags are not restricted which lead to a very heterogeneous set of hashtags created on Twitter, increasing the difficulty of tweet categorization. In this paper, we propose a hashtag recommendation method based on analyzing the content of tweets, user characteristics, and currently popular hashtags on Twitter. The proposed method uses personal profiles of the users to discover the relevant hashtags. First, a combination of tweet contents and user characteristics is used to find the top-k similar tweets. We exploit the content of historical tweets, used hashtags, and the social interaction to build the user profiles. The user characteristics can help to find the close users and enhance the accuracy of finding the similar tweets to extract the hashtag candidates. Then a set of hashtag candidates is ranked based on their popularity in long and short periods. The experiments on tweet data showed that the proposed method significantly improves the performance of hashtag recommendation systems.     

Phrase-based hashtag recommendation for microblog posts

In microblogs, authors use hashtags to mark keywords or topics. These manually labeled tags can be used to benefit various live social media applications (e.g., microblog retrieval, classification). However, because only a small portion of microblogs contain hashtags, recommending hashtags for use in microblogs are a worthwhile exercise. In addition, human inference often relies on the intrinsic grouping of words into phrases. However, existing work uses only unigrams to model corpora. In this work, we propose a novel phrase-based topical translation model to address this problem. We use the bag-of-phrases model to better capture the underlying topics of posted microblogs. We regard the phrases and hashtags in a microblog as two different languages that are talking about the same thing. Thus, the hashtag recommendation task can be viewed as a translation process from phrases to hashtags. To handle the topical information of microblogs, the proposed model regards translation probability as being topic specific. We test the methods on data collected from realworld microblogging services. The results demonstrate that the proposed method outperforms state-of-the-art methods that use the unigram model.     

基于电子商务的个性化推荐系统研究

在电子商务环境中,实现个性化服务,理解用户兴趣就成了提供个性化服务的关键任务。因此,建立用户兴趣模型和构建推荐库就成为个性化推荐系统的实现基础。论文通过网络爬虫获取到相关的网页,进行预处理后,采用SVM（支持向量机）分类文档建立推荐库。通过对用户访问路径、搜索关键字等分析,获取用户兴趣,采用向量空间模型表示用户兴趣,利用机器学习构建用户兴趣模型。在推荐库和用户兴趣模型的基础上,加入推荐引擎,实现了基于电子商务的个性化推荐系统。     

基于小样本学习的个性化Hashtag推荐

近年来,Hashtag推荐任务吸引了很多研究者的关注。目前,大部分深度学习方法把这个任务看作是一个多标签分类问题,将Hashtag看作为微博的类别。但是这些方法的输出空间固定,在没有进行重新训练的情况下,不能处理训练不可见的Hashtag。然而,实际上Hashtag会随着时事热点不断快速更新。为了解决这一问题,该文提出将Hashtag推荐任务建模成小样本学习任务。同时,结合用户使用Hashtag的偏好降低推荐的复杂度。在真实的推特数据集上的实验表明,与目前最优方法相比,该模型不仅可以取得更好的推荐结果,而且表现得更为鲁棒。     

垂直学习社区基于学习兴趣与风格的社会化推荐算法

垂直学习社区包含了海量的学习资源,出现了信息过载现象,个性化推荐是解决这个难题的方法之一.但垂直学习社区中评分数据稀疏而文本、社交信息丰富,传统的协同过滤推荐算法不完全适用.基于用户产生的文本和行为信息,利用作者主题模型构建新的用户学习兴趣相似度衡量模型;根据用户交互行为信息综合考虑信任与不信任因素构建用户全面信任关系计算全面信任度;通过分析用户多维度学习行为模式,自动识别用户学习风格;最后提出融合兴趣相似度、全面信任度及学习风格的社会化推荐算法.用垂直学习社区网站CSDN实际数据集进行了实验分析.结果表明本文提出的推荐方法能更好向用户推荐其感兴趣的学习资源,有效地提高了推荐精度,进而提高用户学习效果.     

手机广告推荐中的用户兴趣建模研究*

为了增强基于WAP网页的手机广告推荐中用户建模的准确性,并对"非邀"式广告推荐中脱离用户兴趣试探性推荐进行修正,针对手机广告推荐中手机屏幕小、用户注意力集中等特点,根据用户对广告的访问历史和操作模式建立其广告兴趣模型和非兴趣模型,同时分析用户网页访问模式探测其网页兴趣度,在此基础上建立用户综合兴趣模型。分别采用基于网页兴趣模型、基于广告兴趣模型和基于用户综合兴趣模型进行广告推荐,随着样本空间增大,综合兴趣模型的查准率明显优于另两者。实验验证了用户综合兴趣模型在手机广告推荐中的有效性和优越性。     

An angle-based interest model for text recommendation

Building an interest model is the key to realize personalized text recommendation. Previous interest models neglect the fact that a user may have multiple angles of interest. Different angles of interest provide different requests and criteria for text recommendation. This paper proposes an interest model that consists of two kinds of angles: persistence and pattern, which can be combined to form complex angles. The model uses a new method to represent the long-term interest and the short-term interest, and distinguishes the interest in object and the interest in the link structure of objects. Experiments with news-scale text data show that the interest in object and the interest in link structure have real requirements, and it is effective to recommend texts according to the angles.     

Rank order-based recommendation approach for multiple featured products

Recommendation methods, which suggest a set of products likely to be of interest to a customer, require a great deal of information about both the user and the products. Recommendation methods take different forms depending on the types of preferences required from the customer. In this paper, we propose a new recommendation method that attempts to suggest products by utilizing simple information, such as ordinal specification weights and specification values, from the customer. These considerations lead to an ordinal weight-based multi-attribute value model. This model is well suited to situations in which there exist insufficient data regarding the demographics and transactional information on the target customers, because it enables us to recommend personalized products with a minimal input of customer preferences. The proposed recommendation method is different from previously reported recommendation methods in that it explicitly takes into account multidimensional features of each product by employing an ordered weight-based multi-attribute value model. To evaluate the proposed method, we conduct comparative experiments with two other methods rooted in distance-based similarity measures.     

基于加权动态兴趣度的微博个性化推荐

针对微博信息量大、用户兴趣随时间变化特征,提出一种基于加权动态兴趣度(WDDI)的微博个性化推荐模型。WDDI模型考虑微博转发特征,并引入时间因子,利用微博主题模型基于转发的狄利克雷分配(RT-LDA)对用户微博进行研究,建立用户对主题的个体动态兴趣模型。通过用户与其关注用户的相似度和交互频率获取用户的群体动态兴趣,将用户个体兴趣与群体兴趣加权结合得到加权动态主题兴趣模型。对用户接收的新微博按动态兴趣度降序排列,实现微博动态个性化推荐。实验表明,WDDI模型较之传统推荐模型,在微博服务中能够更准确地反映用户动态兴趣。     

.基于社区网络内容的个性化推荐算法研究

针对用户在社区网络中面对海量的信息和资源,如何快速便捷地获得自己感兴趣的内容问题,提出一种基于社区网络内容的个性化推荐算法。在得到相同兴趣用户聚类的基础上,该算法首先通过用户访问日志信息挖掘相似内容推荐项,然后根据用户兴趣挖掘新的内容推荐项。实验结果表明,该算法不仅提高了内容推荐精度,而且还扩展了内容覆盖面。     

A hybrid recommendation system considering visual information for predicting favorite restaurants

Restaurant recommendation is one of the most interesting recommendation problems because of its high practicality and rich context. Many works have been proposed to recommend restaurants by considering user preference, restaurant attributes, and socio-demographic behaviors. In addition to these, many customers review restaurants in blog articles where text-based subjective comments and various photos may be available. In this paper, we especially investigate the influence of visual information, i.e., photos taken by customers and put on blogs, on predicting favorite restaurants for any given user. By considering visual information as the intermediate, we will integrate two common recommendation approaches, i.e., content-based filtering and collaborative filtering, and show the effectiveness of considering visual information. More particularly, we advocate that, in addition to text information or metadata, restaurant attributes and user preference can both be represented by visual features. Heterogeneous items can thus be modeled in the same space, and thus two types of recommendation approaches can be linked. Through experiments with various settings, we verify that visual information effectively aids favorite restaurant prediction.     

基于用户偏好特征挖掘的个性化推荐算法

为了提升社交网络个性化推荐能力,结合用户行为分布进行个性化推荐设计,文中提出基于用户行为特征挖掘的个性化推荐算法,构建社交网络的用户行为信息特征挖掘模型,采用显著数据分块检测方法对社交网络用户特征的行为信息进行融合处理,提取反映用户偏好的语义信息特征量。从情感、关键词和结构等方面根据用户行为特征组,结合模糊信息感知方法进行社交网络个性化推荐过程中的信息融合处理,在关联规则约束控制下,构建社交网络用户偏好特征的混合推荐模型,实现用户偏好特征挖掘,根据语义分布和用户的行为偏好实现社交网络的个性化信息推荐。仿真结果表明,采用所提方法进行社交网络个性化推荐的特征分辨能力较好,对用户行为特征的准确识别能力较强,提高了社交网络推荐输出的准确性。     

融合社交关系和标签信息的混合新闻推荐算法

针对传统新闻推荐的数据稀疏性和用户的兴趣爱好快速变化问题,提出了一种融合社交关系和标签信息的混合新闻推荐算法。首先,该算法充分利用社交网络中的社交关系和标签信息;然后使用概率主题模型(latent Dirichlet allocation,LDA)对用户兴趣进行建模;最后采用基于内容与协同过滤相结合的混合推荐算法来完成新闻推荐。实验结果表明,所提算法与已有的推荐算法相比较,在精确度上提升了10.7%、平均倒数排名上(mean reciprocal rank,MRR)提升了4.1%,在归一化折损累计增益(normalized discounted cumulative gain,NDCG)上提升了10%。该算法可在一定程度上提高新闻推荐算法的精度及推荐质量。     

情感分析在电影推荐系统中的应用

基于用户的协同过滤推荐算法是通过分析用户行为寻找相似用户的集合,其核心是用户兴趣模型的建立以及用户间相似度的计算。传统的用户推荐算法是根据用户评分或者物品信息等行为数据进行个性化推荐,准确率比较低。充分考虑在线评论对于用户之间兴趣相似度的作用,通过对评论的情感分析,构建准确的用户兴趣模型,若用户在评论中表现出来的相似度越高,则表示用户之间的兴趣越相似。实验表明,和传统的基于用户的协同过滤推荐算法相比,基于评论情感分析的协同过滤推荐算法,无论准确率还是召回率都有明显提高。     

用户关系和上下文感知的下一个兴趣点推荐

随着移动设备和社交软件的普遍应用,下一个兴趣点推荐（next POI recommendation）变成了基于位置的社交网络（LBSN）的一个非常重要的任务。现实生活中用户访问的下一个兴趣点通常受到用户签到序列信息、用户关系和该地点的上下文信息等诸多方面的影响。基于循环神经网络（RNN）的方法已经被广泛的应用到下一个兴趣点推荐中,但是这些基于RNN的方法缺乏对用户关系进行深入建模。为了解决上述问题,提出了一种整合用户关系和门控循环单元（GRU）进行下一个兴趣点推荐的模型（GRU-R）,同时该模型能够考虑用户签到序列信息、用户关系、兴趣点的时空信息和类别信息等进行下一个兴趣点推荐。在两个真实公开的数据集上进行实验,结果表明提出的模型比现有主流的下一个兴趣点推荐算法具有更高的推荐准确性。     

一种三部图网络中标签时间加权的推荐方法

社会标签可以提供对象高度抽象的内容信息和个性偏好信息,因此标签的使用有助于提高个性推荐的精度.用户的偏好会随时间的变化而变化,网络中的资源也会随着时间推移而增加.如何根据用户兴趣的变化推荐出用户即时感兴趣的网络资源,已成为推荐系统研究的新问题.在用户-标签-对象三部分图网络结构中,结合标签使用频率和用户添加标签的时间,提出了一种利用标签时间加权的资源推荐算法.实验结果表明,利用标签时间加权的算法能有效地提高推荐的精度和多样性.     

Online social trust reinforced personalized recommendation

Recommendation techniques greatly promote the development of online service in the interconnection environment. Personalized recommendation has attracted researchers’ special attention because it is more targeted to individual tasks with the characteristics of diversification and novelty. However, the data sets that personalized recommendation process usually possess the characteristics of data sparseness and information loss, which is more likely to have problems such as cognitive deviation and interest drift. To solve these issues, in recent years people gradually notice the important role in which trust factor plays in promoting the development of personalized recommendation. Given the difference between online social trust and traditional offline social trust in facilitating personalized recommendation, this paper proposes a novel technique of online social trust reinforced personal recommendation to improve the recommendation performance. Compared with traditional offline social trust-based personal recommendation, our work synthesizes both factors of online social trust and offline social trust to identify private and public trusted user communities. The trusted degree or the accredited degree can be deduced by Bayesian network probabilistic inferences. In this way, the performance of personalized recommendation can be improved by avoiding excessive interest deviation. Moreover, we also get time sequence into personal recommendation model to effectively track how user’s interest changes over time. Accordingly, the recommendation accuracy can be improved by eliminating the unfavorable effect of interest drift caused by temporal variation. Empirical experiments on typical Yelp testing data set illustrate the effectiveness of the proposed recommendation technique.     

基于支撑向量机的自适应信息推荐算法

提出一种新的基于支撑向量机的自适应主动推荐算法，该算法将用户模型按照层次化方式组织成领域信息和原子需求信息，考虑多用户同类信息需求，采用支撑向量机对领域信息结点中的原子需求信息进行分类协同推荐。然后再针对每一领域信息节点中的原子信息需求进行基于内容的过滤，最后将所有领域信息需求获得的推荐集按照一定的重要度等级进行推荐．本文所提算法克服了采用单一方法的弊端而使得推荐质量得到了很大的改善，基于标准测试集的测试结果表明该算法在查全率和查准率方面表现出了优越的性能，尤其适合大规模用户的自适应主动信息推荐。