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,786 papers · 148 categories

Trend · papers per month

13.0%26.0%39.0%52.0% · Jun 202019922001200920172026
48 results for distributed data mining

The paper explores how mining costs, rewards, and blockchain security are interconnected.

problem Understanding the interdependencies between mining costs, mining rewards, and blockchain security.
method Theoretical derivation and empirical analysis using daily crypto market data and autoregressive distributed lag approach.
result Cryptocurrency price and mining rewards are intrinsically linked to blockchain security outcomes.

Study predicts shear stress in compound channels using data mining and machine learning.

problem Predicting shear stress distribution in symmetric compound channels.
method Conducted experiments to measure shear stress. Used data mining and machine learning models (RF, M5P, RC, KStar, AR) to predict.
result Random Forest (RF) model showed highest accuracy with R2=0.9.

This paper proposes a communication-efficient distributed algorithm for high-dimensional data mining.

problem Reducing communication time and rounds in distributed data mining.
method Straggler-agnostic and bandwidth-efficient distributed primal-dual algorithm.
result Guaranteed linear convergence rate for convex problems.

New method samples triplets from data distributions for training Triplet networks.

problem Training robust Triplet networks with discriminative triplets.
method Bayesian updating of multivariate normal distributions for dynamic class embedding sampling.
result Experimental validation on MNIST and histopathology CRC datasets shows effectiveness of the proposed method.

ATOM improves robust OOD detection by mining informative auxiliary examples.

problem Robust OOD detection in open-world settings is challenging due to adversarial inputs.
method ATOM combines adversarial training with outlier mining to improve robustness.
result ATOM achieves state-of-the-art performance in OOD detection, reducing FPR by up to 57.99%.

In the field of exploratory data mining, local structure in data can be described by patterns and discovered by mining algorithms. Although many solutions have been proposed to address the redundancy problems in pattern mining, most of them either provide succinct pattern sets or take the interests of the user into acc…

2017-02-07abs ↗pdf ↗

CURIE uses cellular automata to detect concept drift in data streams.

problem Detecting changes in data distribution (concept drift) in data streams.
method CURIE represents data stream distribution in a cellular automata grid and uses its neighborhood rule to detect changes.
result CURIE, when hybridized with base learners, performs competitively in detection metrics and classification accuracy.

Distributed, online data mining systems have emerged as a result of applications requiring analysis of large amounts of correlated and high-dimensional data produced by multiple distributed data sources. We propose a distributed online data classification framework where data is gathered by distributed data sources and…

2013-07-02abs ↗pdf ↗

The paper analyzes market risk factors for a mining company using a VAR model with stable distribution.

problem Understanding mid- and long-term dynamics of market risk factors for a mining company.
method Two-dimensional vector autoregressive (VAR) model with α-stable distribution, identifying two regimes.
result Derives dynamics of copper price in PLN, crucial for company risk exposure.

Data mining is about obtaining new knowledge from existing datasets. However, the data in the existing datasets can be scattered, noisy, and even incomplete. Although lots of effort is spent on developing or fine-tuning data mining models to make them more robust to the noise of the input data, their qualities still st…

2019-06-20abs ↗pdf ↗

This paper tracks coin circulation in Bitcoin to identify miners and analyze mining pool structures.

problem Identifying and understanding Bitcoin miners and their profit distribution schemes.
method Constructs fresh coin circulation networks and uses a heuristic algorithm to compare networks from different mining pools.
result Infers common profit distribution schemes of Bitcoin mining pools and observes an increasing trend in miner numbers.

QuantaAlpha uses evolutionary algorithms to mine financial alpha robustly across market distributions.

problem Challenges in alpha mining due to market noise and regime shifts.
method Evolutionary framework treating each mining run as a trajectory, mutation, crossover, targeted revision, and reuse of effective patterns.
result Consistent gains over strong baselines and prior systems, achieving high IC and ARR.

The problem of frequent pattern mining has been studied quite extensively for various types of data, including sets, sequences, and graphs. Somewhat surprisingly, another important type of data, namely rank data, has received very little attention in data mining so far. In this paper, we therefore addresses the problem…

2018-06-15abs ↗pdf ↗

Paper proposes a new REINFORCE algorithm for mining formulaic alpha factors with reduced variance.

problem Mining formulaic alpha factors with interpretability and robustness in volatile markets.
method Developed a novel REINFORCE algorithm with a dedicated baseline and reward shaping.
result Boosts correlation with returns by 3.83% and enhances excess returns compared to existing methods.

MCRapper efficiently computes patterns in data using Monte-Carlo Rademacher Averages.

problem Finding statistically significant patterns in data with limited samples.
method Monte-Carlo Empirical Rademacher Averages (MCERA) for poset families.
result MCRapper provides upper bounds to the discrepancy of functions, enabling efficient pattern mining.

This paper introduces C-DSL to improve data mining outcomes by considering context.

problem Data collection ambiguities, data imbalance, hidden biases, lack of domain info, and data incompleteness.
method Developed Context-Driven Data Science Lifecycle (C-DSL) to address data quality issues.
result Tangible improvements to data mining outcomes were achieved through C-DSL.

Confidence intervals improve evaluation of binary prediction rules in data mining.

problem Uncertainty in performance measures estimation from finite datasets.
method Asymptotic normal approximations for confidence intervals, with a blurring correction.
result Improved finite sample coverage probabilities and general performance measures inference.

With the growing interest on Network Analysis, Relational Data Mining is becoming an emphasized domain of Data Mining. This paper addresses the problem of extracting representative elements from a relational dataset. After defining the notion of degree of representativeness, computed using the Borda aggregation procedu…

2012-07-03abs ↗pdf ↗

Paper presents a framework to automatically discover constraints from data.

problem Discovering constraints from data for structured output prediction.
method Formulates structured output prediction as ILP, mines constraints by estimating polytopes of feasible set.
result Successfully identifies feasible sets and constraints for various tasks.

We propose a new class of metrics on sets, vectors, and functions that can be used in various stages of data mining, including exploratory data analysis, learning, and result interpretation. These new distance functions unify and generalize some of the popular metrics, such as the Jaccard and bag distances on sets, Man…

2016-03-22abs ↗pdf ↗

Randomization helps verify if data mining results are due to inherent patterns.

problem Verify if data mining results are due to inherent patterns or coincidental findings.
method Metropolis sampling based on local swaps to randomize data while preserving discovered patterns.
result Randomized data often reveals that clustering results imply frequent pattern discovery.

Paper presents a new method for privacy-preserving GLMs on vertically partitioned data.

problem Privacy concerns and data sharing restrictions in collaborative data mining.
method Distributed block coordinate descent algorithm for generalized linear models.
result The method achieves accurate standard errors without additional communication cost.

This paper applies secure multi-party computation to K-means clustering to protect private data.

problem Privacy-preserving K-means clustering for distributed private data.
method Secure multi-party computation (MPC) techniques to protect private data during K-means clustering.
result Privacy-preserving K-means clustering is feasible and effective for both horizontal and vertical data distribution.

The process of exploring and exploiting Oil and Gas (O&G) generates a lot of data that can bring more efficiency to the industry. The opportunities for using data mining techniques in the "digital oil-field" remain largely unexplored or uncharted. With the high rate of data expansion, companies are scrambling to develo…

2017-05-09abs ↗pdf ↗

A new framework for mining high utility patterns in interval-based sequences.

problem Mining patterns in events that persist over varying time intervals and considering event utility.
method Integrates utility into interval-based sequences and proposes HUIPMiner algorithm with pruning strategy.
result HUIPMiner efficiently finds high utility patterns in real datasets.