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.
CITATION STYLE
Abdullahi, F. B., Coenen, F., & Martin, R. (2015). Finding banded patterns in data: The banded pattern mining algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9263, pp. 95–107). Springer Verlag. https://doi.org/10.1007/978-3-319-22729-0_8
Mendeley helps you to discover research relevant for your work.