Probabilistic clustering of time-evolving distance data

From MaRDI portal
Publication:747287

DOI10.1007/S10994-015-5516-XzbMATH Open1341.68171arXiv1504.03701OpenAlexW1881858245WikidataQ57525391 ScholiaQ57525391MaRDI QIDQ747287FDOQ747287


Authors: Julia E. Vogt, Marius Kloft, Stefan Stark, Sudhir S. Raman, Sandhya Prabhakaran, Volker Roth, Gunnar Rätsch Edit this on Wikidata


Publication date: 23 October 2015

Published in: Machine Learning (Search for Journal in Brave)

Abstract: We present a novel probabilistic clustering model for objects that are represented via pairwise distances and observed at different time points. The proposed method utilizes the information given by adjacent time points to find the underlying cluster structure and obtain a smooth cluster evolution. This approach allows the number of objects and clusters to differ at every time point, and no identification on the identities of the objects is needed. Further, the model does not require the number of clusters being specified in advance -- they are instead determined automatically using a Dirichlet process prior. We validate our model on synthetic data showing that the proposed method is more accurate than state-of-the-art clustering methods. Finally, we use our dynamic clustering model to analyze and illustrate the evolution of brain cancer patients over time.


Full work available at URL: https://arxiv.org/abs/1504.03701




Recommendations



Cites Work


Cited In (4)





This page was built for publication: Probabilistic clustering of time-evolving distance data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q747287)