共查询到20条相似文献，搜索用时 15 毫秒
1.
《Information processing & management》2016,52(3):459-477
Nowadays, the increasing demand for group recommendations can be observed. In this paper we address the problem of recommendation performance for groups of users (group recommendation). We focus on the performance of very Top-N recommendations, which are important when recommending the long lasting items (only a few such items are consumed per session, e.g. movie). To improve existing group recommenders we propose a mixed hybrid recommender for groups combining content-based and collaborative strategies. The principle of proposed group recommender is to generate content and collaborative recommendations for each user, apply an aggregation strategy to solve the group conflict preferences for the content and collaborative sets separately, and finally reorder the collaborative candidates based on the content-based ones. It is based on an idea that candidates recommended by both recommendation strategies at the same time are presumably more appropriate for the group than the candidates recommended by individual strategies. The evaluation is performed by several experiments in the multimedia domain (as typical representative for group recommendations). Both, online and offline experiments were performed in order to compare real users’ satisfaction to the standard group recommenders and also, to compare performance of proposed approach to the state-of-the-art recommenders based on the MovieLens dataset. Finally, we experimented with the proposed hybrid recommender to generate the recommendation for a group of size one (i.e. single user recommendation). Obtained results, support our hypothesis that proposed mixed hybrid approach improves the precision of the recommendation for groups of users and for the single-user recommendation respectively on very Top-N recommended items. 相似文献
2.
A group recommendation system for online communities 总被引：1，自引：0，他引：1
Jae Kyeong Kim Hyea Kyeong Kim Hee Young Oh Young U. Ryu 《International Journal of Information Management》2010
Online communities are virtual spaces over the Internet in which a group of people with similar interests or purposes interact with others and share information. To support group activities in online communities, a group recommendation procedure is needed. Though there have been attempts to establish group recommendation, they focus on off-line environments. Further, aggregating individuals’ preferences into a group preference or merging individual recommendations into group recommendations—an essential component of group recommendation—often results in dissatisfaction of a small number of group members while satisfying the majority. To support group activities in online communities, this paper proposes an improved group recommendation procedure that improves not only the group recommendation effectiveness but also the satisfaction of individual group members. It consists of two phases. The first phase was to generate a recommendation set for a group using the typical collaborative filtering method that most existing group recommendation systems utilize. The second phase was to remove irrelevant items from the recommendation set in order to improve satisfaction of individual members’ preferences. We built a prototype system and performed experiments. Our experiment results showed that the proposed system has consistently higher precision and individual members are more satisfied. 相似文献
3.
《Information processing & management》2022,59(2):102861
Integrating useful input information is essential to provide efficient recommendations to users. In this work, we focus on improving items ratings prediction by merging both multiple contexts and multiple criteria based research directions which were addressed separately in most existent literature. Throughout this article, Criteria refer to the items attributes, while Context denotes the circumstances in which the user uses an item. Our goal is to capture more fine grained preferences to improve items recommendation quality using users’ multiple criteria ratings under specific contextual situations. Therefore, we examine the recommenders’ data from the graph theory based perspective by representing three types of entities (users, contextual situations and criteria) as well as their relationships as a tripartite graph. Upon the assumption that contextually similar users tend to have similar interests for similar item criteria, we perform a high-order co-clustering on the tripartite graph for simultaneously partitioning the graph entities representing users in similar contextual situations and their evaluated item criteria. To predict cluster-based multi-criteria ratings, we introduce an improved rating prediction method that considers the dependency between users and their contextual situations, and also takes into account the correlation between criteria in the prediction process. The predicted multi-criteria ratings are finally aggregated into a single representative output corresponding to an overall item rating. To guide our investigation, we create a research hypothesis to provide insights about the tripartite graph partitioning and design clear and justified preliminary experiments including quantitative and qualitative analyzes to validate it. Further thorough experiments on the two available context-aware multi-criteria datasets, TripAdvisor and Educational, demonstrate that our proposal exhibits substantial improvements over alternative recommendations approaches. 相似文献
4.
《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. 相似文献
5.
Popularity bias is an undesirable phenomenon associated with recommendation algorithms where popular items tend to be suggested over long-tail ones, even if the latter would be of reasonable interest for individuals. Such intrinsic tendencies of the recommenders may lead to producing ranked lists, in which items are not equally covered along the popularity tail. Although some recent studies aim to detect such biases of traditional algorithms and treat their effects on recommendations, the concept of popularity bias remains elusive for group recommender systems. Therefore, in this study, we focus on investigating popularity bias from the view of group recommender systems, which aggregate individual preferences to achieve recommendations for groups of users. We analyze various state-of-the-art aggregation techniques utilized in group recommender systems regarding their bias towards popular items. To counteract possible popularity issues in group recommendations, we adapt a traditional re-ranking approach that weighs items inversely proportional to their popularity within a group. Also, we propose a novel popularity bias mitigation procedure that re-ranks items by incorporating their popularity level and estimated group ratings in two distinct strategies. The first one aims to penalize popular items during the aggregation process highly and avoids bias better, while the second one puts more emphasis on group ratings than popularity and achieves a more balanced performance regarding conflicting goals of mitigating bias and boosting accuracy. Experiments performed on four real-world benchmark datasets demonstrate that both strategies are more efficient than the adapted approach, and empowering aggregation techniques with one of these strategies significantly decreases their bias towards popular items while maintaining reasonable ranking accuracy. 相似文献
6.
《Information processing & management》2022,59(1):102719
When a recommender system suggests items to the end-users, it gives a certain exposure to the providers behind the recommended items. Indeed, the system offers a possibility to the items of those providers of being reached and consumed by the end-users. Hence, according to how recommendation lists are shaped, the experience of under-recommended providers in online platforms can be affected. To study this phenomenon, we focus on movie and book recommendation and enrich two datasets with the continent of production of an item. We use this data to characterize imbalances in the distribution of the user–item observations and regarding where items are produced (geographic imbalance). To assess if recommender systems generate a disparate impact and (dis)advantage a group, we divide items into groups, based on their continent of production, and characterize how represented is each group in the data. Then, we run state-of-the-art recommender systems and measure the visibility and exposure given to each group. We observe disparities that favor the most represented groups. We overcome these phenomena by introducing equity with a re-ranking approach that regulates the share of recommendations given to the items produced in a continent (visibility) and the positions in which items are ranked in the recommendation list (exposure), with a negligible loss in effectiveness, thus controlling fairness of providers coming from different continents. A comparison with the state of the art shows that our approach can provide more equity for providers, both in terms of visibility and of exposure. 相似文献
7.
8.
《Information processing & management》2020,57(2):102153
Social applications foster the involvement of end users in Web content creation, as a result of which a new source of vast amounts of data about users and their likes and dislikes has become available. Having access to users’ contributions to social sites and gaining insights into the consumers’ needs is of the utmost importance for marketing decision making in general, and to advertisement recommendation in particular. By analyzing this information, advertisement recommendation systems can attain a better understanding of the users’ interests and preferences, thus allowing these solutions to provide more precise ad suggestions. However, in addition to the already complex challenges that hamper the performance of recommender systems (i.e., data sparsity, cold-start, diversity, accuracy and scalability), new issues that should be considered have also emerged from the need to deal with heterogeneous data gathered from disparate sources. The technologies surrounding Linked Data and the Semantic Web have proved effective for knowledge management and data integration. In this work, an ontology-based advertisement recommendation system that leverages the data produced by users in social networking sites is proposed, and this approach is substantiated by a shared ontology model with which to represent both users’ profiles and the content of advertisements. Both users and advertisement are represented by means of vectors generated using natural language processing techniques, which collect ontological entities from textual content. The ad recommender framework has been extensively validated in a simulated environment, obtaining an aggregated f-measure of 79.2% and a Mean Average Precision at 3 (MAP@3) of 85.6%. 相似文献
9.
10.
《Information processing & management》2023,60(1):103139
Conversational Recommendation Systems (CRSs) have recently started to leverage pretrained language models (LM) such as BERT for their ability to semantically interpret a wide range of preference statement variations. However, pretrained LMs are prone to intrinsic biases in their training data, which may be exacerbated by biases embedded in domain-specific language data (e.g., user reviews) used to fine-tune LMs for CRSs. We study a simple LM-driven recommendation backbone (termed LMRec) of a CRS to investigate how unintended bias — i.e., bias due to language variations such as name references or indirect indicators of sexual orientation or location that should not affect recommendations — manifests in substantially shifted price and category distributions of restaurant recommendations. For example, offhand mention of names associated with the black community substantially lowers the price distribution of recommended restaurants, while offhand mentions of common male-associated names lead to an increase in recommended alcohol-serving establishments. While these results raise red flags regarding a range of previously undocumented unintended biases that can occur in LM-driven CRSs, there is fortunately a silver lining: we show that train side masking and test side neutralization of non-preferential entities nullifies the observed biases without significantly impacting recommendation performance. 相似文献
11.
12.
Martin Hoegl 《Research Policy》2004,33(8):1153-1165
Innovation teams vary in terms of team members’ proximity, i.e., the degree to which all team members are in direct vicinity over the duration of the project. The proximity of team members, however, has potentially important implications for the collaborative working of teams. In this paper, we develop and test hypotheses relating team members’ proximity to the performance-relevant team collaborative processes included in Hoegl and Gemuenden's [Organization Science 12 (4) (2001) 435] teamwork quality framework, i.e., communication, coordination, balance of member contributions, mutual support, effort, and cohesion. Using data from 430 team members and team leaders of 145 software development teams, the results of the regression models show that team members’ proximity is significantly related to teamwork quality. However, the magnitude of the relationship between proximity and teamwork quality varies among the six facets of teamwork quality. Theoretical and practical implications are discussed. 相似文献
13.
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. 相似文献
14.
《Information processing & management》2019,56(3):526-540
Recommender Systems deal with the issue of overloading information by retrieving the most relevant sources in the wide range of web services. They help users by predicting their interests in many domains like e-government, social networks, e-commerce and entertainment. Collaborative Filtering (CF) is the most promising technique used in recommender systems to give suggestions based on liked-mind users’ preferences. Despite the widespread use of CF in providing personalized recommendation, this technique has problems including cold start, data sparsity and gray sheep. Eventually, these problems lead to the deterioration of the efficiency of CF. Most existing recommendation methods have been proposed to overcome the problems of CF. However, they fail to suggest the top-n recommendations based on the sequencing of the users’ priorities. In this research, to overcome the shortcomings of CF and current recommendation methods in ranking preference dataset, we have used a new graph-based structure to model the users’ priorities and capture the association between users and items. Users’ profiles are created based on their past and current interest. This is done because their interest can change with time. Our proposed algorithm keeps the preferred items of active user at the beginning of the recommendation list. This means these items come under top-n recommendations, which results in satisfaction among users. The experimental results demonstrate that our algorithm archives the significant improvement in comparison with CF and other proposed recommendation methods in terms of recall, precision, f-measure and MAP metrics using two benchmark datasets including MovieLens and Superstore. 相似文献
15.
Vreixo Formoso Diego Fernández Fidel Cacheda Victor Carneiro 《Information processing & management》2013
Collaborative Filtering techniques have become very popular in the last years as an effective method to provide personalized recommendations. They generally obtain much better accuracy than other techniques such as content-based filtering, because they are based on the opinions of users with tastes or interests similar to the user they are recommending to. However, this is precisely the reason of one of its main limitations: the cold-start problem. That is, how to recommend new items, not yet rated, or how to offer good recommendations to users they have not information about. For example, because they have recently joined the system. In fact, the new user problem is particularly serious, because an unsatisfied user may stop using the system before it could even collect enough information to generate good recommendations. In this article we tackle this problem with a novel approach called “profile expansion”, based on the query expansion techniques used in Information Retrieval. In particular, we propose and evaluate three kinds of techniques: item-global, item-local and user-local. The experiments we have performed show that both item-global and user-local offer outstanding improvements in precision, up to 100%. Moreover, the improvements are statistically significant and consistent among different movie recommendation datasets and several training conditions. 相似文献
16.
《Information processing & management》2020,57(1):102078
Ever since the beginning of civilization, travel for various causes exists as an essential part of human life so as travel recommendations, though the early form of recommendations were the accrued experiences shared by the community. Modern recommender systems evolved along with the growth of Information Technology and are contributing to all industry and service segments inclusive of travel and tourism. The journey started with generic recommender engines which gave way to personalized recommender systems and further advanced to contextualized personalization with advent of artificial intelligence. Current era is also witnessing a boom in social media usage and the social media big data is acting as a critical input for various analytics with no exception for recommender systems. This paper details about the study conducted on the evolution of travel recommender systems, their features and current set of limitations. We also discuss on the key algorithms being used for classification and recommendation processes and metrics that can be used to evaluate the performance of the algorithms and thereby the recommenders. 相似文献
17.
With the expansion of information on the web, recommendation systems have become one of the most powerful resources to ease the task of users. Traditional recommendation systems (RS) suggest items based only on feedback submitted by users in form of ratings. These RS are not competent to deal with definite user preferences due to emerging and situation dependent user-generated content on social media, these situations are known as contextual dimensions. Though the relationship between contextual dimensions and user’s preferences has been demonstrated in various studies, only a few studies have explored about prioritization of varying contextual dimensions. The usage of all contextual dimensions unnecessary raises the computational complexity and negatively influences the recommendation results. Thus, the initial impetus has been made to construct a neural network in order to determine the pertinent contextual dimensions. The experiments are conducted on real-world movies data-LDOS CoMoDa dataset. The results of neural networks demonstrate that contextual dimensions have a significant effect on users’ preferences which in turn exerts an intense impact on the satisfaction level of users. Finally, tensor factorization model is employed to evaluate and validate accuracy by including neural network’s identified pertinent dimensions which are modeled as tensors. The result shows improvement in recommendation accuracy by a wider margin due to the inclusion of the pertinent dimensions in comparison to irrelevant dimensions. The theoretical and managerial implications are discussed. 相似文献
18.
Modeling user profiles is a necessary step for most information filtering systems – such as recommender systems – to provide personalized recommendations. However, most of them work with users or items as vectors, by applying different types of mathematical operations between them and neglecting sequential or content-based information. Hence, in this paper we study how to propose an adaptive mechanism to obtain user sequences using different sources of information, allowing the generation of hybrid recommendations as a seamless, transparent technique from the system viewpoint. As a proof of concept, we develop the Longest Common Subsequence (LCS) algorithm as a similarity metric to compare the user sequences, where, in the process of adapting this algorithm to recommendation, we include different parameters to control the efficiency by reducing the information used in the algorithm (preference filter), to decide when a neighbor is considered useful enough to be included in the process (confidence filter), to identify whether two interactions are equivalent (δ-matching threshold), and to normalize the length of the LCS in a bounded interval (normalization functions). These parameters can be extended to work with any type of sequential algorithm.We evaluate our approach with several state-of-the-art recommendation algorithms using different evaluation metrics measuring the accuracy, diversity, and novelty of the recommendations, and analyze the impact of the proposed parameters. We have found that our approach offers a competitive performance, outperforming content, collaborative, and hybrid baselines, and producing positive results when either content- or rating-based information is exploited. 相似文献
19.
A critical challenge for Web search engines concerns how they present relevant results to searchers. The traditional approach is to produce a ranked list of results with title and summary (snippet) information, and these snippets are usually chosen based on the current query. Snippets play a vital sensemaking role, helping searchers to efficiently make sense of a collection of search results, as well as determine the likely relevance of individual results. Recently researchers have begun to explore how snippets might also be adapted based on searcher preferences as a way to better highlight relevant results to the searcher. In this paper we focus on the role of snippets in collaborative web search and describe a technique for summarizing search results that harnesses the collaborative search behaviour of communities of like-minded searchers to produce snippets that are more focused on the preferences of the searchers. We go on to show how this so-called social summarization technique can generate summaries that are significantly better adapted to searcher preferences and describe a novel personalized search interface that combines result recommendation with social summarization. 相似文献
20.
This paper reports on the findings from a longitudinal case study exploring Kuhlthau’s information search process (ISP)-model in a group based academic setting. The research focus is on group members’ activities and cognitive and emotional experiences during the task process of writing an assignment. It is investigated if group members’ information behavior differ from the individual information seeker in the ISP-model and to what extent this behavior is influenced by contextual (work task) and social (group work) factors. Three groups of LIS students were followed during a 14 weeks period in 2004/2005 (10 participants). Quantitative and qualitative methods were employed, such as demographic surveys, process surveys, diaries and interviews. Similarities in behavior were found between group members and the individual in Kuhlthau’s ISP-model with regard to the general stages of information seeking, the cognitive pattern associated with focus formulation and the tendency towards an increase in writing activities while searching activities decreased. Differences in behavior were also found, which were associated with contextual and social factors beyond the mere search process. It is concluded that the ISP-model does not fully comply with group members’ problem solving process and the involved information seeking behavior. Further, complex academic problem solving seems to be even more complex when it is performed in a group based setting. The study contributes with a new conceptual understanding of students’ behavior in small groups. 相似文献