共查询到20条相似文献，搜索用时 46 毫秒
1.
2.
3.
4.
社会标签系统是Web2.0中提出的概念,旨在更好地表达用户的兴趣和意愿。而标签聚类是社会标签系统的个性化推荐中一个重要的研究课题。本文研究了如何基于标签聚类与用户模型来进行个性化推荐的方法。通过计算标签的相似度进行标签聚类,结合用户模型,根据标签聚类结果做出推荐。通过采用CiteULike公布的数据集进行实验证明,与未采用标签聚类的推荐方法相比,本方法不仅可提高推荐的命中率,优化目标资源的排名,而且能为用户发现更多新的感兴趣的资源。 相似文献
5.
《Information processing & management》2020,57(4):102251
The primary aim of location recommendation is to predict users’ future movement by modeling user preference. Multiple types of information have been adopted in profiling users; however, simultaneously combining them for a better recommendation is challenging. In this study, a novel location recommendation method that incorporates geographical, categorical, and social preferences with location popularity is proposed. Experimental results on two public datasets show that the proposed method significantly outperforms two state-of-the-art recommendation methods. Geographical preference generally shows more importance than both categorical and social preferences. A category hierarchy that unleashes the independent assumption of location tags improves categorical preference. Location popularity proves to be a useful metric in ranking candidate locations. The findings of this study can provide practical guidelines for location recommendation services. 相似文献
6.
基于社会标签的推荐系统研究 总被引：1，自引：0，他引：1
社会标签是一种新颖的大众索引方法,在Web 2.0时代各种收藏、检索、共享网站中得到广泛的应用,个性化推荐系统是基于用户的偏好为用户提供个性化信息服务的重要技术。本文针对推荐技术如何与社会标签结合的问题,分析了最新的研究现状和应用。详细阐述了3个方面的研究进展:标签推荐系统的研究、基于社会标签的个性化推荐系统的研究、社会标签的推荐应用系统。 相似文献
7.
8.
《Information processing & management》2022,59(5):103044
Dictionary-based classifiers are an essential group of approaches in the field of time series classification. Their distinctive characteristic is that they transform time series into segments made of symbols (words) and then classify time series using these words. Dictionary-based approaches are suitable for datasets containing time series of unequal length. The prevalence of dictionary-based methods inspired the research in this paper. We propose a new dictionary-based classifier called SAFE. The new approach transforms the raw numeric data into a symbolic representation using the Simple Symbolic Aggregate approXimation (SAX) method. We then partition the symbolic time series into a sequence of words. Then we employ the word embedding neural model known in Natural Language Processing to train the classifying mechanism. The proposed scheme was applied to classify 30 benchmark datasets and compared with a range of state-of-the-art time series classifiers. The name SAFE comes from our observation that this method is safe to use. Empirical experiments have shown that SAFE gives excellent results: it is always in the top 5%–10% when we rank the classification accuracy of state-of-the-art algorithms for various datasets. Our method ranks third in the list of state-of-the-art dictionary-based approaches (after the WEASEL and BOSS methods). 相似文献
9.
《Information processing & management》2005,41(4):987-1002
The authors investigate the frequency distribution of the use of image tags in Web pages. Using data sampled from top level Web pages across five top level domains and from sample pages within individual websites, the authors model observed patterns in the frequency of image tag usage by fitting collected data distributions to different theoretical models used in informetrics. Models tested include the modified power law (MPL), Mandelbrot (MDB), generalized waring (GW), generalized inverse Gaussian–Poisson (GIGP), and generalized negative binomial (GNB) distributions. The GIGP provided the best fit for data sets for top level pages across the top level domains tested. The poor fits of the models to the observed data distributions from specific websites were due to the multimodal nature of the observed data sets. Mixtures of the tested models for the data sets provided better fits. The ability to effectively model Web page attributes, such as the distribution of the number of image tags used per page, is needed for accurate simulation models of Web page content, and makes it possible to estimate the number of requests needed to display the complete content of Web pages. 相似文献
10.
《Information processing & management》2022,59(3):102926
While image-to-image translation has been extensively studied, there are a number of limitations in existing methods designed for transformation between instances of different shapes from different domains. In this paper, a novel approach was proposed (hereafter referred to as ObjectVariedGAN) to handle geometric translation. One may encounter large and significant shape changes during image-to-image translation, especially object transfiguration. Thus, we focus on synthesizing the desired results to maintain the shape of the foreground object without requiring paired training data. Specifically, our proposed approach learns the mapping between source domains and target domains, where the shapes of objects differ significantly. Feature similarity loss is introduced to encourage generative adversarial networks (GANs) to obtain the structure attribute of objects (e.g., object segmentation masks). Additionally, to satisfy the requirement of utilizing unaligned datasets, cycle-consistency loss is combined with context-preserving loss. Our approach feeds the generator with source image(s), incorporated with the instance segmentation mask, and guides the network to generate the desired target domain output. To verify the effectiveness of proposed approach, extensive experiments are conducted on pre-processed examples from the MS-COCO datasets. A comparative summary of the findings demonstrates that ObjectVariedGAN outperforms other competing approaches, in the terms of Inception Score, Frechet Inception Distance, and human cognitive preference. 相似文献
11.
《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. 相似文献
12.
13.
RFID即无线射频识别装置,它是一种非接触式的自动识别技术,通过射频信号自动识别目标对象并获取相关数据,识别工作可以在无人工干预的情况下自助完成。这种技术可工作于各种恶劣环境,既可识别高速运动物体又可同时识别多个标签,设备的操作快捷方便,且适合于各类人群使用。目前这项技术已被应用于图书馆中,也就是自助图书馆系统,为读者提供了完全自主的借还平台,在倡导个性化读者服务的今天使图书馆服务发生了崭新的变化。 相似文献
14.
【目的/意义】通过对大数据环境下的多源用户兴趣特征有效融合,缓解个性化推荐中用户兴趣偏好数据的稀疏性和准确性问题。【方法/过程】考虑到多域的数据权威度、内容质量及体系结构的差异化较为明显,提出了基于多源用户标签的跨域兴趣融合模型,首先把多个域中的用户兴趣进行标签化处理,然后利用跨域用户识别和标签权重归一方法得到多个域的用户实体-标签矩阵,最后使用域权重影响系数对标签进行融合,构造具有复合权重的用户兴趣标签集。【结果/结论】使用5个来源数据域进行实验与分析,融合模型能够有效提高标签用户覆盖效果,在查全率不断提高的情况,融合域能够保持较高的标签用户查准率,有效提高用户兴趣特征的描绘效果。 相似文献
15.
《Information processing & management》2023,60(5):103469
This paper focuses on extracting temporal and parent–child relationships between news events in social news. Previous methods have proved that syntactic features are valid. However, most previous methods directly use the static outcomes parsed by syntactic parsing tools, but task-irrelevant or erroneous parses will inevitably degrade the performance of the model. In addition, many implicit higher-order connections that are directly related and critical to tasks are not explicitly exploited. In this paper, we propose a novel syntax-based dynamic latent graph model (SDLG) for this task. Specifically, we first apply a syntactic type-enhanced attention mechanism to assign different weights to different connections in the parsing results, which helps to filter out noisy connections and better fuse the information in the syntactic structures. Next, we introduce a dynamic event pair-aware induction graph to mine the task-related latent connections. It constructs a potential attention matrix to complement and correct the supervised syntactic features, using the semantics of the event pairs as a guide. Finally, the latent graph, together with the syntactic information, is fed into the graph convolutional network to obtain an improved representation of the event to complete relational reasoning. We have conducted extensive experiments on four public benchmarks, MATRES, TCR, HiEve and TB-Dense. The results show that our model outperforms the state-of-the-art model by 0.4%, 1.5%, 3.0% and 1.3% in F1 scores on the four datasets, respectively. Finally, we provide detailed analyses to show the effectiveness of each proposed component. 相似文献
16.
Within the context of Information Extraction (IE), relation extraction is oriented towards identifying a variety of relation phrases and their arguments in arbitrary sentences. In this paper, we present a clause-based framework for information extraction in textual documents. Our framework focuses on two important challenges in information extraction: 1) Open Information Extraction and (OIE), and 2) Relation Extraction (RE). In the plethora of research that focus on the use of syntactic and dependency parsing for the purposes of detecting relations, there has been increasing evidence of incoherent and uninformative extractions. The extracted relations may even be erroneous at times and fail to provide a meaningful interpretation. In our work, we use the English clause structure and clause types in an effort to generate propositions that can be deemed as extractable relations. Moreover, we propose refinements to the grammatical structure of syntactic and dependency parsing that help reduce the number of incoherent and uninformative extractions from clauses. In our experiments both in the open information extraction and relation extraction domains, we carefully evaluate our system on various benchmark datasets and compare the performance of our work against existing state-of-the-art information extraction systems. Our work shows improved performance compared to the state-of-the-art techniques. 相似文献
17.
《Information processing & management》2022,59(1):102790
Entity alignment is an important task for the Knowledge Graph (KG) completion, which aims to identify the same entities in different KGs. Most of previous works only utilize the relation structures of KGs, but ignore the heterogeneity of relations and attributes of KGs. However, these information can provide more feature information and improve the accuracy of entity alignment. In this paper, we propose a novel Multi-Heterogeneous Neighborhood-Aware model (MHNA) for KGs alignment. MHNA aggregates multi-heterogeneous information of aligned entities, including the entity name, relations, attributes and attribute values. An important contribution is to design a variant attention mechanism, which adds the feature information of relations and attributes to the calculation of attention coefficients. Extensive experiments on three well-known benchmark datasets show that MHNA significantly outperforms 12 state-of-the-art approaches, demonstrating that our approach has good scalability and superiority in both cross-language and monolingual KGs. An ablation study further supports the effectiveness of our variant attention mechanism. 相似文献
18.
《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. 相似文献
19.