6,574 research outputs found

    Personalized Ranking for Context-Aware Venue Suggestion

    Full text link
    Making personalized and context-aware suggestions of venues to the users is very crucial in venue recommendation. These suggestions are often based on matching the venues' features with the users' preferences, which can be collected from previously visited locations. In this paper we present a novel user-modeling approach which relies on a set of scoring functions for making personalized suggestions of venues based on venues content and reviews as well as users context. Our experiments, conducted on the dataset of the TREC Contextual Suggestion Track, prove that our methodology outperforms state-of-the-art approaches by a significant margin.Comment: The 32nd ACM SIGAPP Symposium On Applied Computing (SAC), Marrakech, Morocco, April 4-6, 201

    Spatio-semantic user profiles in location-based social networks

    Get PDF
    Knowledge of usersā€™ visits to places is one of the keys to understanding their interest in places. User-contributed annotations of place, the types of places they visit, and the activities they carry out, add a layer of important semantics that, if considered, can result in more refined representations of user profiles. In this paper, semantic information is summarised as tags for places and a folksonomy data model is used to represent spatial and semantic relationships between users, places, and tags. The model allows simple co-occurrence methods and similarity measures to be applied to build different views of personalised user profiles. Basic profiles capture direct user interactions, while enriched profiles offer an extended view of usersā€™ association with places and tags that take into account relationships in the folksonomy. The main contributions of this work are the proposal of a uniform approach to the creation of user profiles on the Social Web that integrates both the spatial and semantic components of user-provided information, and the demonstration of the effectiveness of this approach with realistic datasets

    Evaluating the Legacy Careers Project.

    Get PDF
    The Legacy Careers Project was a five day programme of career enrichment activities for schools in East London. The programme ran from June to December 2013 with students moving from Year 8 to Year 9. It provided information and activities to support students to better understand their future career options. The project takes its inspiration from the Olympic Games and is informed by the opportunities offered by Queen Elizabeth Olympic Park. This paper sets out the findings of an evaluation of the project conducted by the International Centre for Guidance Studies. The evaluation concludes that the project was successful. Evaluators noted the delivery of an effective and coherent career learning programme that aligned well with best practice in the sector. Key indicators of success are as follows: ā€¢ Students who participated in the programme reported that they enjoyed the experience and found it useful; ā€¢ A high level of learning could be observed throughout the programme; ā€¢ Students reported that they had developed their skills and attributes through the programme; ā€¢ There was evidence of greater purposefulness in thinking about their next career destination; ā€¢ The programme exceeded the initial target of 200 participants by providing 770 students (year 8, moving to year 9) and an additional 70 team leaders (year 12) with career enrichment activities outside of the classroom; ā€¢ There was a high level of positive engagement from the schools involved in the programme; and ā€¢ The programme also provided opportunities for a group of sixth form team leaders. These students also reported improvements in their self-confidence (53%), leadership skills (47%) and other skills and attributes.London Legacy Development Corporatio

    CHORUS Deliverable 4.5: Report of the 3rd CHORUS Conference

    Get PDF
    The third and last CHORUS conference on Multimedia Search Engines took place from the 26th to the 27th of May 2009 in Brussels, Belgium. About 100 participants from 15 European countries, the US, Japan and Australia learned about the latest developments in the domain. An exhibition of 13 stands presented 16 research projects currently ongoing around the world

    Using association rule mining to enrich semantic concepts for video retrieval

    Get PDF
    In order to achieve true content-based information retrieval on video we should analyse and index video with high-level semantic concepts in addition to using user-generated tags and structured metadata like title, date, etc. However the range of such high-level semantic concepts, detected either manually or automatically, usually limited compared to the richness of information content in video and the potential vocabulary of available concepts for indexing. Even though there is work to improve the performance of individual concept classiļ¬ers, we should strive to make the best use of whatever partial sets of semantic concept occurrences are available to us. We describe in this paper our method for using association rule mining to automatically enrich the representation of video content through a set of semantic concepts based on concept co-occurrence patterns. We describe our experiments on the TRECVid 2005 video corpus annotated with the 449 concepts of the LSCOM ontology. The evaluation of our results shows the usefulness of our approach

    Detecting outlier patterns with query-based artificially generated searching conditions

    Get PDF
    In the age of social computing, finding interesting network patterns or motifs is significant and critical for various areas, such as decision intelligence, intrusion detection, medical diagnosis, social network analysis, fake news identification, and national security. However, subgraph matching remains a computationally challenging problem, let alone identifying special motifs among them. This is especially the case in large heterogeneous real-world networks. In this article, we propose an efficient solution for discovering and ranking human behavior patterns based on network motifs by exploring a user's query in an intelligent way. Our method takes advantage of the semantics provided by a user's query, which in turn provides the mathematical constraint that is crucial for faster detection. We propose an approach to generate query conditions based on the user's query. In particular, we use meta paths between the nodes to define target patterns as well as their similarities, leading to efficient motif discovery and ranking at the same time. The proposed method is examined in a real-world academic network using different similarity measures between the nodes. The experiment result demonstrates that our method can identify interesting motifs and is robust to the choice of similarity measures. Ā© 2014 IEEE

    Detecting Outlier Patterns with Query-based Artificially Generated Searching Conditions

    Get PDF
    In the age of social computing, finding interesting network patterns or motifs is significant and critical for various areas such as decision intelligence, intrusion detection, medical diagnosis, social network analysis, fake news identification, national security, etc. However, sub-graph matching remains a computationally challenging problem, let alone identifying special motifs among them. This is especially the case in large heterogeneous real-world networks. In this work, we propose an efficient solution for discovering and ranking human behavior patterns based on network motifs by exploring a user's query in an intelligent way. Our method takes advantage of the semantics provided by a user's query, which in turn provides the mathematical constraint that is crucial for faster detection. We propose an approach to generate query conditions based on the user's query. In particular, we use meta paths between nodes to define target patterns as well as their similarities, leading to efficient motif discovery and ranking at the same time. The proposed method is examined on a real-world academic network, using different similarity measures between the nodes. The experiment result demonstrates that our method can identify interesting motifs, and is robust to the choice of similarity measures
    • ā€¦
    corecore