66,705 research outputs found

    Granular semantic user similarity in the presence of sparse data

    Get PDF
    Finding similar users in social communities is often challenging, especially in the presence of sparse data or when working with heterogeneous or specialized domains. When computing semantic similarity among users it is desirable to have a measure which allows to compare users w.r.t. any concept in the domain. We propose such a technique which reduces the problems caused by data sparsity, especially in the cold start phase, and enables granular and context-based adaptive suggestions. It allows referring to a certain set of most similar users in relation to a particular concept when a user needs suggestions about a certain topic (e.g. cultural events) and to a possibly completely different set when the user is interested in another topic (e.g. sport events). Our approach first uses a variation of the spreading activation technique to propagate the users’ interests on their corresponding ontology-based user models, and then computes the concept-biased cosine similarity (CBC similarity), a variation of the cosine similarity designed for privileging a particular concept in an ontology. CBC similarity can be used in many adaptation techniques to improve suggestions to users. We include an empirical evaluation on a collaborative filtering algorithm, showing that the CBC similarity works better than the cosine similarity when dealing with sparse data

    Property-based interest propagation in ontology-based user model

    Get PDF
    We present an approach for propagation of user interests in ontology-based user models taking into account the properties declared for the concepts in the ontology. Starting from initial user feedback on an object, we calculate user interest in this particular object and its properties and further propagate user interest to other objects in the ontology, similar or related to the initial object. The similarity and relatedness of objects depends on the number of properties they have in common and their corresponding values. The approach we propose can support finer recommendation modalities, considering the user interest in the objects, as well as in singular properties of objects in the recommendation process. We tested our approach for interest propagation with a real adaptive application and obtained an improvement with respect to IS-A-propagation of interest values

    User-adaptive sketch-based 3D CAD model retrieval

    Get PDF
    3D CAD models are an important digital resource in the manufacturing industry. 3D CAD model retrieval has become a key technology in product lifecycle management enabling the reuse of existing design data. In this paper, we propose a new method to retrieve 3D CAD models based on 2D pen-based sketch inputs. Sketching is a common and convenient method for communicating design intent during early stages of product design, e.g., conceptual design. However, converting sketched information into precise 3D engineering models is cumbersome, and much of this effort can be avoided by reuse of existing data. To achieve this purpose, we present a user-adaptive sketch-based retrieval method in this paper. The contributions of this work are twofold. Firstly, we propose a statistical measure for CAD model retrieval: the measure is based on sketch similarity and accounts for users’ drawing habits. Secondly, for 3D CAD models in the database, we propose a sketch generation pipeline that represents each 3D CAD model by a small yet sufficient set of sketches that are perceptually similar to human drawings. User studies and experiments that demonstrate the effectiveness of the proposed method in the design process are presented

    Using Markov Chains for link prediction in adaptive web sites

    Get PDF
    The large number of Web pages on many Web sites has raised navigational problems. Markov chains have recently been used to model user navigational behavior on the World Wide Web (WWW). In this paper, we propose a method for constructing a Markov model of a Web site based on past visitor behavior. We use the Markov model to make link predictions that assist new users to navigate the Web site. An algorithm for transition probability matrix compression has been used to cluster Web pages with similar transition behaviors and compress the transition matrix to an optimal size for efficient probability calculation in link prediction. A maximal forward path method is used to further improve the efficiency of link prediction. Link prediction has been implemented in an online system called ONE (Online Navigation Explorer) to assist users' navigation in the adaptive Web site

    NewsMe: A case study for adaptive news systems with open user model

    Get PDF
    Adaptive news systems have become important in recent years. A lot of work has been put into developing these adaptation processes. We describe here an adaptive news system application, which uses an open user model and allow users to manipulate their interest profiles. We also present a study of the system. Our results showed that user profile manipulation should be used with caution. © 2007 IEEE
    • …
    corecore