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

Trend · papers per month

10.7%21.3%32.0%42.6% · Jun 202019922001200920172026
48 results for wine data

Investment behavior in wine industry influenced by profitability and capitalization.

problem Exploring investment dynamics in wine industry from EU largest producers.
method Firm-level data from France, Italy, and Spain (2007-2014). Difference-and system-GMM estimators used.
result Profitability positively impacts investment dynamics, while capitalization negatively impacts only in France and Spain.

There are few papers about the consumption pattern of the Portuguese wine, using econometrics techniques. This work, pretend to analyze the consumers behavior of the wine produced in Portugal, determining the demand equation with panel data methods. There were used statistical data available in the Alentejo Regional Wi…

2012-12-28abs ↗pdf ↗

RecoBERT uses a language model to recommend items from catalogs.

problem Harnessing language models for text-based item recommendations.
method RecoBERT is a BERT-based approach that learns specialized language models for item recommendations without requiring labeled data.
result RecoBERT outperforms other techniques in inferring item similarities from textual catalogs.

In the presence of weak overall correlation, it may be useful to investigate if the correlation is significantly and substantially more pronounced over a subpopulation. Two different testing procedures are compared. Both are based on the rankings of the values of two variables from a data set with a large number n of o…

2015-04-21abs ↗pdf ↗

Clustering is a separation of data into groups of similar objects. Every group called cluster consists of objects that are similar to one another and dissimilar to objects of other groups. In this paper, the K-Means algorithm is implemented by three distance functions and to identify the optimal distance function for c…

2013-03-11abs ↗pdf ↗

With the advent of GDPR, the domain of explainable AI and model interpretability has gained added impetus. Methods to extract and communicate visibility into decision-making models have become legal requirement. Two specific types of explanations, contrastive and counterfactual have been identified as suitable for huma…

2019-06-21abs ↗pdf ↗

New financial ratios using compositional data improve analysis of firm health.

problem Statistical issues with standard financial ratios, especially skewness and outliers.
method Compositional data (CoDa) methodology to analyze financial statements.
result Outliers and skewness reduced, results invariant to numerator and denominator permutation.

Regularization helps protect machine learning models from poisoning attacks.

problem Mitigating the impact of poisoned data on machine learning models.
method Distributionally-robust optimization using Wasserstein distance to find an upper bound for worst-case fitness.
result The regularizer is equal to the dual norm of the model parameters for regression models.

Proposes a method to ensure low losses across all subpopulations in large datasets.

problem Standard practice of minimizing average loss fails to guarantee low losses across all subpopulations in heterogeneous datasets.
method Convex procedure that controls worst-case performance over all subpopulations of a given size with finite-sample convergence guarantees.
result Empirically, the worst-case procedure learns models that do well against unseen subpopulations.

Correspondence analysis (CA) is a multivariate statistical tool used to visualize and interpret data dependencies. CA has found applications in fields ranging from epidemiology to social sciences. However, current methods used to perform CA do not scale to large, high-dimensional datasets. By re-interpreting the object…

2019-02-21abs ↗pdf ↗

The objective of this paper is to fill a gap in the literature on internationalization, in relation to the absence of objective and measurable performance indicators on the process of how firms sequentially enter external markets. To that end, this research develops a quantitative tool that can be used as a performance…

2017-10-10abs ↗pdf ↗

An approximate method for conducting resampling in Lasso, the 1\ell_1 penalized linear regression, in a semi-analytic manner is developed, whereby the average over the resampled datasets is directly computed without repeated numerical sampling, thus enabling an inference free of the statistical fluctuations due to sam…

2018-02-28abs ↗pdf ↗

The paper develops a method to estimate consumer preferences from observed rankings.

problem Estimating consumer preferences from partial ranking information.
method Interpreting observed rankings as pairwise comparisons, modeling latent utility, and correcting for selection bias.
result The method improves recommendation performance, especially for previously unconsumed products.

Big data sets must be carefully partitioned into statistically similar data subsets that can be used as representative samples for big data analysis tasks. In this paper, we propose the random sample partition (RSP) data model to represent a big data set as a set of non-overlapping data subsets, called RSP data blocks,…

2017-12-12abs ↗pdf ↗

Prevents sensitive data generation in diffusion models using labeled and unlabeled data.

problem Generating sensitive data in diffusion models using unlabeled data.
method Positive-Unlabeled Diffusion Models, approximating ELBO with labeled and unlabeled data.
result Prevents the generation of sensitive data without compromising image quality.

Study reveals Data Shapley's inconsistent performance in data selection tasks.

problem Inconsistency of Data Shapley's performance in data selection across different settings.
method Hypothesis testing framework and identification of utility functions.
result Data Shapley's performance is no better than random selection without specific constraints.

PRRO generates synthetic tabular data that improves SL performance and class distribution.

problem Low SL utility of synthetic data due to class imbalance and overlooked data relationships.
method Data pruning and column reordering to optimize SL utility.
result Synthetic data generated with PRRO enhances predictive performance and class distribution.

Defines data science as a natural ecosystem with challenges and missions.

problem Challenges and missions in data science due to 5D complexities and data life cycle phases.
method Systemic and data-centric view of data science as a fusion of data universe and its challenges, formalizing a general-purpose architecture.
result Essential data science as a natural ecosystem integrating specific disciplines and high-impact applications.

Differential privacy allows quantifying privacy loss resulting from accessing sensitive personal data. Repeated accesses to underlying data incur increasing loss. Releasing data as privacy-preserving synthetic data would avoid this limitation, but would leave open the problem of designing what kind of synthetic data. W…

2019-12-10abs ↗pdf ↗

Paper creates fair synthetic data ensuring equal predictions across sensitive attributes.

problem Ensuring fair predictions across sensitive attributes in synthetic data.
method Equalizing target probability distributions across sensitive attributes in synthetic data generation.
result Synthetic data provides strong fair predictions, equal across all thresholds.

Efficient synthetic data generation improves model performance on tabular data.

problem Improving model robustness and performance with scarce or low-quality data.
method Hardness characterization to identify high-value training points, generating synthetic data only from these points.
result Synthetic data generated from hardest points outperforms non-targeted methods on tabular datasets.

For most problems in science and engineering we can obtain data sets that describe the observed system from various perspectives and record the behavior of its individual components. Heterogeneous data sets can be collectively mined by data fusion. Fusion can focus on a specific target relation and exploit directly ass…

2013-07-02abs ↗pdf ↗

DAERNN models censored data using neural networks with data augmentation.

problem Handling censored data in expectile regression.
method Data augmentation based Expectile Regression Neural Networks (ERNNs).
result DAERNN outperforms existing censored ERNNs methods and achieves comparable predictive performance to fully observed data.

Data preprocessing techniques are devoted to correct or alleviate errors in data. Discretization and feature selection are two of the most extended data preprocessing techniques. Although we can find many proposals for static Big Data preprocessing, there is little research devoted to the continuous Big Data problem. A…

2018-10-14abs ↗pdf ↗

Data stream classification methods demonstrate promising performance on a single data stream by exploring the cohesion in the data stream. However, multiple data streams that involve several correlated data streams are common in many practical scenarios, which can be viewed as multi-task data streams. Instead of handli…

2019-08-15abs ↗pdf ↗

This paper quantifies uncertainty in Data Shapley using statistical inference.

problem Uncertainty in data valuation due to dynamic data distribution.
method Established relationship with U-statistics and quantified uncertainty using statistical inference.
result Confidence intervals for Data Shapley estimations are provided.

DCoM uses deep neural networks to detect semantic data types from raw column values.

problem Detecting semantic data types from dirty and unseen data.
method DCoM employs multi-input NLP-based deep neural networks trained on 686,765 data columns.
result DCoM outperforms existing methods significantly on 78 different semantic data types.

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…

2019-06-20abs ↗pdf ↗

New algorithms for clustering and synthetic data generation of heterogeneous tabular datasets.

problem Clustering and generating synthetic data from heterogeneous tabular datasets with hidden cluster structure.
method Developed MMM and MMMsynth algorithms for clustering and synthetic data generation.
result MMMsynth algorithm outperforms other literature tabular-data generators and approaches real data performance.