Size matters: finding the most informative set of window lengths

Lijffijt, J. and Papapetrou, Panagiotis and Puolamäki, K. (2012) Size matters: finding the most informative set of window lengths. In: Flach, P.A. and de Bie, T. and Cristianini, N. (eds.) Machine Learning and Knowledge Discovery in Databases. Lecture Notes in Computer Science 7524. Berlin, Germany: Springer Verlag, pp. 451-466. ISBN 9783642334856.

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1007/978-3-642-33486-3_29

Abstract

Event sequences often contain continuous variability at different levels. In other words, their properties and characteristics change at different rates, concurrently. For example, the sales of a product may slowly become more frequent over a period of several weeks, but there may be interesting variation within a week at the same time. To provide an accurate and robust “view” of such multi-level structural behavior, one needs to determine the appropriate levels of granularity for analyzing the underlying sequence. We introduce the novel problem of finding the best set of window lengths for analyzing discrete event sequences. We define suitable criteria for choosing window lengths and propose an efficient method to solve the problem. We give examples of tasks that demonstrate the applicability of the problem and present extensive experiments on both synthetic data and real data from two domains: text and DNA. We find that the optimal sets of window lengths themselves can provide new insight into the data, e.g., the burstiness of events affects the optimal window lengths for measuring the event frequencies.

Metadata

Item Type:	Book Section
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	26 Jul 2013 10:26
Last Modified:	09 Aug 2023 12:33
URI:	https://eprints.bbk.ac.uk/id/eprint/7846

Statistics

Archive Staff Only (login required)

Edit/View Item