Spatiotemporal Behavior Profiling: A Treasure Hunt Case Study

نویسندگان

  • Victor de Graaff
  • Dieter Pfoser
  • Maurice van Keulen
  • Rolf A. de By
چکیده

Trajectories have been providing us with a wealth of derived information such as traffic conditions and road network updates. This work focuses on deriving user profiles through spatiotemporal analysis of trajectory data to provide insight into the quality of information provided by users. The presented behavior profiling method assesses user participation characteristics in a treasurehunt type event. Consisting of an analysis and a profiling phase, analysis involves a timeline and a stay-point analysis, as well as a semantic trajectory inspection relating actual and expected paths. The analysis results are then grouped around profiles that can be used to estimate the user performance in the activity. The proposed profiling method is evaluated by means of a student orientation treasurehunt activity at the University of Twente, The Netherlands. The profiling method is used to predict the students’ gaming behavior by means of a simple team type classification, and a feature-based answer type classification.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Influencing the Learning Experience Through Affective Agent Feedback in a Real-World Treasure Hunt: (Extended Abstract)

We explore the effect of the behaviour of a virtual robot agent in the context of a real-world treasure-hunt activity carried out by children aged 11–12. We compare three conditions: a traditional paper-based treasure hunt, along with a virtual robot on a tablet which provides either neutral or affective feedback during the treasure hunt. The results of the study suggest that the use of the vir...

متن کامل

Heuristic-Driven “Treasure Hunt” with Linear Performance Guarantees

Consider the task of reaching a goal state in a partially or completely unknown domain. To accomplish such a task search algorithms have to explore the domain sufficiently to locate a goal state and a path leading to it, performing therefore what we call uninformed “treasure hunt.” Very often prior knowledge in the form of heuristic values estimating distances towards the goal state is readily ...

متن کامل

Faster Treasure Hunt and Better Strongly Universal Exploration Sequences

In this paper, we investigate the explicit deterministic treasure hunt problem in a n-vertex network. This problem was firstly introduced by Ta-Shma and Zwick in [10] [SODA’07]. Note also it is a variant of the well known rendezvous problem in which one of the robot (the treasure) is always stationary. In this paper, we propose an O(n 1 λ )-time algorithm for the treasure hunt problem, which si...

متن کامل

Affective Agents

This paper presents a study designed to explore the effect of feedback on perception of an embodied agent as well as the overall performance and experience of primary school children aged 12-13 carrying out a treasure hunt activity. We use an embodied agent to compare three experimental conditions: no feedback, neutral feedback, and affective feedback. What the students think about the embodied...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015