{"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/discovering-and-deciphering-relationships","title":"Discovering and Deciphering Relationships Across Disparate Data Modalities","arxiv_id":"1609.05148","date":"2016-09-16","proceeding":null,"authors":["Joshua T. Vogelstein","Eric Bridgeford","Qing Wang","Carey E. Priebe","Mauro Maggioni","Cencheng Shen"],"abstract":"Understanding the relationships between different properties of data, such as\nwhether a connectome or genome has information about disease status, is\nbecoming increasingly important in modern biological datasets. While existing\napproaches can test whether two properties are related, they often require\nunfeasibly large sample sizes in real data scenarios, and do not provide any\ninsight into how or why the procedure reached its decision. Our approach,\n\"Multiscale Graph Correlation\" (MGC), is a dependence test that juxtaposes\npreviously disparate data science techniques, including k-nearest neighbors,\nkernel methods (such as support vector machines), and multiscale analysis (such\nas wavelets). Other methods typically require double or triple the number\nsamples to achieve the same statistical power as MGC in a benchmark suite\nincluding high-dimensional and nonlinear relationships - spanning polynomial\n(linear, quadratic, cubic), trigonometric (sinusoidal, circular, ellipsoidal,\nspiral), geometric (square, diamond, W-shape), and other functions, with\ndimensionality ranging from 1 to 1000. Moreover, MGC uniquely provides a simple\nand elegant characterization of the potentially complex latent geometry\nunderlying the relationship, providing insight while maintaining computational\nefficiency. In several real data applications, including brain imaging and\ncancer genetics, MGC is the only method that can both detect the presence of a\ndependency and provide specific guidance for the next experiment and/or\nanalysis to conduct.","url_abs":"http://arxiv.org/abs/1609.05148v8","url_pdf":"http://arxiv.org/pdf/1609.05148v8.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":"discovering-and-deciphering-relationships","repo_url":"https://github.com/NeuroDataDesign/mgcpy","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"discovering-and-deciphering-relationships","repo_url":"https://github.com/neurodata/mgc-r","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"discovering-and-deciphering-relationships","repo_url":"https://github.com/neurodata/mgcpy","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"discovering-and-deciphering-relationships","repo_url":"https://github.com/neurodata/r-mgc","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"}],"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":"NeuroDataDesign/mgcpy","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"neurodata/mgc-r","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"neurodata/mgcpy","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"neurodata/r-mgc","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":"050fa1b9bee473aeaec6d09a0e3ec60844ee4059d57cbd0f4d97c626b05b2407","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}