arXiv research

This paper improves image super-resolution by integrating cross-scale non-local attention.

Exploiting dependencies between labels is considered to be crucial for multi-label classification. Rules are able to expose label dependencies such as implications, subsumptions or exclusions in a human-comprehensible and interpretable manner. However, the induction of rules with multiple labels in the head is particul…

This paper exhausts curve complexes on non-orientable surfaces.

Probabilistic model for exhaustion in infinite-genus curve complexes.

grangersearch tests causal relationships in time series data.

Clustering consists of grouping together samples giving their similar properties. The problem of modeling simultaneously groups of samples and features is known as Co-Clustering. This paper introduces ROCCO - a Robust Continuous Co-Clustering algorithm. ROCCO is a scalable, hyperparameter-free, easy and ready to use al…

Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components. Let $\mathcal{C}(N)$ be the curve complex of $N$. We prove that if $(g,n) = (3,0)$ or $g + n \geq 5$, then there is an exhaustion of $\mathcal{C}(N)$ by a sequence of finite rigid sets. This improves the author's result on…

Let $S$ be a connected orientable surface of finite topological type. We prove that there is an exhaustion of the curve complex $\mathcal{C}(S)$ by a sequence of finite rigid sets.

Researchers solved a model of an exhaustible resource with stochastic discoveries.

Game-theoretic analysis of mining gaps in blockchain systems.

We propose a K-sparse exhaustive search (ES-K) method and a K-sparse approximate exhaustive search method (AES-K) for selecting variables in linear regression. With these methods, K-sparse combinations of variables are tested exhaustively assuming that the optimal combination of explanatory variables is K-sparse. By co…

Alpha-GPT mines new trading signals with human-AI interaction.

The paper explores how mining costs, rewards, and blockchain security are interconnected.

FLFE improves machine learning by efficiently and securely transforming features.

This paper categorizes and analyzes existing outlying aspect mining methods.

Game theory shows miners' hardware improvements don't centralize mining.

In this note, we prove an existence result on exhaustion functions adapting the method by L.-F. Tam. Then we apply it to prove short-time existence of Ricci flow and study Yau's uniformization conjecture using similar method as Fei He and Lee-Tam.

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

Data mining is about obtaining new knowledge from existing datasets. However, the data in the existing datasets can be scattered, noisy, and even incomplete. Although lots of effort is spent on developing or fine-tuning data mining models to make them more robust to the noise of the input data, their qualities still st…

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…

We prove that if a smoothly bounded strongly pseudoconvex domain $D \subset \mathbb C^n$, $n \geq 2$, admits at least one Monge-Ampère exhaustion smooth up to the boundary (i.e. a plurisubharmonic exhaustion $τ: \overline D \to [0,1]$, which is $\mathcal C^\infty$ at all points except possibly at the unique minimum poi…

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.

Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components. Let $\mathcal{C}(N)$ be the curve complex of $N$. We prove that if $(g, n) \neq (1,2)$ and $g + n \neq 4$, then there is an exhaustion of $\mathcal{C}(N)$ by a sequence of finite superrigid sets.

Smartphones have become the ultimate 'personal' computer, yet despite this, general-purpose data-mining and knowledge discovery tools for mobile devices are surprisingly rare. DataLearner is a new data-mining application designed specifically for Android devices that imports the Weka data-mining engine and augments it …

A new framework for mining high utility patterns in interval-based sequences.

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…

Safe Pattern Pruning reduces pattern explosion in predictive pattern mining.

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…

The paper explores uniform perfectness and centers in Morse boundaries.

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…

Proposes a taxonomy for economic policies.

The paper studies Kähler metrics from finite Monge-Ampère mass exhaustion functions.

MotiFiesta learns network motifs efficiently.

We consider three fundamental classes of compact almost homogeneous manifolds and show that the complements of singular complex orbits in such manifolds are endowed with plurisubharmonic exhaustions satisfying complex homogeneous Monge-Ampère equations. This extends to a new family of mixed type examples various classi…

Study shows Bitcoin security tied to mining rewards and prices.

Peer-reviewed research and mined data predict stock returns similarly.

Regularity properties of intrinsic objects for a large class of Stein Manifolds, namely of Monge-Ampère exhaustions and Kobayashi distance, is interpreted in terms of modular data. The results lead to a construction of an infinite dimensional family of convex domains with squared Kobayashi distance of prescribed regula…

In this paper, aimed at exploring the fundamental properties of isoperimetric region in $3$-manifold $(M^3,g)$ which is asymptotic to Anti-de Sitter-Schwarzschild manifold with scalar curvature $R\geq -6$, we prove that connected isoperimetric region $\{D_i\}$ with $\mathcal{H}_g ^3(D_i)\geq δ_0>0$ cannot slide off to …

Proposes SCR-Apriori for efficient mining of SCR-patterns.

The last decade has seen a flurry of research on all-pairs-similarity-search (or, self-join) for text, DNA, and a handful of other datatypes, and these systems have been applied to many diverse data mining problems. Surprisingly, however, little progress has been made on addressing this problem for time series subseque…

By a theorem of Greene and Wu, a noncompact connected Riemannian manifold admits a smooth strictly subharmonic exhaustion function. Demailly provided an elementary proof of this fact. A further simplification of Demailly's proof and some (mostly known) applications are described. Applications include the fact that the …

QuantaAlpha uses evolutionary algorithms to mine financial alpha robustly across market distributions.

Paper proposes using pairwise feature comparisons to infer modification costs for user recourse.

AlphaEval evaluates alpha mining models efficiently and comprehensively.

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…

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

For an orientable surface $S$ of finite topological type with genus $g \geq 3$, we construct a finite set of curves whose union of iterated rigid expansions is the curve graph of $S$. The set constructed, and the method of rigid expansion, are closely related to Aramayona and Leiniger's finite rigid set, and in fact a …