Simple, fast, and accurate clustering of data sequences

Authors:
Luis Leiva;Enrique Vidal
Affiliations:
Institut Tecnològic d'Informàtica, Valencia, Spain & Universitat Politècnica de València (UPV);Institut Tecnològic d'Informàtica & Universitat Politècnica de València, Valencia, Spain
Venue:
Proceedings of the 2012 ACM international conference on Intelligent User Interfaces
Year:
2012

Citing 3
Cited 0

A Scalable Algorithm for Clustering Sequential Data

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Pattern Classification (2nd Edition)

Pattern Classification (2nd Edition)
Trajectory clustering: a partition-and-group framework

Proceedings of the 2007 ACM SIGMOD international conference on Management of data

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many devices generate large amounts of data that follow some sort of sequentiality, e.g., motion sensors, e-pens, or eye trackers, and therefore these data often need to be compressed for classification, storage, and/or retrieval purposes. This paper introduces a simple, accurate, and extremely fast technique inspired by the well-known K-means algorithm to properly cluster sequential data. We illustrate the feasibility of our algorithm on a web-based prototype that works with trajectories derived from mouse and touch input. As can be observed, our proposal outperforms the classical K-means algorithm in terms of accuracy (better, well-formed segmentations) and performance (less computation time).