Howard J. Hamilton

h-index29
2papers
4,448citations

2 Papers

1.0LGDec 19, 2019
FIBS: A Generic Framework for Classifying Interval-based Temporal Sequences

S. Mohammad Mirbagheri, Howard J. Hamilton

We study the problem of classifying interval-based temporal sequences (IBTSs). Since common classification algorithms cannot be directly applied to IBTSs, the main challenge is to define a set of features that effectively represents the data such that classifiers can be applied. Most prior work utilizes frequent pattern mining to define a feature set based on discovered patterns. However, frequent pattern mining is computationally expensive and often discovers many irrelevant patterns. To address this shortcoming, we propose the FIBS framework for classifying IBTSs. FIBS extracts features relevant to classification from IBTSs based on relative frequency and temporal relations. To avoid selecting irrelevant features, a filter-based selection strategy is incorporated into FIBS. Our empirical evaluation on eight real-world datasets demonstrates the effectiveness of our methods in practice. The results provide evidence that FIBS effectively represents IBTSs for classification algorithms, which contributes to similar or significantly better accuracy compared to state-of-the-art competitors. It also suggests that the feature selection strategy is beneficial to FIBS's performance.

4.9CRNov 25, 2019
A Tutorial on Computing $t$-Closeness

Richard Dosselmann, Mehdi Sadeqi, Howard J. Hamilton

This paper presents a tutorial of the computation of $t$-closeness. An established model in the domain of privacy preserving data publishing, $t$-closeness is a measure of the earth mover's distance between two distributions of an anonymized database table. This tutorial includes three examples that showcase the full computation of $t$-closeness in terms of both numerical and categorical attributes. Calculations are carried out using the definition of the earth mover's distance and weighted order distance. This paper includes detailed explanations and calculations not found elsewhere in the literature. An efficient algorithm to calculate the $t$-closeness of a table is also presented.