A Biclustering Method for Heterogeneous and Temporal Medical Data

• Published in: IEEE transactions on knowledge and data engineering Vol. 34; no. 2; pp. 506 - 518
• Main Authors: Vandromme, Maxence, Jacques, Julie, Taillard, Julien, Jourdan, Laetitia, Dhaenens, Clarisse
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.02.2022; The Institute of Electrical and Electronics Engineers, Inc. (IEEE); Institute of Electrical and Electronics Engineers
• Subjects: Algorithms; Artificial Intelligence; Clustering algorithms; Computer Science; Data mining; Electronic health records; electronic medical records; Gene expression; Hospitals; knowledge discovery; Medical diagnostic imaging; Operations Research; Sparse matrices
• ISSN: 1041-4347; 1558-2191
• DOI: 10.1109/TKDE.2020.2983692

We address the problem of biclustering on heterogeneous data, that is, data of various types (binary, numeric, symbolic, temporal). We propose a new method, HBC-t (Heterogeneous BiClustering for temporal data), designed to extract biclusters from heterogeneous, temporal, large-scale, sparse data matrices. HBC-t is based on HBC, using similar mechanisms but adding support for temporal data. The goal of this method is to handle Electronic Health Records (EHR) data gathered by hospitals on patients, stays, acts, diagnoses, prescriptions, etc.; and to provide valuable insights on this data. Temporal data accounts for a majority of the data available for this study, and in EHR in general where medical events are timestamped. Therefore, it is crucial to have an algorithm that supports this type of data. The proposed algorithm takes advantage of the data sparsity and uses a constructive greedy heuristic to build a large number of possibly overlapping biclusters. HBC-t is successfully compared with several other biclustering algorithms on numeric and temporal data. Experiments on full-scale real-life data sets further assert its scalability and efficiency.