{"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/parallel-clustering-of-single-cell","title":"Parallel Clustering of Single Cell Transcriptomic Data with Split-Merge Sampling on Dirichlet Process Mixtures","arxiv_id":"1812.10048","date":"2018-12-25","proceeding":null,"authors":["Tiehang Duan","José P. Pinto","Xiaohui Xie"],"abstract":"Motivation: With the development of droplet based systems, massive single\ncell transcriptome data has become available, which enables analysis of\ncellular and molecular processes at single cell resolution and is instrumental\nto understanding many biological processes. While state-of-the-art clustering\nmethods have been applied to the data, they face challenges in the following\naspects: (1) the clustering quality still needs to be improved; (2) most models\nneed prior knowledge on number of clusters, which is not always available; (3)\nthere is a demand for faster computational speed. Results: We propose to tackle\nthese challenges with Parallel Split Merge Sampling on Dirichlet Process\nMixture Model (the Para-DPMM model). Unlike classic DPMM methods that perform\nsampling on each single data point, the split merge mechanism samples on the\ncluster level, which significantly improves convergence and optimality of the\nresult. The model is highly parallelized and can utilize the computing power of\nhigh performance computing (HPC) clusters, enabling massive clustering on huge\ndatasets. Experiment results show the model outperforms current widely used\nmodels in both clustering quality and computational speed. Availability: Source\ncode is publicly available on\nhttps://github.com/tiehangd/Para_DPMM/tree/master/Para_DPMM_package","url_abs":"http://arxiv.org/abs/1812.10048v1","url_pdf":"http://arxiv.org/pdf/1812.10048v1.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":"parallel-clustering-of-single-cell","repo_url":"https://github.com/tiehangd/Para_DPMM","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"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":"tiehangd/Para_DPMM","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":"ea2a3cf3a8829da08c2692caff621c2342f701ccb70bf6e8da58c7488a723075","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}