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.

169,341 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Nov 199319922001200920182026
48 results for analogy mining

Research creates parallel sentences from comparable corpora for machine translation.

problem Scarce parallel sentences limit cross-lingual applications.
method Web crawling and analogy-based heuristics for building parallel corpora.
result Improved machine translation on Polish-English pairs.

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.

This paper analyzes the profitability of selfish mining on blockchain, considering the risk of ruin.

problem The profitability of selfish mining on blockchain, considering the risk of ruin.
method Formulated a stochastic model and used tools from applied probability and analysis to determine expected profit.
result Explicit expressions for expected profit under different scenarios were derived, identifying conditions for selfish mining as a strategic advantage.

LetSIP learns relevant patterns for user interests in data mining.

problem Redundancy in pattern mining makes it hard for analysts to identify relevant patterns.
method Combines pattern sampling with interactive data mining, using user feedback to learn sampling distribution.
result Favourable trade-offs in quality-diversity and exploitation-exploration compared to existing methods.

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.

Study shows Bitcoin mining with surplus electricity can boost KEPCO's financial stability.

problem Improving energy resource efficiency and reducing KEPCO's debt.
method Utilized surplus electricity for Bitcoin mining using Antminer S21 XP Hyd, analyzed with Random Forest Regressor and Long Short-Term Memory models.
result Bitcoin mining with surplus electricity generates economic revenue, minimizes energy loss, and resolves payment issues for KEPCO.

This work improves deep metric learning by online soft mining and class-aware attention.

problem Slow convergence and poor performance due to a large fraction of trivial samples in deep metric learning.
method Online Soft Mining (OSM) and Class-Aware Attention (CAA) to select and focus on relevant samples.
result Significantly outperforms state-of-the-art methods on fine-grained visual categorization and video-based person re-identification datasets.

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.

A new model for efficient sequential pattern mining without specific encoding schemes.

problem Mining relevant sequential patterns efficiently and effectively.
method Subsequence interleaving model based on probabilistic sequence database.
result Efficient inference through submodular optimization, resulting in low spuriousness and redundancy.

Data mining enhances a heuristic for the Minimum Latency Problem.

problem Finding optimal solutions for the Minimum Latency Problem efficiently.
method Combining GRASP with data mining to find frequent patterns in high-quality solutions.
result Improved solution quality and reduced computational time compared to existing methods.

The study compares ASP encodings for sequential pattern mining tasks.

problem Efficiency of Answer Set Programming (ASP) encodings for sequential pattern mining.
method Two representations of embeddings (fill-gaps vs skip-gaps) and various types of patterns were tested.
result Fill-gaps strategy is more efficient on real problems due to lower memory consumption.

This paper discusses issues in mining user behavioral rules for context-aware mobile apps.

problem Mining contextual behavioral rules from smartphone data.
method Addressing quality of data, relevancy of contexts, discretization, rule discovery, semantic understanding, and dynamic rule updating.
result Potential solutions for mining user behavioral rules for context-aware mobile apps.

A new tool, matrix profile, finds all pair similarities in time series data.

problem Finding all pair similarities in time series data.
method Near universal time series data mining tool called matrix profile.
result Matrix profile solves the all-pairs-similarity-search problem for time series subsequences.

FedSLIM optimizes compact pattern models across distributed databases without sharing raw data.

problem Privacy-preserving federated descriptive analytics for data silos.
method Federated MDL-based framework using SLIM principle.
result FedSLIM variants preserve high-quality compression structure and recover globally informative patterns.

The paper investigates if graph embeddings capture key topological features.

problem Exploring if graph embeddings approximate traditional vertex level graph features.
method Predicting known topological features from graph embeddings using supervised and unsupervised methods.
result Several topological features are approximated by the embedding space, providing insight into how graph embeddings function.

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.

AlphaEval evaluates alpha mining models efficiently and comprehensively.

problem Lack of systematic evaluation for alpha mining models.
method Unified, parallelizable evaluation framework assessing predictive power, stability, robustness, financial logic, and diversity.
result AlphaEval achieves evaluation consistency comparable to comprehensive backtesting, providing more comprehensive insights and higher efficiency.

Study measures economic growth sources in Iran's mining sector using neoclassical growth accounting.

problem Determining the share of economic growth sources in Iran's mining sector.
method Neoclassical growth accounting approach, using production function and Solow residual equation.
result Average annual growth rate of TFP was 2.94% over 30 years.

AlphaForge mines and dynamically combines alpha factors for better investment performance.

problem Inconsistency and inflexibility of fixed factor weights in alpha factor mining.
method Generative-predictive neural network for factor generation and dynamic weight adjustment.
result Demonstrated superior performance in formulaic alpha factor mining and portfolio returns.

The purpose of this study is to estimate the production function and examine the structure of production in the mining sector of Iran. Several studies have already been conducted in estimating production functions of various economic sectors; however, less attention has been paid to mining sectors. After examining the …

2015-09-12abs ↗pdf ↗

Data mining techniques predict breast cancer types with high accuracy.

problem Early detection of breast cancer to reduce mortality rates.
method Twelve classification algorithms applied to the Breast Cancer Wisconsin dataset.
result High accuracy in predicting malignant and benign breast cancer.

AlphaSAGE mines diverse alphas via GFlowNets, overcoming RL issues.

problem Reward sparsity, inadequate sequential representations, and single optimal mode issues in RL for alphas.
method Structure-aware encoder (RGCN), GFlowNets, dense reward structure.
result Empirically outperforms existing baselines in mining diverse alphas.

New approach finds statistically significant patterns from databases.

problem Difficulty in statistically significant pattern discovery due to selection bias.
method Selective inference framework applied to pattern mining problems.
result Effective in finding statistically significant patterns from databases.

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 ↗