GCBS improves contrastive learning performance efficiently.
problem Efficiently mining hard negatives for contrastive learning.
method Global Contrastive Batch Sampling (GCBS) approximates batch assignment problem.
result GCBS improves state-of-the-art performance in sentence embedding and code-search tasks.
Paper improves zero-shot classification by mining hard negative pairs.
problem Zero-Shot Classification (ZSC) problems.
method Metric learning with controlled negative pairs.
result Significant improvement in performance on ZSC datasets.
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.
Paper compares NMF and LDA for topic labeling in customer communications.
problem Automatically labeling topics in customer inquiries.
method Uses NMF and LDA for topic mining and labeling.
result Proposes methods for automated topic subject labeling.
New biclustering algorithms for microarray data using Formal Concept Analysis.
problem Uncovering patterns in gene expression data matrices.
method Formal Concept Analysis and Association Rules.
result Promising results from proposed biclustering algorithms.
EBMs improve text discrimination by generating negatives from auto-regressive models.
problem Discriminating machine-generated text from human-generated text.
method Use energy-based models to discriminate text, generating negatives using pre-trained auto-regressive language models.
result EBMs can generalize well to changes in generator architectures but are sensitive to training set.
This paper evaluates how dirty data affects data mining and machine learning results.
problem Negative impacts of dirty data on data mining and machine learning results.
method Experimental comparison of missing, inconsistent, and conflicting data on classification and clustering algorithms.
result Guidelines for algorithm selection and data cleaning based on experimental findings.
Study discovers semantic patterns in consumer sentiment on social media.
problem Identifying semantic patterns in consumer sentiment expressed in tweets.
method Cosine similarity, K-means clustering, and Latent Dirichlet Allocation (LDA) were used.
result Identified latent topics representing consumer opinions on social media.
NegPSpan extracts negative sequential patterns efficiently.
problem Mining negative sequential patterns in sequence datasets.
method PrefixSpan depth-first scheme with maxgap constraints.
result NegPSpan extracts meaningful negative sequential patterns.
Paper introduces impact curves for evaluating binarized regression models with varying costs.
problem Evaluating binarized regression models with varying costs and instance-specific utility.
method Proposes impact curves to optimize binary decisions across different utilities.
result Impact curves identify conditions where one model is favored over another and quantify model improvement.
A new method for PU learning improves classification error on CIFAR-10.
problem Learning from positive and unlabeled data in practical applications.
method A simple yet effective data augmentation method based on consistency regularization.
result Achieves an averaged improvement of 3.40 points in classification error on CIFAR-10.
New method accelerates large margin metric learning for nearest neighbor classification.
problem Efficiently learning metrics for nearest neighbor classification.
method Triplet mining and stratified sampling for large margin metric learning.
result Improved efficiency and scalability of optimization.
New method discovers time series motifs in datasets with missing data.
problem Missing data hinders motif discovery in time series.
method Admissible time series motif discovery technique for datasets with missing data.
result Proves method is admissible, producing no false negatives.
MPI-FAUN tackles NMF for big data, offering scalable parallel algorithms.
problem Efficient parallel algorithms for NMF on big data.
method MPI-based framework for NMF, solving alternating NLS subproblems.
result Significant performance improvements over baseline implementations.
Paper bounds NMF's generalization error using Bayesian learning.
problem Unclear theoretical optimization of NMF as a learning machine.
method Real log canonical threshold and Bayesian learning applied to NMF.
result Generalization error of NMF can be smaller than regular models.
SONMF reduces ED crowding by predicting patient dispositions from triage notes.
problem Crowded Emergency Departments and delayed patient admissions.
method Semi-orthogonal Non-negative Matrix Factorization (SONMF) for text mining.
result SONMF improves classification accuracy and interpretability of patient notes.
Study uses NMF to analyze multimorbidity patterns in large EHR dataset.
problem Understanding and quantifying multimorbidity patterns over time.
method Non-negative Matrix Factorisation (NMF) for temporal phenotyping.
result Temporal characteristics of disease clusters reveal new multimorbidity patterns.
Improves financial sentiment analysis using performance indicators.
problem Accurately predicting the polarity of financial texts.
method Association rule mining based hierarchical sentiment classifier model using financial and non-financial performance indicators.
result The proposed model outperforms other state-of-the-art approaches.
Optimising black-box functions is important in many disciplines, such as tuning machine learning models, robotics, finance and mining exploration. Bayesian optimisation is a state-of-the-art technique for the global optimisation of black-box functions which are expensive to evaluate. At the core of this approach is a G…
Reduces false positives in lung nodule detection by using unlabeled data.
problem Lack of labeled data for training supervised algorithms in medical imaging.
method Uses pseudo-negative labels from unlabeled data to refine a pulmonary nodule detection network.
result False positive rate reduced from 0.4864 to 0.1266 while maintaining sensitivity.
Study analyzes Twitter tweets to identify negative sentiments about obesity, diet, diabetes, and exercise.
problem Understanding public opinions and sentiments about obesity, diet, diabetes, and exercise.
method Uses sentiment analysis and topic modeling on 6 million Twitter tweets.
result Identifies prominent topics related to negative sentiments about DDEO (diet, diabetes, exercise, obesity).
Proposes a novel method for generating hard negatives near time series data boundaries.
problem Challenges in generating effective negative samples for time series anomaly detection.
method Reconstruction-driven boundary negative generation framework using reinforcement learning.
result Improves anomaly representation learning and achieves competitive detection performance.
New graph-based method selects outlier ensemble components.
problem Poor components negatively affect consensus results in outlier ensembles.
method Mapping rankings to graphs, mining to identify subsets.
result Our method outperforms state-of-the-art techniques.
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.
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.
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.
Cluster analysis is a field of data analysis that extracts underlying patterns in data. One application of cluster analysis is in text-mining, the analysis of large collections of text to find similarities between documents. We used a collection of about 30,000 tweets extracted from Twitter just before the World Cup st…
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.
Agent-based model simulates Bitcoin mining economics.
problem Modeling the economics of Bitcoin mining.
method Agent-based artificial market model of Bitcoin mining and transactions.
result Model reproduces key financial features of Bitcoin.
New R package for NMF evaluated on real-world data.
problem Limited comprehensive evaluations of NMF packages under real-world conditions.
method Systematic performance comparison of three NMF packages using real-world data.
result New package outperforms existing ones in computational efficiency and reconstruction accuracy.
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.
Automatically assesses the quality of online health articles.
problem Lack of automated tools to evaluate the quality of online health information.
method Data mining approach using 10 quality criteria and feature selection.
result Classifier achieved 84%-90% accuracy on 10 criteria.
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.
Estimates production function of Iran's mining sector, finding capital and labor intensive.
problem Estimating production function of Iran's mining sector.
method Used co-integration method and time-series data for 1976-2006, augmented Dickey-Fuller and Phillips-Perron tests for stationarity.
result Elasticity of production with respect to capital and labor are 0.44 and 0.41, respectively; technological progress positively affects output.
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.