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.
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.
Model shows how centralization occurs in cryptocurrency mining.
problem Centralization of reward and computational power in Bitcoin-like cryptocurrencies.
method Mean field game model to study miner competition and reward distribution.
result Heterogeneity of initial wealth leads to greater imbalance in reward distribution.
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.
Enhances distributed Apriori-like frequent itemsets mining performance.
problem Improving performance of distributed Apriori-like frequent itemsets mining.
method Presented a new distributed approach considering Apriori algorithm's characteristics and distribution aspects.
result The proposed approach significantly enhances performance and achieves good scalability compared to a typical distributed Apriori algorithm.
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.
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.
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%.
Study shows Bitcoin security tied to mining rewards and prices.
problem Understanding Bitcoin security's dependency on market outcomes.
method Used ARDL approach with daily blockchain and Bitcoin data from 2014-2019.
result Bitcoin security outcomes linked to Bitcoin price and mining rewards.
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.
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…
mixEHR model reveals latent disease topics from EHR data.
problem Mining heterogeneous, non-randomly missing EHR data.
method Generative model integrating collaborative filtering and latent topic models.
result mixEHR reveals meaningful multi-disease insights and outperforms previous methods.
Discovering statistically significant patterns from databases is an important challenging problem. The main obstacle of this problem is in the difficulty of taking into account the selection bias, i.e., the bias arising from the fact that patterns are selected from extremely large number of candidates in databases. In …
We present a novel algorithm, Westfall-Young light, for detecting patterns, such as itemsets and subgraphs, which are statistically significantly enriched in one of two classes. Our method corrects rigorously for multiple hypothesis testing and correlations between patterns through the Westfall-Young permutation proced…
Method extracts taint flows to classify Bitcoin mining pools.
problem Understanding pseudonymous Bitcoin actors and their transactions.
method Taint analysis and graph embedding methods applied to taint flows.
result Taint flows from the same period show high similarity.
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.
S2M optimizes mining for diverse data subpopulations.
problem Scalability and uniformity in training sets with many labels and diverse data.
method Doubly-stochastic mining (S2M) computes per-example and minibatch losses on hardest labels/examples.
result S2M ensures good performance across all data subpopulations.
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.
Game-theoretic analysis of mining gaps in blockchain systems.
problem Strategic mining behavior and its impact on blockchain stability.
method Game-theoretic model and Nash equilibrium analysis.
result Mining gaps can destabilize blockchain systems, especially with decreasing block rewards.
Alpha-GPT mines new trading signals with human-AI interaction.
problem Mining new alphas for effective trading signals.
method Human-AI interaction and prompt engineering algorithmic framework.
result Demonstrates Alpha-GPT's effectiveness in generating creative, insightful, and effective alphas.
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…
Data preprocessing improves data quality for robust data mining.
problem Noisy and incomplete data hinders data mining models.
method Overview of data cleaning, transformation, and preprocessing methods.
result Preprocessing significantly affects data mining model performance.
This paper categorizes and analyzes existing outlying aspect mining methods.
problem Finding unique features in data objects that differ from others.
method Grouping and analyzing existing outlying aspect mining approaches in three categories.
result Comparison of strengths, weaknesses, and time complexities of different techniques.
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.
Game theory shows miners' hardware improvements don't centralize mining.
problem Decentralization of cryptocurrency mining.
method Game-theoretical model of mining efficiency and competition.
result Advancements in mining hardware efficiency do not lead to centralization.
DataLearner simplifies data mining on Android devices.
problem Lack of general-purpose data-mining tools for mobile devices.
method Augments Weka engine with Charles Sturt University algorithms, providing 40 mining algorithms.
result Delivers classification accuracy similar to PCs/laptops with acceptable speed and battery life.
New estimator improves reliability of KL divergence estimation.
problem Estimating KL divergence reliably and efficiently.
method Proposes a new estimator using Reproducing Kernel Hilbert Space.
result Proposed estimator is consistent and more reliable for small datasets.
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.
Paper detects common subtrees with identical labels in trees.
problem Finding common subtrees with identical label distribution in tree data.
method Developed an algorithm for tree isomorphism and a new compression scheme for trees.
result The method efficiently finds and compresses common subtrees with identical labels.
A new method for efficient label retrieval in large output spaces.
problem Efficiently retrieving relevant labels for inputs with large output spaces.
method Developed a technique called Stochastic Negative Mining to address the problem of set-valued classifiers in large output spaces.
result Stochastic Negative Mining outperforms existing negative sampling approaches in experiments.
Agricultural research has been profited by technical advances such as automation, data mining. Today, data mining is used in a vast areas and many off-the-shelf data mining system products and domain specific data mining application soft wares are available, but data mining in agricultural soil datasets is a relatively…
Frequent Itemsets (FIs) mining is a fundamental primitive in data mining. It requires to identify all itemsets appearing in at least a fraction θ of a transactional dataset D. Often though, the ultimate goal of mining D is not an analysis of the dataset \emph{per se}, but the understanding of …
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…
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.
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…
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.
Safe Pattern Pruning reduces pattern explosion in predictive pattern mining.
problem Exponential growth of patterns in structured data.
method Safe Pattern Pruning (SPP) method.
result Effective model building in practical data analysis.
This document describes an approach to the problem of predicting dangerous seismic events in active coal mines up to 8 hours in advance. It was developed as a part of the AAIA'16 Data Mining Challenge: Predicting Dangerous Seismic Events in Active Coal Mines. The solutions presented consist of ensembles of various pred…
In January 3, 2009, Satoshi Nakamoto gave rise to the "Bitcoin Block Chain" creating the first block of the chain hashing on his computers central processing unit (CPU). Since then, the hash calculations to mine Bitcoin have been getting more and more complex, and consequently the mining hardware evolved to adapt to th…
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.
MotiFiesta learns network motifs efficiently.
problem Efficiently identifying network motifs in real-world datasets.
method Formulated as a node labelling task, using machine learning.
result Demonstrated efficient motif discovery on challenging datasets.
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.
Peer-reviewed research and mined data predict stock returns similarly.
problem Predicting stock returns using research quality.
method Cross-sectional analysis of 29,000 accounting ratios with t-statistics > 2.0.
result Post-sample performance is largely independent of whether the predictor is peer-reviewed or mined.
New MI bounds improve estimation in deep generative models.
problem Estimating mutual information without density information is intractable.
method Importance sampling, Annealed Importance Sampling, Generalized IWAE, MINE-AIS.
result Improved bounds for estimating mutual information in deep models.