Finding Banded Patterns in Data: The Banded Pattern Mining Algorithm



Abdullahi, Fatimah B, Coenen, Frans ORCID: 0000-0003-1026-6649 and Martin, Russell ORCID: 0000-0002-7043-503X
(2015) Finding Banded Patterns in Data: The Banded Pattern Mining Algorithm. In: Big Data Analytics and Knowledge Discovery, 2015-9-1 - 2015-9-4, Valencia, Spain.

[img] Text
dawak2015.pdf - Author Accepted Manuscript

Download (545kB)

Abstract

The concept of Banded pattern mining is concerned with the identification of “bandings” within zero-one data. A zero-one data set is said to be fully banded if all the “ones” can be arranged along the leading diagonal. The discovery of a banded pattern is of interest in its own right, at least in a data analysis context, because it tells us something about the data. Banding has also been shown to enhances the efficiency of matrix manipulation algorithms. In this paper the exact N dimensional Banded Pattern Mining (BPM) algorithm is presented together with a full evaluation of its operation. To illustrate the utility of the banded pattern concept a case study using the Great Britain (GB) Cattle movement database is also presented.

Item Type: Conference or Workshop Item (Unspecified)
Uncontrolled Keywords: Banded patterns, Zero-one data, Banded pattern mining
Depositing User: Symplectic Admin
Date Deposited: 07 Feb 2017 15:43
Last Modified: 19 Jan 2023 07:19
DOI: 10.1007/978-3-319-22729-0_8
Related URLs:
URI: https://livrepository.liverpool.ac.uk/id/eprint/3005527