{"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/predicting-customer-churn-extreme-gradient","title":"Predicting Customer Churn: Extreme Gradient Boosting with Temporal Data","arxiv_id":"1802.03396","date":"2018-02-09","proceeding":null,"authors":["Bryan Gregory"],"abstract":"Accurately predicting customer churn using large scale time-series data is a\ncommon problem facing many business domains. The creation of model features\nacross various time windows for training and testing can be particularly\nchallenging due to temporal issues common to time-series data. In this paper,\nwe will explore the application of extreme gradient boosting (XGBoost) on a\ncustomer dataset with a wide-variety of temporal features in order to create a\nhighly-accurate customer churn model. In particular, we describe an effective\nmethod for handling temporally sensitive feature engineering. The proposed\nmodel was submitted in the WSDM Cup 2018 Churn Challenge and achieved\nfirst-place out of 575 teams.","url_abs":"http://arxiv.org/abs/1802.03396v1","url_pdf":"http://arxiv.org/pdf/1802.03396v1.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":"predicting-customer-churn-extreme-gradient","repo_url":"https://github.com/Atharv17/Churn-Prediction-","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"predicting-customer-churn-extreme-gradient","repo_url":"https://github.com/SAURAVBORAH22/Churn-Prediction-","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"feature-engineering","task_name":"Feature Engineering"},{"task_slug":"time-series-1","task_name":"Time Series"},{"task_slug":"time-series","task_name":"Time Series Analysis"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"Atharv17/Churn-Prediction-","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"SAURAVBORAH22/Churn-Prediction-","kind":"listed","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":"70f80c4d255af5b7ee265b45cc78cebf39af4113cc4b0319b1121ddcdbb02004","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}