Despite the recent advances in medical data organization and structuring, electronic medical records (EMRs) can often contain unstructured raw data, temporally constrained measurements, multichannel signal data and image data all of which are often difficult to compare and contrast in large quantities due to their sizes and variation. We present a proof of concept system that can alleviate this by mapping EEG data to a relatively compressed n-dimensional space where the Euclidean distance between data points as similarity measure. We optimize a deep neural network mapping by using a triplet-based loss function. A system of this type could be used by medical professionals query and explore EEG data. To verify that this clustering method learns a meaningful representation of the data, we apply a KNN classifier to the output. We achieve a 58.6% classification accuracy operating on the neural network sourced embeddings on the six class TUH EEG Cohorts dataset provided by Temple University.
[1]
Obeid Iyad,et al.
Automatic Discovery and Processing of EEG Cohorts from Clinical Records
,
2016
.
[2]
Joseph Picone,et al.
The Temple University Hospital EEG Data Corpus
,
2016,
Front. Neurosci..
[3]
Manohar Paluri,et al.
Metric Learning with Adaptive Density Discrimination
,
2015,
ICLR.
[4]
Dhruv Batra,et al.
Joint Unsupervised Learning of Deep Representations and Image Clusters
,
2016,
2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).
[5]
James Philbin,et al.
FaceNet: A unified embedding for face recognition and clustering
,
2015,
2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).
[6]
Kevin Murphy,et al.
Learnable Structured Clustering Framework for Deep Metric Learning
,
2016,
ArXiv.