DISCOVERING CLUSTERING PATTERNS FROM E-COUNTER DATA STREAMS

2Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

Clustering data streams has gained popularity in recent years due to their potential of generating relevant information for planning building automation, evaluating energy efficiency scenarios, and simulating emergency protocols in indoor spaces. In this paper, a Data Stream Affinity Propagation (DSAP) clustering algorithm is proposed for analyzing indoor localization data generated from e-counters systems. The data streams are a sequence of potentially infinite and non-stationary data points, arriving continuously where random access to the data is not feasible and storing all the arriving data is impractical. The DSAP model is developed based on a two-phase approach (i.e., online and offline clustering phases) using the landmark time window model. It is non-parametric in the sense of not requiring any prior knowledge about the number of clusters and their respective labels. The validation and performance of the DSAP model is evaluated using real-world data streams from a behavioural experiment aimed at finding new spatio-temporal patterns in stair usage due to an educational intervention campaign.

Cite

CITATION STYLE

APA

Ivari, N. E., Wachowicz, M., Williams, P. A. H., & Agnew, T. (2022). DISCOVERING CLUSTERING PATTERNS FROM E-COUNTER DATA STREAMS. In ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences (Vol. 10, pp. 81–88). Copernicus Publications. https://doi.org/10.5194/isprs-annals-X-4-W3-2022-81-2022

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free