{"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-probabilistic-framework-for-quantum","title":"A Probabilistic framework for Quantum Clustering","arxiv_id":"1902.05578","date":"2019-02-14","proceeding":null,"authors":["Raúl V. Casaña-Eslava","Paulo J. G. Lisboa","Sandra Ortega-Martorell","Ian H. Jarman","José D. Martín-Guerrero"],"abstract":"Quantum Clustering is a powerful method to detect clusters in data with mixed\ndensity. However, it is very sensitive to a length parameter that is inherent\nto the Schr\\\"odinger equation. In addition, linking data points into clusters\nrequires local estimates of covariance that are also controlled by length\nparameters. This raises the question of how to adjust the control parameters of\nthe Schr\\\"odinger equation for optimal clustering. We propose a probabilistic\nframework that provides an objective function for the goodness-of-fit to the\ndata, enabling the control parameters to be optimised within a Bayesian\nframework. This naturally yields probabilities of cluster membership and data\npartitions with specific numbers of clusters. The proposed framework is tested\non real and synthetic data sets, assessing its validity by measuring\nconcordance with known data structure by means of the Jaccard score (JS). This\nwork also proposes an objective way to measure performance in unsupervised\nlearning that correlates very well with JS.","url_abs":"http://arxiv.org/abs/1902.05578v1","url_pdf":"http://arxiv.org/pdf/1902.05578v1.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-probabilistic-framework-for-quantum","repo_url":"https://github.com/racaes/PQC","is_official":0,"mentioned_in_paper":0,"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":"racaes/PQC","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":"4dd7a8a047ab78830f5af519f22f87cddaf6a6b5d8e0f55fa41795401b6f694d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}