A New Streaming K‐Nearest Neighbor Algorithm for Status Prediction in Block‐Sparse, Autocorrelated, Irregular Longitudinal Data

In streaming longitudinal data, status prediction becomes challenging when input variables are block-sparse, autocorrelated, and irregular in both dimension and distribution. General methods cannot model such data directly, especially when the classes are extremely imbalanced. This research proposes a K-Nearest Neighbor (KNN) algorithm where distance is measured by Kullback-Leibler (KL) divergence. The algorithm uses features extracted from metric conditional density, both with and without first-order lag. The developed streaming KNN algorithm is further applied to simulation data. Results show that when differences originate from the location hyperparameters of the Gaussian distribution or both the shape and scale hyperparameters of the inverse gamma distribution, the method performs quite well, as expected, with an AUC close to 1. Additionally, a numerical method is proposed for general distributions that lack an analytical expression in real data. This method is applied to a big medical streaming dataset with similar properties. Results indicate that the AUC value gradually increases to 0.913, with a sensitivity of 0.851 and a specificity of 0.816.

Authors

Institutions

Publication Details

Journal
Statistics in Medicine
Published
2025-12-01
DOI
https://doi.org/10.1002/sim.70332
Primary Topic
Data Stream Mining Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A New Streaming K‐Nearest Neighbor Algorithm for Status Prediction in Block‐Sparse, Autocorrelated, Irregular Longitudinal Data

Xin Zhao, Xiaokai Nie, Yu Zhao, Kaida Cai
Statistics in Medicine
Data Stream Mining Techniques
article

A New Streaming K‐Nearest Neighbor Algorithm for Status Prediction in Block‐Sparse, Autocorrelated, Irregular Longitudinal Data

Xin Zhao, Xiaokai Nie, Yu Zhao, Kaida Cai
article en

Abstract

In streaming longitudinal data, status prediction becomes challenging when input variables are block-sparse, autocorrelated, and irregular in both dimension and distribution. General methods cannot model such data directly, especially when the classes are extremely imbalanced. This research proposes a K-Nearest Neighbor (KNN) algorithm where distance is measured by Kullback-Leibler (KL) divergence. The algorithm uses features extracted from metric conditional density, both with and without first-order lag. The developed streaming KNN algorithm is further applied to simulation data. Results show that when differences originate from the location hyperparameters of the Gaussian distribution or both the shape and scale hyperparameters of the inverse gamma distribution, the method performs quite well, as expected, with an AUC close to 1. Additionally, a numerical method is proposed for general distributions that lack an analytical expression in real data. This method is applied to a big medical streaming dataset with similar properties. Results indicate that the AUC value gradually increases to 0.913, with a sensitivity of 0.851 and a specificity of 0.816.

Statistics in MedicineVol. 44(28-30)
Chinese Academy of Medical Sciences & Peking Union Medical College (CN), Peking Union Medical College Hospital (CN), City University of Hong Kong, Shenzhen Research Institute (CN), Southeast University (CN)
Openalex Percentile: Top 80%
Data Stream Mining Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.