Towards Statistically Significant Taxonomy Aware Co-location Pattern Detection

• URL: http://arxiv.org/abs/2407.00317v2
• Date: Thu, 04 Jul 2024 05:11:10 GMT
• Title: Towards Statistically Significant Taxonomy Aware Co-location Pattern Detection
• Authors: Subhankar Ghosh, Arun Sharma, Jayant Gupta, Shashi Shekhar,
• Abstract summary: The goal is to find subsets of feature types or their parents whose spatial interaction is statistically significant. The problem is computationally challenging due to the exponential number of candidate co-location patterns generated by the taxonomy. This paper introduces two methods for incorporating and assessing the statistical significance of co-location patterns.
• Score: 4.095979270829907
• License:
• Abstract: Given a collection of Boolean spatial feature types, their instances, a neighborhood relation (e.g., proximity), and a hierarchical taxonomy of the feature types, the goal is to find the subsets of feature types or their parents whose spatial interaction is statistically significant. This problem is for taxonomy-reliant applications such as ecology (e.g., finding new symbiotic relationships across the food chain), spatial pathology (e.g., immunotherapy for cancer), retail, etc. The problem is computationally challenging due to the exponential number of candidate co-location patterns generated by the taxonomy. Most approaches for co-location pattern detection overlook the hierarchical relationships among spatial features, and the statistical significance of the detected patterns is not always considered, leading to potential false discoveries. This paper introduces two methods for incorporating taxonomies and assessing the statistical significance of co-location patterns. The baseline approach iteratively checks the significance of co-locations between leaf nodes or their ancestors in the taxonomy. Using the Benjamini-Hochberg procedure, an advanced approach is proposed to control the false discovery rate. This approach effectively reduces the risk of false discoveries while maintaining the power to detect true co-location patterns. Experimental evaluation and case study results show the effectiveness of the approach.

Related papers

• Out-of-Distribution Detection on Graphs: A Survey [58.47395497985277]
  Graph out-of-distribution (GOOD) detection focuses on identifying graph data that deviates from the distribution seen during training. We categorize existing methods into four types: enhancement-based, reconstruction-based, information propagation-based, and classification-based approaches. We discuss practical applications and theoretical foundations, highlighting the unique challenges posed by graph data.
  arXiv  Detail & Related papers  (2025-02-12T04:07:12Z)
• Spatially-Delineated Domain-Adapted AI Classification: An Application for Oncology Data [3.0566763412020714]
  Given multi-type point maps from different place-types, our objective is to develop a trained on the source place-type to accurately distinguish between two classes of the target place-type based on their point arrangements. This problem is societally important for many applications, such as generating clinical hypotheses for designing new immunotherapies for cancer treatment. We explore a novel multi-task self-learning framework that targets spatial arrangements, such as spatial mix-up masking and spatial contrastive predictive coding, for spatially-delineated AI classification.
  arXiv  Detail & Related papers  (2025-01-20T19:20:13Z)
• Identifying perturbation targets through causal differential networks [23.568795598997376]
  We propose a causality-inspired approach to identify variables responsible for changes to a biological system. First, we infer noisy causal graphs from the observational and interventional data. We then learn to map the differences between these graphs, along with additional statistical features, to sets of variables that were intervened upon.
  arXiv  Detail & Related papers  (2024-10-04T12:48:21Z)
• Seeing Unseen: Discover Novel Biomedical Concepts via Geometry-Constrained Probabilistic Modeling [53.7117640028211]
  We present a geometry-constrained probabilistic modeling treatment to resolve the identified issues. We incorporate a suite of critical geometric properties to impose proper constraints on the layout of constructed embedding space. A spectral graph-theoretic method is devised to estimate the number of potential novel classes.
  arXiv  Detail & Related papers  (2024-03-02T00:56:05Z)
• The Paradox of Motion: Evidence for Spurious Correlations in Skeleton-based Gait Recognition Models [4.089889918897877]
  This study challenges the prevailing assumption that vision-based gait recognition relies primarily on motion patterns. We show through a comparative analysis that removing height information leads to notable performance degradation. We propose a spatial transformer model processing individual poses, disregarding any temporal information, which achieves unreasonably good accuracy.
  arXiv  Detail & Related papers  (2024-02-13T09:33:12Z)
• Causal Feature Selection via Transfer Entropy [59.999594949050596]
  Causal discovery aims to identify causal relationships between features with observational data. We introduce a new causal feature selection approach that relies on the forward and backward feature selection procedures. We provide theoretical guarantees on the regression and classification errors for both the exact and the finite-sample cases.
  arXiv  Detail & Related papers  (2023-10-17T08:04:45Z)
• Learning Complete Topology-Aware Correlations Between Relations for Inductive Link Prediction [121.65152276851619]
  We show that semantic correlations between relations are inherently edge-level and entity-independent. We propose a novel subgraph-based method, namely TACO, to model Topology-Aware COrrelations between relations. To further exploit the potential of RCN, we propose Complete Common Neighbor induced subgraph.
  arXiv  Detail & Related papers  (2023-09-20T08:11:58Z)
• Learning Neural Causal Models with Active Interventions [83.44636110899742]
  We introduce an active intervention-targeting mechanism which enables a quick identification of the underlying causal structure of the data-generating process. Our method significantly reduces the required number of interactions compared with random intervention targeting. We demonstrate superior performance on multiple benchmarks from simulated to real-world data.
  arXiv  Detail & Related papers  (2021-09-06T13:10:37Z)
• Boolean Reasoning-Based Biclustering for Shifting Pattern Extraction [0.20305676256390928]
  Biclustering is a powerful approach to search for patterns in data, as it can be driven by a function that measures the quality of diverse types of patterns of interest. Shifting patterns are specially interesting as they account constant fluctuations in data. This work is presented to show that the induction of shifting patterns by means of Boolean reasoning is due to the ability of finding all inclusion--maximal delta-shifting patterns.
  arXiv  Detail & Related papers  (2021-04-26T11:40:17Z)
• Learning from Aggregate Observations [82.44304647051243]
  We study the problem of learning from aggregate observations where supervision signals are given to sets of instances. We present a general probabilistic framework that accommodates a variety of aggregate observations. Simple maximum likelihood solutions can be applied to various differentiable models.
  arXiv  Detail & Related papers  (2020-04-14T06:18:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.