A framework converts spatial data into embeddings for insurance risk modelling.
problem Improving underwriting precision and risk management in insurance with spatial data.
method Multi-view contrastive learning framework for generating spatial embeddings.
result Spatial embeddings consistently improve predictive accuracy across various models.
Paper proposes a novel method to test differences in spatial point patterns.
problem Detecting differences in the first-order structures of spatial point patterns.
method Kernel mean embedding with approximate version tailored for spatial point processes, reducing comparison to Euclidean space t-tests.
result The proposed method is powerful and well-calibrated, demonstrated on real-world data.
Unsupervised method discovers object landmarks by factorizing image deformations.
problem Learning object structure in unsupervised settings.
method Factorizing image deformations to learn landmarks consistently across different viewpoints and object deformations.
result Learned landmarks establish meaningful correspondences between different object instances without explicit requirement.
For leveled spatial graphs, we find a surface embedding that allows cellular embedding.
problem Finding a surface embedding for general spatial graphs is not always possible.
method Define leveled property, decompose graph into subgraphs, and construct surface.
result For leveled spatial graphs with a small number of levels, a surface can always be found.
The paper develops a new model for high-dimensional spatial arbitrage pricing.
problem Estimating spatial interactions in high-dimensional asset pricing.
method Integrates spatial interactions with multi-factor analysis using generalized shrinkage Yule-Walker (SYW) estimation.
result Established asymptotic properties for high-dimensional spatial arbitrage pricing models.
Spatial embeddings of planar graphs can have higher unknotting numbers than crossing numbers.
problem Understanding the relationship between unknotting numbers and crossing numbers of spatial embeddings of planar graphs.
method Analyzing specific examples of planar graphs and their spatial embeddings to find counterexamples.
result There exist planar graphs and their spatial embeddings where the unknotting number is greater than half the crossing number.
MSFA clusters high-dimensional spatial data using spline-based covariance structures.
problem Clustering high-dimensional spatial data with flexible covariance structures.
method Mixture of spatial factor analyzers with spline-based covariance and matrix variate factor analyzers for dimensionality reduction.
result Proposed models accurately infer and differentiate distinct spatial patterns in tensor-variate data.
We say that a graph is intrinsically non-trivial if every spatial embedding of the graph contains a non-trivial spatial subgraph. We prove that an intrinsically non-trivial graph is intrinsically linked, namely every spatial embedding of the graph contains a non-splittable 2-component link. We also show that there exis…
TransST improves spatial transcriptomics data analysis by identifying cell clusters and biomarkers.
problem Low resolution and insufficient sequencing depth in spatial transcriptomics data.
method Transfer learning framework to adaptively leverage external cell-labeled information.
result TransST successfully identifies five biologically meaningful cell clusters and separates adipose tissues from connective issues.
SE-KGE embeds spatial data into KGs for better spatial reasoning.
problem Spatially explicit KG embeddings for geographic tasks.
method Location-aware KG embedding model SE-KGE.
result SE-KGE outperforms baselines on DBGeo dataset.
MRTL learns interpretable spatial patterns efficiently.
problem Efficient and interpretable spatial analysis in various fields.
method Multiresolution Tensor Learning (MRTL) algorithm.
result 4~5x speedup with accurate and interpretable latent factors.
In this paper we construct some invariants of spatial graphs by disk-summing the constituent knots and show the delta edge-homotopy invariance of them. As an application, we show that there exist infinitely many slice spatial embeddings of a planar graph up to delta edge-homotopy, and there exist infinitely many bounda…
Paper presents a method for geographic ratemaking using spatial embeddings.
problem Lack of historical loss data in areas with high exposures.
method Construct spatial features within a complex representation model and use them as inputs to a predictive model.
result Predictions have smaller bias and variance than other spatial interpolation models.
Study calculates site-specific Gordian distances between graph embeddings.
problem Determining the minimal number of crossing changes between graph embeddings.
method Covering space theory for proofs.
result Site-specific Gordian distances between Milnor links and trivial links are determined.
Model place cells as spatial embeddings for efficient path planning and cognitive map construction.
problem Encoding spatial navigation in the hippocampus.
method Model place cells using spectral decomposition of multi-step random walk transition kernels, inducing sparsity and adjacency.
result Place cells encode spatial information through non-negativity and inner-product structure, forming a cognitive map.
New method to classify simple Smale flows on S3.
problem Classifying simple Smale flows on S3. method Embedded template and Kauffman's invariant of spatial graphs.
result Isotopic classification of simple Smale flows on S3. Two natural generalizations of knot theory are the study of spatially embedded graphs, and Kauffman's theory of virtual knots. In this paper we combine these approaches to begin the study of virtual spatial graphs.
Smart app tracks relapse history and predicts relapse based on spatial-temporal factors.
problem Relapse prevention for alcohol and tobacco addiction users.
method Records user profiles, tracks relapse history, uses machine learning for prediction, and recommends activities.
result Predictive machine learning algorithms help in preventing relapse.
GSNE improves house price predictions by embedding geo-spatial context.
problem Lack of contextual information in house price prediction models.
method Geo-Spatial Network Embedding (GSNE) using graph neural networks.
result GSNE embeddings consistently improve house price prediction performance.
Study uses trajectory embedding to measure place function similarity at fine spatial granularity.
problem Measuring place function similarity at fine spatial granularity.
method Trajectory embedding to reduce dimensions and measure similarity of place functions.
result Embedding similarity can be a metric proxy for place functions at fine spatial granularity.
DMSTF models spatio-temporal data with deep Markov priors.
problem Analyzing nonlinear multimodal spatio-temporal dynamics.
method Deep Markov spatio-temporal factorization with stochastic variational inference.
result DMSTF outperforms other methods in predictive performance and clustering.
Spatial first differences used to estimate effects of unobservable geographic factors on agricultural productivity.
problem Estimating causal effects in the presence of unobservable heterogeneity.
method Developed a cross-sectional research design using spatial first differences (SFD) to identify causal effects.
result New estimates for the effects of time-invariant geographic factors on long-run agricultural productivities.
The paper studies tunnel and bridge numbers of composite genus 2 spatial graphs.
problem Understanding the tunnel and bridge numbers of composite genus 2 spatial graphs.
method Analyzes connected sum and trivalent vertex sum operations on genus 2 spatial graphs, proving bounds for tunnel and bridge numbers.
result Sharp bounds for the tunnel number of composite genus 2 spatial graphs, including lower bounds for bridge numbers.
We construct a series of finitely presented semigroups. The centers of these semigroups encode uniquely up to rigid ambient isotopy in 3-space all non-oriented spatial graphs. This encoding is obtained by using three-page embeddings of graphs into the product of the line with the cone on three points. By exploiting thr…
Characterizes graphs with leveled embeddings and introduces new graph invariants.
problem Understanding the properties of leveled embeddings in spatial graphs.
method Characterization of graphs with leveled embeddings, introduction of new invariants.
result Characterization of graphs with low level number and determination of specific invariants for complete graphs and complete bipartite graphs.
SCNode improves node embeddings for GNNs in both homophilic and heterophilic graphs.
problem Challenges in node representation quality and generalization in GNNs, especially in heterophilic graphs.
method SCNode integrates spatial and contextual information to create more discriminative and structurally aware node embeddings.
result SCNode achieves superior performance over conventional GNN models on benchmark datasets.
Proves minimal crossing diagrams for specific spatial graphs.
problem Proving minimal crossing diagrams for spatial graphs.
method Analyzing adequate diagrams and replacing vertices and edges.
result All 1-vertex spatial graphs with adequate diagrams have minimal crossing number.
New proof shows no flat embedding for Petersen family graphs.
problem Proving Petersen family graphs have no flat embeddings.
method Applying Böhme's Lemma and the Jordan-Brouwer Separation Theorem.
result Every Petersen family graph has no flat embedding.
Models learn spatial templates from implicit language, predicting spatial arrangements with high accuracy.
problem Predicting spatial arrangements from implicit spatial language.
method Simple neural-based models leveraging annotated images and structured text.
result Models can predict spatial arrangements from implicit spatial language with high accuracy, even for unseen objects.
New modularity function improves clustering of spatially embedded networks.
problem Improving clustering in spatially embedded networks for unsupervised learning.
method Developed a new modularity function and compared its performance with existing methods.
result Our modularity function outperforms existing methods in partitioning 2D and 3D granular assemblies.
The paper introduces groupoid racks for spatial surfaces.
problem Coloring diagrams of spatial surfaces for invariant calculation.
method Introduces groupoid racks with universal properties.
result Groupoid racks provide an invariant for spatial surfaces.
In a spatially embedded network, that is a network where nodes can be uniquely determined in a system of coordinates, links' weights might be affected by metric distances coupling every pair of nodes (dyads). In order to assess to what extent metric distances affect relationships (link's weights) in a spatially embedde…
SXL embeds spatial autocorrelation into neural networks for better geographic data learning.
problem Difficulties in learning spatial effects for neural networks in geographic data.
method SXL uses auxiliary tasks and autoregressive embeddings to learn spatial autocorrelation.
result SXL improves neural network training in unsupervised and supervised learning tasks.
We develop a machine learning approach to represent and analyze the underlying spatial structure that governs shot selection among professional basketball players in the NBA. Typically, NBA players are discussed and compared in an heuristic, imprecise manner that relies on unmeasured intuitions about player behavior. T…
Proposes flexible spatial models for better understanding spatial heterogeneity.
problem Poor characterisation of spatial heterogeneity in conventional models.
method Spatial Bayesian Neural Networks (SBNNs) incorporating a spatial embedding layer and possibly spatially-varying parameters.
result SBNNs better match the finite-dimensional distribution of target spatial processes.
SPACY discovers causal graphs from spatiotemporal data using variational inference.
problem Inferring causal relationships from high-dimensional spatiotemporal data with complex correlations.
method SPACY uses variational inference to model latent time series and their causal relationships, incorporating spatial factors to aggregate correlated data.
result SPACY outperforms state-of-the-art methods on synthetic and real-world data, identifying key causal phenomena.
The paper introduces a new coloring invariant for spatial surfaces using a multiple group rack.
problem Distinguishing spatial surfaces embedded in the 3-sphere.
method Defined a coloring invariant using a multiple group rack.
result Introduced a new invariant to distinguish spatial surfaces.
EFA extends self-attention to handle mixed data types and dynamic relevance.
problem Handling high-dimensional, mixed data types with dynamic relevance.
method Probabilistic generative model using self-attention and latent factor model.
result EFA consistently outperforms existing models in complex latent structure capture and reconstruction.
Proposes SPE for robust speaker verification.
problem Improving text-independent speaker verification accuracy.
method Spatial pyramid encoding and deep length normalization.
result Proposed system outperforms i-vector and d-vector baselines.
Dynamic model captures spatial, temporal, and spatiotemporal volatility effects.
problem Analyzing volatility in spatial and temporal networks.
method Dynamic spatiotemporal and network ARCH model with common factors, Bayesian estimation.
result Model captures strong spatial/network interactions and spillover effects.
This paper improves MARL for networked systems through new protocols and discount factors.
problem Improving control in networked systems using multi-agent reinforcement learning.
method Formulated as a spatiotemporal Markov decision process, introduced a spatial discount factor, and proposed NeurComm.
result Appropriate spatial discount factor enhances learning curves of non-communicative MARL algorithms.
A new tensor decomposition method for fMRI data captures both spatial and temporal variability.
problem Challenges in modeling shared and subject-specific structure in multisubject spatiotemporal data, especially in neuroimaging.
method Introduces a spatiotemporal variational tensor decomposition (ST-VTD) framework combining tensor factorization with structured priors for flexible representation of spatial and temporal dynamics.
result Significantly improves latent factor recovery in fMRI data compared to classical and probabilistic decomposition benchmarks.
We consider the vacuum Einstein flow with a positive cosmological constant on spatial manifolds of product form. In spatial dimension at least four we show the existence of continuous families of recollapsing models whenever at least one of the factors or admits a Riemannian Einstein metric with positive Einstein const…
Spatial ABM predicts housing market trends in Sydney.
problem Inadequate spatial modeling in housing market forecasts.
method Graph-based spatial agent-based model incorporating social and economic factors.
result Model accurately predicts market trends and local area-specific forecasts.
Proposes TS-NMF for 2D clustering, preserving spatial info.
problem Loss of spatial information in 2D data.
method Semi-Nonnegative Matrix Factorization with manifold learning.
result Improves clustering performance compared to state-of-the-art.
We introduce invariants of spatial graphs related to the Wu invariant and the Simon invariant, and apply them to prove that certain graphs are intrinsically chiral, and to obtain lower bounds for the minimal crossing number of embedded graphs.
We consider the group of isotopy classes of automorphisms of the 3-sphere that preserve a spatial graph or a handlebody-knot embedded in it. We prove that the group is finitely presented for an arbitrary spatial graph or a reducible handlebody-knot of genus two. We also prove that the groups for "most" irreducible genu…
Study on spatial graphs and their constituent knots, linking polynomial invariants.
problem Understanding the polynomial invariants of spatial graphs and their constituent knots.
method Analyzing spatial K4 graphs, constructing band surfaces, and relating polynomials. result Relations between Yamada/Jaeger polynomials and Jones polynomials of constituent knots and associated links.