Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/91923
Title: | Online activity graph for document importance and association |
Authors: | Abela, Charlie Staff, Chris Handschuh, Siegfried |
Keywords: | Graph algorithms Trees (Graph theory) -- Data processing Knowledge workers -- Data processing Knowledge workers -- Case studies |
Issue Date: | 2011 |
Publisher: | ACM |
Citation: | Abela, C., Staff, C., & Handschuh, S. (2011). Online activity graph for document importance and association. In Proceedings of the 7th International Conference on Semantic Systems, Graz, 191-194. |
Abstract: | The way in which a user interacts with her desktop while performing some task generates an information trail that can be used to identify the task context and the user's interests. This new information can in turn be fed back into the system to increase the level of support available to the user for both current and future tasks. In this paper we present research which analyses user-activity log les to explore how a user's activities evolve with time. Resources fall in and out of a task based on the user's mental model for tackling that task. We assign time-varying, importance and association values to each resource, based on the dwell-time and the resource-switching patterns exhibited by the user while browsing. Furthermore, we propose a new dynamic graph algorithm called OnlineActivityGraph which leverages on these values to generate document clusters and short term user models. We further present a discussion about the encouraging results obtained from our preliminary experiments. |
URI: | https://www.um.edu.mt/library/oar/handle/123456789/91923 |
ISBN: | 978145030628 |
Appears in Collections: | Scholarly Works - FacICTAI |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Online_activity_graph_for_document_importance_and_association_2011.pdf Restricted Access | 195.44 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.