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

Trend · papers per month

3979118157 · Jun 202019922001200920172026
48 results for Mining Environment

Paper uses SSD to detect miners' activities in a mining environment.

problem Tracking miners' activities in a mining environment with little obstruction.
method Used SSD trained on COCO dataset to detect miners' activities. Implemented machine learning algorithms using Tensorflow and C++.
result Improved accuracy of detecting miners' activities through data fusion.

In data stream mining, predictive models typically suffer drops in predictive performance due to concept drift. As enough data representing the new concept must be collected for the new concept to be well learnt, the predictive performance of existing models usually takes some time to recover from concept drift. To spe…

2019-01-07abs ↗pdf ↗

Recently, a wide range of smart devices are deployed in a variety of environments to improve the quality of human life. One of the important IoT-based applications is smart homes for healthcare, especially for elders. IoT-based smart homes enable elders' health to be properly monitored and taken care of. However, elder…

2018-08-18abs ↗pdf ↗

Process mining is a research field focused on the analysis of event data with the aim of extracting insights in processes. Applying process mining techniques on data from smart home environments has the potential to provide valuable insights in (un)healthy habits and to contribute to ambient assisted living solutions. …

2016-09-12abs ↗pdf ↗

Study proposes a novel local explanation method for deep learning classifiers in process mining.

problem Lack of interpretability in deep learning models for process mining.
method Defines local regions using latent space representations and visualizes explanations.
result Deep learning classifier achieves high performance and local explanations increase user trust.

SDSM extracts statistically significant sub-trajectories from large trajectory datasets.

problem Discerning moving patterns that are more characteristic of one group of trajectories than another.
method Statistically Discriminative Sub-trajectory Mining (SDSM) method using tree representation and permutation-based statistical inference.
result SDSM efficiently extracts statistically significant sub-trajectories from massive trajectory datasets.

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 goal of machine learning is to provide solutions which are trained by data or by experience coming from the environment. Many training algorithms exist and some brilliant successes were achieved. But even in structured environments for machine learning (e.g. data mining or board games), most applications beyond the…

2011-05-10abs ↗pdf ↗

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.

Paper presents a fast framework for root cause analysis in large-scale systems.

problem Challenges in reviewing logs for identifying issues in large-scale production environments.
method Automates root cause analysis on structured logs with improved scalability using frequent item-set mining and association rule learning.
result Proposes a framework that selects unique item-sets for target failures, improving interpretability and scalability.

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.

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.

We argue that the estimation of mutual information between high dimensional continuous random variables can be achieved by gradient descent over neural networks. We present a Mutual Information Neural Estimator (MINE) that is linearly scalable in dimensionality as well as in sample size, trainable through back-prop, an…

2018-01-12abs ↗pdf ↗

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.

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.

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 ↗

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.

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.

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.

Recent sequential pattern mining methods have used the minimum description length (MDL) principle to define an encoding scheme which describes an algorithm for mining the most compressing patterns in a database. We present a novel subsequence interleaving model based on a probabilistic model of the sequence database, w…

2016-02-16abs ↗pdf ↗

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 ↗