Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,878 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for Data Association

Develops G-MLKM for better data-target association in constrained spaces.

problem Data-target association problem in constrained spaces with limited sensor information.
method Graph-based multi-layer k-means++ (G-MLKM) method, including MLKM for local space and G-MLKM for general constrained space.
result Improves data-target association accuracy through error correction mechanisms.

GFA model uncovers brain-behavior associations in incomplete data sets.

problem Incomplete data sets and lack of robust statistical inferences.
method Hierarchical Bayesian model that handles missing data and models modality-specific associations.
result GFA identified four relevant shared factors and predicted non-imaging measures from brain connectivity.

The data association problem is concerned with separating data coming from different generating processes, for example when data come from different data sources, contain significant noise, or exhibit multimodality. We present a fully Bayesian approach to this problem. Our model is capable of simultaneously solving the…

2018-10-16abs ↗pdf ↗

Framework uncovers symmetric and asymmetric species associations from data.

problem Retrieving bidirectional species associations from co-occurrence data.
method Machine learning framework modeling latent embeddings and joint generative model.
result Framework successfully recovers known symmetric and asymmetric associations.

New KNN test improves association analysis of high-dimensional sequencing data.

problem Challenges in using neural networks for high-dimensional sequencing data analysis.
method Kernel-based neural network (KNN) test for complex association analysis.
result KNN test outperforms SKAT in detecting non-linear and interaction effects.

The paper tests for association between latent community memberships in multi-view network data.

problem Evaluating the independence of latent community memberships in multi-view network data.
method Extended stochastic block model for two-view network data, developed a new hypothesis test.
result Evidence of weak association between latent community memberships in binary interaction and co-complex association data.

Multi-view data, that is matched sets of measurements on the same subjects, have become increasingly common with advances in multi-omics technology. Often, it is of interest to find associations between the views that are related to the intrinsic class memberships. Existing association methods cannot directly incorpora…

2018-11-20abs ↗pdf ↗

Mining association rules is an important technique for discovering meaningful patterns in transaction databases. Many different measures of interestingness have been proposed for association rules. However, these measures fail to take the probabilistic properties of the mined data into account. In this paper, we start …

2008-03-06abs ↗pdf ↗

The paper develops methods to identify stable associations across multiple studies.

problem Identifying stable associations across multiple studies with possible distributional shifts.
method Modeling heterogeneous multi-source data with multiple high-dimensional regressions and devising a novel sampling method for valid confidence intervals of maximin effects.
result Significant maximin effects indicate stable associations that can be generalized to target populations.

Unified Bayesian framework for clustered federated learning improves model performance.

problem Handling non-IID client data in federated learning.
method A unified Bayesian framework for clustered federated learning that associates clients to clusters and proposes practical algorithms for data associations.
result The proposed framework increases model performance by circumventing the need for unique client-cluster associations.

This paper gives two methods for constructing associative 3-folds in R^7, based around the fundamental idea of evolution equations, and uses these methods to construct examples of these geometric objects. The paper is a generalisation of the work by Joyce in math.DG/0008021, math.DG/0008155, math.DG/0010036 and math.DG…

2004-01-13abs ↗pdf ↗

DAM with MRL improves relational reasoning in MANNs.

problem Limited performance of associative memory networks on complex relational reasoning tasks.
method Distributed Associative Memory architecture with Memory Refreshing Loss.
result Enhanced relation reasoning performance of MANNs on long temporal sequence data.

For most problems in science and engineering we can obtain data sets that describe the observed system from various perspectives and record the behavior of its individual components. Heterogeneous data sets can be collectively mined by data fusion. Fusion can focus on a specific target relation and exploit directly ass…

2013-07-02abs ↗pdf ↗

New method for estimating spatial associations with discrete data, even under model misspecification.

problem Estimating associations between covariates and discrete responses with spatial variability and nonrandom sampling.
method Proposes a novel approach to handle spatially varying noise, provides a proof of consistency, and uses a delta method argument.
result Empirically shows reliable confidence intervals compared to standard methods, even with model misspecification.

Discovering and clustering subspaces in high-dimensional data is a fundamental problem of machine learning with a wide range of applications in data mining, computer vision, and pattern recognition. Earlier methods divided the problem into two separate stages of finding the similarity matrix and finding clusters. Simil…

2018-08-28abs ↗pdf ↗

Graph network predicts circRNA-disease associations using multi-source similarity features.

problem Identifying circRNA-disease associations is challenging and time-consuming.
method Proposes a graph convolution network framework using multi-source similarity information.
result Framework predicts circRNA-disease associations with promising results and outperforms existing methods.

The method integrates survival constraints into NMF for identifying survival-associated gene clusters.

problem Understanding and interpreting high-dimensional biological data for disease markers.
method Cox proportional hazards regression integrated with NMF via proportional hazards non-negative matrix factorization.
result The method can uncover survival-associated gene clusters in cancer gene expression data.

DEDACT breaks down feature importance into direct and associative components.

problem Lack of clear distinction between direct and associative feature importance.
method DEDACT framework to decompose direct and associative importance measures.
result Provides insight into sources of prediction-relevant information and feature pathways.

We prove the existence of "half-plane differentials" with prescribed local data on any Riemann surface. These are meromorphic quadratic differentials with higher-order poles which have an associated singular flat metric isometric to a collection of euclidean half-planes glued by an interval-exchange map on their bounda…

2013-01-02abs ↗pdf ↗

Cluster analysis methods are used to identify homogeneous subgroups in a data set. In biomedical applications, one frequently applies cluster analysis in order to identify biologically interesting subgroups. In particular, one may wish to identify subgroups that are associated with a particular outcome of interest. Con…

2013-04-13abs ↗pdf ↗

This paper is based on a previous publication [29]. Our work extends exception mining and outlier detection to the case of object-relational data. Object-relational data represent a complex heterogeneous network [12], which comprises objects of different types, links among these objects, also of different types, and at…

2018-07-01abs ↗pdf ↗

Memory capacity of DAM scales exponentially with feature separation, unaffected by correlations.

problem Understanding how feature correlations impact DAM's capacity.
method Developed an empirical framework to analyze DAM's capacity under varying feature correlations and pattern separations.
result Memory capacity scales exponentially with feature separation, unaffected by correlations.

The article develops deformation theory for ACyl associative submanifolds in ACyl G2-manifolds.

problem Deformation theory of ACyl associative submanifolds in ACyl G2-manifolds.
method Study of moduli spaces with fixed and varying asymptotic data, computing virtual dimensions.
result The moduli space of ACyl associative submanifolds embeds as a Lagrangian submanifold in the moduli space of holomorphic curves.

A federated model learns shared archetypes from heterogeneous clients in continual learning.

problem Federated learning struggles with client heterogeneity and streaming distribution shifts.
method Clients encode their data as low-rank Hebbian operators, which are sent to a central server for aggregation and factorization into global archetypes.
result Improved global archetype reconstruction and associative retrieval in heterogeneous clients, drift, and novelty settings.

DMs emerge from DenseAMs, transitioning from memorization to generalization.

problem Hindered memory retrieval in DenseAMs due to spurious states.
method Examined diffusion models through the lens of DenseAMs, focusing on their generative process.
result Identified a critical phase in DMs transitioning from memorization to generalization.

Develops methods to analyze feature-outcome associations in subpopulations.

problem Challenges in understanding feature-outcome associations in high-dimensional data.
method Geometric decomposition framework using gradient flow and co-monotonicity decomposition.
result Identifies context-dependent patterns and improves statistical power and interpretability.

Auto-Associative models cover a large class of methods used in data analysis. In this paper, we describe the generals properties of these models when the projection component is linear and we propose and test an easy to implement Probabilistic Semi-Linear Auto- Associative model in a Gaussian setting. We show it is a g…

2012-09-20abs ↗pdf ↗

CrossAD detects anomalies in time series data by considering cross-scale associations and cross-window modeling.

problem Anomaly detection in time series data is challenging due to varying patterns at different scales and fixed window sizes.
method CrossAD incorporates cross-scale reconstruction and a query library to capture dynamic cross-scale associations and comprehensive context.
result CrossAD achieves state-of-the-art performance in anomaly detection across multiple real-world datasets.

New product structures encode superintegrable Hamiltonian systems in Euclidean spaces.

problem Encoding superintegrable Hamiltonian systems using product structures.
method Introducing commutative and associative product structures on Euclidean spaces of dimension at least three, satisfying specific conditions.
result All abundant superintegrable Hamiltonian systems on Euclidean space of dimension at least three arise from these product structures.

A test for neural networks identifies genetic associations.

problem Testing complex associations in neural networks.
method Sieve quasi-likelihood ratio test for neural networks with one hidden layer.
result The test statistic has an asymptotic chi-squared distribution.