{"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/a-network-approach-to-topic-models","title":"A network approach to topic models","arxiv_id":"1708.01677","date":"2017-08-04","proceeding":null,"authors":["Martin Gerlach","Tiago P. Peixoto","Eduardo G. Altmann"],"abstract":"One of the main computational and scientific challenges in the modern age is\nto extract useful information from unstructured texts. Topic models are one\npopular machine-learning approach which infers the latent topical structure of\na collection of documents. Despite their success --- in particular of its most\nwidely used variant called Latent Dirichlet Allocation (LDA) --- and numerous\napplications in sociology, history, and linguistics, topic models are known to\nsuffer from severe conceptual and practical problems, e.g. a lack of\njustification for the Bayesian priors, discrepancies with statistical\nproperties of real texts, and the inability to properly choose the number of\ntopics. Here we obtain a fresh view on the problem of identifying topical\nstructures by relating it to the problem of finding communities in complex\nnetworks. This is achieved by representing text corpora as bipartite networks\nof documents and words. By adapting existing community-detection methods --\nusing a stochastic block model (SBM) with non-parametric priors -- we obtain a\nmore versatile and principled framework for topic modeling (e.g., it\nautomatically detects the number of topics and hierarchically clusters both the\nwords and documents). The analysis of artificial and real corpora demonstrates\nthat our SBM approach leads to better topic models than LDA in terms of\nstatistical model selection. More importantly, our work shows how to formally\nrelate methods from community detection and topic modeling, opening the\npossibility of cross-fertilization between these two fields.","url_abs":"http://arxiv.org/abs/1708.01677v2","url_pdf":"http://arxiv.org/pdf/1708.01677v2.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":"a-network-approach-to-topic-models","repo_url":"https://github.com/martingerlach/hSBM_Topicmodel","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"community-detection","task_name":"Community Detection"},{"task_slug":"model-selection","task_name":"Model Selection"},{"task_slug":"sociology","task_name":"Sociology"},{"task_slug":"stochastic-block-model","task_name":"Stochastic Block Model"},{"task_slug":"topic-models","task_name":"Topic Models"}],"methods":[{"method_slug":"lda","method_name":"LDA"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1708.01677","atlas_url":"https://app.syntology.ai/?focus=1708.01677","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":"1708.01677"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1708.01677\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1708.01677"},"call":"get_concepts_for_paper(arxiv_id=\"1708.01677\")"}],"by_repo":[{"repo":"martingerlach/hSBM_Topicmodel","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":"9b616997443b737922710a783a7c460868cf17d48c60e8e4e0e0fa2b50a39f8f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}