scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Parallel proactive cross domain context aware recommender system

01 Jan 2018-Journal of Intelligent and Fuzzy Systems (IOS Press)-Vol. 34, Iss: 3, pp 1521-1533
About: This article is published in Journal of Intelligent and Fuzzy Systems.The article was published on 2018-01-01. It has received 6 citations till now. The article focuses on the topics: Domain (software engineering) & Context (language use).
Citations
More filters
Journal ArticleDOI
TL;DR: In this article, the authors formalize the combination of cross-domain recommendation and context-aware recommendation, which represents a more systematic integration of these approaches compared to previous work, and developed novel RSs techniques, named CD-CARS.
Abstract: In this paper, we address two research topics in Recommender Systems (RSs) which have been developed in parallel without a deeper integration: Cross-Domain RS (CDRS) and Context-Aware RS (CARS). CDRS have emerged to enhance the quality of recommendations in a target domain by leveraging sources of information in different domains. CDRS are especially useful to address cold-start, sparsity and diversity problems in target domains with scarce information. CARS, on its turn, have been proposed to consider contextual information for recommendations. Such systems are suitable when the users’ interests change according to factors like time, location, among others. By combining these two approaches, better RSs can be developed, considering both the availability of useful data from multiple domains and the use of contextual information. In this paper, we formalize the combination of CDRS and CARS, which represents a more systematic integration of these approaches compared to previous work. Based on this formulation, we developed novel RSs techniques, named CD-CARS. To evaluate the developed CD-CARS techniques, we performed extensive experimentation through real datasets taking into account several scenarios. The recommendations were evaluated in terms of predictive and ranking performance, respectively achieving up to 62.6% and 45%, depending on the scenario, in comparison to traditional cross-domain collaborative filtering techniques. Therefore, the experimental results have shown that the integration of techniques developed in isolation can be useful in a variety of situations, in which recommendations can be improved by information gathered from different sources and can be refined by considering specific contextual information.

13 citations

Book ChapterDOI
29 Oct 2019
TL;DR: In this article, the authors analyzed the proactivity concept and examples of voice assistants that incorporate proactive behaviours in the context of the television ecosystem and found that there is a lack of systems presenting a real proactive behaviour able to assist users in a television context.
Abstract: Intelligent Personal Assistants (IPAs) are increasingly present in people’s daily lives, with natural language interaction allowed by voice assistants improving the user experience. In the television ecosystem, the integration of voice assistants is also enabling the interaction with media devices in a globally more satisfying way. Additionally, the inclusion of proactive behaviours is considered to be one of the critical factors for the improvement of the user experience. To better understand this dimension of voice assistants, the present article analyses the proactivity concept and examples of voice assistants that incorporate proactive behaviours. Also, voice assistants have been analysed in the television ecosystem and it was realized a lack of systems presenting a real proactive behaviour able to assist users in a television context.

3 citations

Journal ArticleDOI
TL;DR: This work has proposed a model that generates serendipitous item recommendation and also takes care of accuracy as well as the sparsity issues, and fuzzy inference based approach is used for theserendipity computation.
Abstract: Recommender System (RS) is an information filtering approach that helps the overburdened user with information in his decision making process and suggests items which might be interesting to him. While presenting recommendation to the user, accuracy of the presented list is always a concern for the researchers. However, in recent years, the focus has now shifted to include the unexpectedness and novel items in the list along with accuracy of the recommended items. To increase the user acceptance, it is important to provide potentially interesting items which are not so obvious and different from the items that the end user has rated. In this work, we have proposed a model that generates serendipitous item recommendation and also takes care of accuracy as well as the sparsity issues. Literature suggests that there are various components that help to achieve the objective of serendipitous recommendations. In this paper, fuzzy inference based approach is used for the serendipity computation because the definitions of the components overlap. Moreover, to improve the accuracy and sparsity issues in the recommendation process, cross domain and trust based approaches are incorporated. A prototype of the system is developed for the tourism domain and the performance is measured using mean absolute error (MAE), root mean square error (RMSE), unexpectedness, precision, recall and F-measure.

1 citations

Journal ArticleDOI
TL;DR: The aim of this special issue is to discuss various aspects and recent advances in the area of intelligent systems technologies and applications as decision support considers the state of art of eye gaze features to understand cognitive processing.
Abstract: The aim of this special issue is to discuss various 10 aspects and recent advances in the area of intelligent 11 systems technologies and applications. The 50 papers 12 were selected after a rigorous peer-review and rec13 ommendation of the guest editors. The special issue 14 covers various topics such as computational intel15 ligence, pattern recognition, machine learning, and 16 their applications to a wide spectrum of domains 17 including healthcare [1–10]; image processing, com18 puter vision, and biometrics [11–18], social media, 19 document analysis, natural language processing, and 20 recommendation systems [19–27]; security, informa21 tion hiding, and safety [28–35]; cloud computing 22 services and management [36–38]; energy, control, 23 industrial, and other applications [39–50]. 24 Intelligent-Based Decision Support System for 25 Diagnosing Glaucoma in Primary Eye Care Centers 26 Using Eye Tracker [1]: It is quite alarming that the 27 increase of glaucoma is due to the lack of awareness 28 of the disease and the cost for glaucoma screening. 29 The primary eye care centers need to include a com30 prehensive glaucoma screening and include machine 31 learning models to enhance screening as decision 32 support system. The proposed system considers the 33

1 citations


Cites background from "Parallel proactive cross domain con..."

  • ...In [27], a parallel proactive cross-domain recommender system that helps to accelerate the computation in the multi-agent environment is proposed....

    [...]

References
More filters
Proceedings ArticleDOI
01 Apr 2001
TL;DR: This paper analyzes item-based collaborative ltering techniques and suggests that item- based algorithms provide dramatically better performance than user-based algorithms, while at the same time providing better quality than the best available userbased algorithms.
Abstract: Recommender systems apply knowledge discovery techniques to the problem of making personalized recommendations for information, products or services during a live interaction. These systems, especially the k-nearest neighbor collaborative ltering based ones, are achieving widespread success on the Web. The tremendous growth in the amount of available information and the number of visitors to Web sites in recent years poses some key challenges for recommender systems. These are: producing high quality recommendations, performing many recommendations per second for millions of users and items and achieving high coverage in the face of data sparsity. In traditional collaborative ltering systems the amount of work increases with the number of participants in the system. New recommender system technologies are needed that can quickly produce high quality recommendations, even for very large-scale problems. To address these issues we have explored item-based collaborative ltering techniques. Item-based techniques rst analyze the user-item matrix to identify relationships between di erent items, and then use these relationships to indirectly compute recommendations for users. In this paper we analyze di erent item-based recommendation generation algorithms. We look into di erent techniques for computing item-item similarities (e.g., item-item correlation vs. cosine similarities between item vectors) and di erent techniques for obtaining recommendations from them (e.g., weighted sum vs. regression model). Finally, we experimentally evaluate our results and compare them to the basic k-nearest neighbor approach. Our experiments suggest that item-based algorithms provide dramatically better performance than user-based algorithms, while at the same time providing better quality than the best available userbased algorithms.

8,634 citations

Journal Article
TL;DR: This work compares three common approaches to solving the recommendation problem: traditional collaborative filtering, cluster models, and search-based methods, and their algorithm, which is called item-to-item collaborative filtering.
Abstract: Recommendation algorithms are best known for their use on e-commerce Web sites, where they use input about a customer's interests to generate a list of recommended items. Many applications use only the items that customers purchase and explicitly rate to represent their interests, but they can also use other attributes, including items viewed, demographic data, subject interests, and favorite artists. At Amazon.com, we use recommendation algorithms to personalize the online store for each customer. The store radically changes based on customer interests, showing programming titles to a software engineer and baby toys to a new mother. There are three common approaches to solving the recommendation problem: traditional collaborative filtering, cluster models, and search-based methods. Here, we compare these methods with our algorithm, which we call item-to-item collaborative filtering. Unlike traditional collaborative filtering, our algorithm's online computation scales independently of the number of customers and number of items in the product catalog. Our algorithm produces recommendations in real-time, scales to massive data sets, and generates high quality recommendations.

4,788 citations

Journal ArticleDOI
TL;DR: Item-to-item collaborative filtering (ITF) as mentioned in this paper is a popular recommendation algorithm for e-commerce Web sites that scales independently of the number of customers and number of items in the product catalog.
Abstract: Recommendation algorithms are best known for their use on e-commerce Web sites, where they use input about a customer's interests to generate a list of recommended items. Many applications use only the items that customers purchase and explicitly rate to represent their interests, but they can also use other attributes, including items viewed, demographic data, subject interests, and favorite artists. At Amazon.com, we use recommendation algorithms to personalize the online store for each customer. The store radically changes based on customer interests, showing programming titles to a software engineer and baby toys to a new mother. There are three common approaches to solving the recommendation problem: traditional collaborative filtering, cluster models, and search-based methods. Here, we compare these methods with our algorithm, which we call item-to-item collaborative filtering. Unlike traditional collaborative filtering, our algorithm's online computation scales independently of the number of customers and number of items in the product catalog. Our algorithm produces recommendations in real-time, scales to massive data sets, and generates high quality recommendations.

4,372 citations

Journal ArticleDOI
TL;DR: This special section includes descriptions of five recommender systems, which provide recommendations as inputs, which the system then aggregates and directs to appropriate recipients, and which combine evaluations with content analysis.
Abstract: Recommender systems assist and augment this natural social process. In a typical recommender system people provide recommendations as inputs, which the system then aggregates and directs to appropriate recipients. In some cases the primary transformation is in the aggregation; in others the system’s value lies in its ability to make good matches between the recommenders and those seeking recommendations. The developers of the first recommender system, Tapestry [1], coined the phrase “collaborative filtering” and several others have adopted it. We prefer the more general term “recommender system” for two reasons. First, recommenders may not explictly collaborate with recipients, who may be unknown to each other. Second, recommendations may suggest particularly interesting items, in addition to indicating those that should be filtered out. This special section includes descriptions of five recommender systems. A sixth article analyzes incentives for provision of recommendations. Figure 1 places the systems in a technical design space defined by five dimensions. First, the contents of an evaluation can be anything from a single bit (recommended or not) to unstructured textual annotations. Second, recommendations may be entered explicitly, but several systems gather implicit evaluations: GroupLens monitors users’ reading times; PHOAKS mines Usenet articles for mentions of URLs; and Siteseer mines personal bookmark lists. Third, recommendations may be anonymous, tagged with the source’s identity, or tagged with a pseudonym. The fourth dimension, and one of the richest areas for exploration, is how to aggregate evaluations. GroupLens, PHOAKS, and Siteseer employ variants on weighted voting. Fab takes that one step further to combine evaluations with content analysis. ReferralWeb combines suggested links between people to form longer referral chains. Finally, the (perhaps aggregated) evaluations may be used in several ways: negative recommendations may be filtered out, the items may be sorted according to numeric evaluations, or evaluations may accompany items in a display. Figures 2 and 3 identify dimensions of the domain space: The kinds of items being recommended and the people among whom evaluations are shared. Consider, first, the domain of items. The sheer volume is an important variable: Detailed textual reviews of restaurants or movies may be practical, but applying the same approach to thousands of daily Netnews messages would not. Ephemeral media such as netnews (most news servers throw away articles after one or two weeks) place a premium on gathering and distributing evaluations quickly, while evaluations for 19th century books can be gathered at a more leisurely pace. The last dimension describes the cost structure of choices people make about the items. Is it very costly to miss IT IS OFTEN NECESSARY TO MAKE CHOICES WITHOUT SUFFICIENT personal experience of the alternatives. In everyday life, we rely on

3,993 citations

Proceedings ArticleDOI
11 Aug 2008
TL;DR: Presents a collection of slides covering the following topics: CUDA parallel programming model; CUDA toolkit and libraries; performance optimization; and application development.
Abstract: The advent of multicore CPUs and manycore GPUs means that mainstream processor chips are now parallel systems. Furthermore, their parallelism continues to scale with Moore's law. The challenge is to develop mainstream application software that transparently scales its parallelism to leverage the increasing number of processor cores, much as 3D graphics applications transparently scale their parallelism to manycore GPUs with widely varying numbers of cores.

2,216 citations