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.
DRUM discovers interpretable rules from knowledge graphs for unseen entities.
problem Inductive link prediction on unseen entities and lack of interpretability.
method Differentiable approach using bidirectional RNNs for low-rank tensor approximation.
result DRUM outperforms existing methods in inductive link prediction.
Improved CPI prediction for unknown compounds using PKM and LIK.
problem Poor performance of CGBVS for new compounds with unknown CPIs.
method Combining PKM with LIK and chemical similarity for link mining.
result Average AUPR value of 0.562, significantly higher than GIP method.
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.
New method detects outliers in object-relational data.
problem Detecting outliers in complex object-relational data.
method Exceptional Model Mining framework applied to object-relational data with probabilistic models and Bayesian networks.
result Novel metric based on likelihood ratio improves outlier detection accuracy.
Persona2vec learns multiple node roles in graphs.
problem Graphs often have nodes with multiple overlapping roles.
method Persona2vec learns multiple node representations based on structural contexts.
result Persona2vec outperforms state-of-the-art models in link prediction.
Data analysis and data mining are concerned with unsupervised pattern finding and structure determination in data sets. The data sets themselves are explicitly linked as a form of representation to an observational or otherwise empirical domain of interest. "Structure" has long been understood as symmetry which can tak…
Temporal networks are ubiquitous and evolve over time by the addition, deletion, and changing of links, nodes, and attributes. Although many relational datasets contain temporal information, the majority of existing techniques in relational learning focus on static snapshots and ignore the temporal dynamics. We propose…
New insights link RLHF and contrastive learning for better model alignment.
problem Aligning large language models with human values.
method Interpreting RLHF and DPO as contrastive learning methods based on mutual information.
result Proposed Mutual Information Optimization (MIO) improves model performance.
The data in many disciplines such as social networks, web analysis, etc. is link-based, and the link structure can be exploited for many different data mining tasks. In this paper, we consider the problem of temporal link prediction: Given link data for times 1 through T, can we predict the links at time T+1? If our da…
This survey analyzes knowledge discovery in cryptocurrency transactions.
problem Understanding user behaviors and collective actions in cryptocurrency transactions.
method Data mining techniques and literature review.
result Classified existing research into three aspects and discussed major findings.
Friend recommendation system using heterogeneous edge embeddings.
problem Inadequate performance of existing network embedding techniques on multi-graph social networks.
method Proposes a method to mine network representation exploiting heterogeneity in multi-graphs.
result Outperforms state-of-the-art baselines on Hike's social network in terms of accuracy and user satisfaction.
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.
Predicts coal mine seismic events up to 8 hours in advance.
problem Early detection of dangerous seismic events in coal mines.
method Ensemble machine learning models trained on various features.
result Best model achieved 0.939 AUC.
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.
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.
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.
Dual CNN for predicting links in graphs of graphs.
problem Link prediction in graphs of graphs.
method Dual Convolutional Neural Network (CNN) for combining external and internal graph structures.
result Effective link prediction on chemical network 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.
MINE uses neural networks to estimate mutual information efficiently.
problem Estimating mutual information between high-dimensional variables.
method Gradient descent over neural networks for mutual information estimation.
result MINE is linearly scalable in dimensionality and sample size, and is strongly consistent.
Paper mines rank data patterns from rankings.
problem Mining rank data patterns from rankings.
method Proposes algorithms for frequent rankings and dependencies.
result Experimental validation of algorithms on synthetic and real data.
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…
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.
SMP model preserves proximity and permutation in graph neural networks.
problem Challenges in graph mining, such as community and leader finding.
method Stochastic Message Passing (SMP) model that maintains proximity and permutation-equivariance.
result SMP model effectively preserves node proximities and permutation-equivariance.
Graph InfoClust learns node representations by capturing cluster-level information, improving graph mining tasks.
problem Leveraging cluster-level node information for unsupervised graph representation learning.
method Graph InfoClust (GIC) uses a differentiable K-means method to compute clusters and jointly optimizes mutual information between nodes of the same cluster.
result GIC outperforms state-of-the-art methods in various downstream tasks with a 0.9% to 6.1% gain.
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.
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.
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.
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.
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.
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.
SoulMate links short texts through multi-aspect embeddings.
problem Linking authors of noisy, ambiguous short texts.
method Neural network-based temporal-textual framework generating author subgraphs.
result Higher performance in linking short-text authors compared to competitors.
Proposes SCR-Apriori for efficient mining of SCR-patterns.
problem Mining high-quality `Set of Contrasting Rules'-pattern (SCR-pattern) efficiently.
method Integrates SCR-pattern structure into Apriori algorithm to prune search space.
result Significantly reduces computational cost compared to state-of-the-art.
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…
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.
This paper improves hierarchical community detection efficiency using local structural properties.
problem Efficiency of hierarchical community detection methods in large networks.
method Use of local structural network properties as proxies to improve efficiency.
result Achieves competitive results in modularity with improved efficiency.