Skip to main content
Kent Academic Repository

New Longitudinal Classification Methods with Automated Detection of Monotonicity Constraints

Ovchinnik, Sergey (2024) New Longitudinal Classification Methods with Automated Detection of Monotonicity Constraints. Doctor of Philosophy (PhD) thesis, University of Kent,. (doi:10.22024/UniKent/01.02.109283) (KAR id:109283)

Abstract

Longitudinal datasets contain repeated measurements of the same attributes measured at different points in time. They can be used to discover interesting knowledge based on time-based trends and create prediction models that can predict future values of target attributes, like class attributes in the case of the classification task of data mining (or machine learning).

Monotonicity is a special type of relation between attributes in which their values have either a strongly positive or a strongly negative relationship. These relations can occur in real-world data and can be used to enhance the predictive performance and the acceptability of prediction models by users.

In recent years, there has been an increasing interest in using longitudinal data and monotonicity relations in the field of classification, resulting in the emergence of the fields of Longitudinal Classification and Monotonic classification.

While there has been a lot of development in each of these fields separately, there have not been any studies that united these two fields. The aim of this study is to develop new approaches to longitudinal and monotonic classification and develop a unified approach for using monotonicity relations found in longitudinal datasets in order to construct highly accurate and useful classification models.

As a result of this study, several contributions were made to both fields, as follows. First, a novel approach to automated monotonicity detection has been created. Second, a novel longitudinal classification algorithm was developed, based on the idea of nested decision trees. The basic idea is that each internal node of the outer tree consists of a decision tree built using as input all the temporal variations (in different time points) of the same longitudinal attribute. Third, two new methods for deriving monotonicity-based longitudinal attributes were created, and a unified algorithm was created that united all of these features into one monotonic longitudinal classification algorithm, the first algorithm to combine the two approaches.

The proposed methods were evaluated on longitudinal datasets derived from the English Longitudinal Study of Ageing (ELSA), and the results confirmed that the Nested Tree algorithm outperformed a conventional decision tree algorithm regarding predictive performance.

Item Type: Thesis (Doctor of Philosophy (PhD))
Thesis advisor: Otero, Fernando
Thesis advisor: Freitas, Alex
DOI/Identification number: 10.22024/UniKent/01.02.109283
Uncontrolled keywords: Data Mining, Classification, Longitudinal, Monotonicity
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Institutional Unit: Schools > School of Computing
Former Institutional Unit:
Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Funders: University of Kent (https://ror.org/00xkeyj56)
SWORD Depositor: System Moodle
Depositing User: System Moodle
Date Deposited: 18 Mar 2025 16:10 UTC
Last Modified: 20 May 2025 10:29 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/109283 (The current URI for this page, for reference purposes)

University of Kent Author Information

Ovchinnik, Sergey.

Creator's ORCID:
CReDIT Contributor Roles:
  • Depositors only (login required):

Total unique views of this page since July 2020. For more details click on the image.