{"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/topic-grouper-an-agglomerative-clustering","title":"Topic Grouper: An Agglomerative Clustering Approach to Topic Modeling","arxiv_id":"1904.06483","date":"2019-04-13","proceeding":null,"authors":["Daniel Pfeifer","Jochen L. Leidner"],"abstract":"We introduce Topic Grouper as a complementary approach in the field of\nprobabilistic topic modeling. Topic Grouper creates a disjunctive partitioning\nof the training vocabulary in a stepwise manner such that resulting partitions\nrepresent topics. It is governed by a simple generative model, where the\nlikelihood to generate the training documents via topics is optimized. The\nalgorithm starts with one-word topics and joins two topics at every step. It\ntherefore generates a solution for every desired number of topics ranging\nbetween the size of the training vocabulary and one. The process represents an\nagglomerative clustering that corresponds to a binary tree of topics. A\nresulting tree may act as a containment hierarchy, typically with more general\ntopics towards the root of tree and more specific topics towards the leaves.\nTopic Grouper is not governed by a background distribution such as the\nDirichlet and avoids hyper parameter optimizations.\n  We show that Topic Grouper has reasonable predictive power and also a\nreasonable theoretical and practical complexity. Topic Grouper can deal well\nwith stop words and function words and tends to push them into their own\ntopics. Also, it can handle topic distributions, where some topics are more\nfrequent than others. We present typical examples of computed topics from\nevaluation datasets, where topics appear conclusive and coherent. In this\ncontext, the fact that each word belongs to exactly one topic is not a major\nlimitation; in some scenarios this can even be a genuine advantage, e.g.~a\nrelated shopping basket analysis may aid in optimizing groupings of articles in\nsales catalogs.","url_abs":"http://arxiv.org/abs/1904.06483v1","url_pdf":"http://arxiv.org/pdf/1904.06483v1.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":"topic-grouper-an-agglomerative-clustering","repo_url":"https://github.com/pfeiferd/TopicGrouperJ","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"articles","task_name":"Articles"},{"task_slug":"clustering","task_name":"Clustering"}],"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":"pfeiferd/TopicGrouperJ","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":"3d194505572029d474ef7c25803dfad8a84f60a10027dd9f5d9f5fb04cd82209","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}