{"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/maximum-likelihood-estimation-of-a-finite","title":"Maximum likelihood estimation of a finite mixture of logistic regression models in a continuous data stream","arxiv_id":"1802.10529","date":"2018-02-28","proceeding":null,"authors":["Maurits Kaptein","Paul Ketelaar"],"abstract":"In marketing we are often confronted with a continuous stream of responses to\nmarketing messages. Such streaming data provide invaluable information\nregarding message effectiveness and segmentation. However, streaming data are\nhard to analyze using conventional methods: their high volume and the fact that\nthey are continuously augmented means that it takes considerable time to\nanalyze them. We propose a method for estimating a finite mixture of logistic\nregression models which can be used to cluster customers based on a continuous\nstream of responses. This method, which we coin oFMLR, allows segments to be\nidentified in data streams or extremely large static datasets. Contrary to\nblack box algorithms, oFMLR provides model estimates that are directly\ninterpretable. We first introduce oFMLR, explaining in passing general topics\nsuch as online estimation and the EM algorithm, making this paper a high level\noverview of possible methods of dealing with large data streams in marketing\npractice. Next, we discuss model convergence, identifiability, and relations to\nalternative, Bayesian, methods; we also identify more general issues that arise\nfrom dealing with continuously augmented data sets. Finally, we introduce the\noFMLR [R] package and evaluate the method by numerical simulation and by\nanalyzing a large customer clickstream dataset.","url_abs":"http://arxiv.org/abs/1802.10529v1","url_pdf":"http://arxiv.org/pdf/1802.10529v1.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":"maximum-likelihood-estimation-of-a-finite","repo_url":"https://github.com/MKaptein/ofmlr","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"maximum-likelihood-estimation-of-a-finite","repo_url":"https://github.com/Nth-iteration-labs/ofmlr","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"marketing","task_name":"Marketing"},{"task_slug":"regression-1","task_name":"regression"}],"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":"MKaptein/ofmlr","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Nth-iteration-labs/ofmlr","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":"a276b26e53e18e7719cc2f2d0149edcb41a192870a528707bfb7aadb6fb29b49","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}