{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/deep-recurrent-survival-analysis","title":"Deep Recurrent Survival Analysis","arxiv_id":"1809.02403","date":"2018-09-07","proceeding":null,"authors":["Kan Ren","Jiarui Qin","Lei Zheng","Zhengyu Yang","Wei-Nan Zhang","Lin Qiu","Yong Yu"],"abstract":"Survival analysis is a hotspot in statistical research for modeling\ntime-to-event information with data censorship handling, which has been widely\nused in many applications such as clinical research, information system and\nother fields with survivorship bias. Many works have been proposed for survival\nanalysis ranging from traditional statistic methods to machine learning models.\nHowever, the existing methodologies either utilize counting-based statistics on\nthe segmented data, or have a pre-assumption on the event probability\ndistribution w.r.t. time. Moreover, few works consider sequential patterns\nwithin the feature space. In this paper, we propose a Deep Recurrent Survival\nAnalysis model which combines deep learning for conditional probability\nprediction at fine-grained level of the data, and survival analysis for\ntackling the censorship. By capturing the time dependency through modeling the\nconditional probability of the event for each sample, our method predicts the\nlikelihood of the true event occurrence and estimates the survival rate over\ntime, i.e., the probability of the non-occurrence of the event, for the\ncensored data. Meanwhile, without assuming any specific form of the event\nprobability distribution, our model shows great advantages over the previous\nworks on fitting various sophisticated data distributions. In the experiments\non the three real-world tasks from different fields, our model significantly\noutperforms the state-of-the-art solutions under various metrics.","url_abs":"http://arxiv.org/abs/1809.02403v2","url_pdf":"http://arxiv.org/pdf/1809.02403v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"deep-recurrent-survival-analysis","repo_url":"https://github.com/rk2900/drsa","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"survival-analysis","task_name":"Survival Analysis"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1809.02403","atlas_url":"https://app.syntology.ai/?focus=1809.02403","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1809.02403"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1809.02403\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1809.02403"},"call":"get_concepts_for_paper(arxiv_id=\"1809.02403\")"}],"by_repo":[{"repo":"rk2900/drsa","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"3a8d593f76958df2bec3d4a835687a4c378b0b1e291e38ab985e930c039c95f4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}