We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
The goal of lifetime clustering is to develop an inductive model that maps subjects into $K$ clusters according to their underlying (unobserved) lifetime distribution. We introduce a neural-network based lifetime clustering model that can find cluster assignments by directly maximizing the divergence between the empirical lifetime distributions of the clusters. Accordingly, we define a novel clustering loss function over the lifetime distributions (of entire clusters) based on a tight upper bound of the two-sample Kuiper test p-value. The resultant model is robust to the modeling issues associated with the unobservability of termination signals, and does not assume proportional hazards. Our results in real and synthetic datasets show significantly better lifetime clusters (as evaluated by C-index, Brier Score, Logrank score and adjusted Rand index) as compared to competing approaches.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1910.00547")
get_code_for_paper("1910.00547")
have("1910.00547")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1910.00547.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1910.00547)
Connect an agent — have() is free.