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

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for cluster number prediction

Proposes a method to predict cluster number and cluster representatives using cluster stability analysis.

problem Determining the number of clusters in a dataset.
method Analyzes cluster stability using Monte-Carlo simulation to predict cluster number and find cluster representatives.
result Significant improvement in predicting cluster numbers and cluster composition in large datasets.

Paper clusters microstructure measures for better stock return prediction.

problem Finding the best microstructure measures for predicting stock returns.
method Clustering model of market microstructure features studied in 10-second time-frequency.
result Identifies the most effective microstructure measures for accurate stock return prediction.

Proposes a method to improve class-conditional conformal prediction for many classes.

problem Weak guarantees for specific classes in classification problems.
method Clusters classes with similar conformal scores and performs conformal prediction at the cluster level.
result Clustered conformal typically outperforms existing methods in class-conditional coverage and set size metrics.

Develops a new random forest method for clustered data with improved prediction and inference.

problem Improving prediction and inference accuracy for clustered data with within-cluster dependence.
method Clustered Random Forests, using weighted least squares estimators for leaf predictions.
result Optimal prediction and inference weights vary under covariate shift, necessitating user-chosen weights.

Consumer Demand Response (DR) is an important research and industry problem, which seeks to categorize, predict and modify consumer's energy consumption. Unfortunately, traditional clustering methods have resulted in many hundreds of clusters, with a given consumer often associated with several clusters, making it diff…

2017-02-05abs ↗pdf ↗

Improved prediction of polymer morphology through machine learning and simulations.

problem Understanding and predicting the morphology of multi-component polymer blends.
method Modified Cahn-Hilliard model for simulations, machine learning for clustering and prediction.
result Machine learning achieved \geq 90% accuracy in predicting polymer morphology.

A system is presented that segments, clusters and predicts musical audio in an unsupervised manner, adjusting the number of (timbre) clusters instantaneously to the audio input. A sequence learning algorithm adapts its structure to a dynamically changing clustering tree. The flow of the system is as follows: 1) segment…

2015-02-02abs ↗pdf ↗

Framework achieves fairness in predictions using partially known causal graph over clusters of variables.

problem Achieving fairness in algorithmic decisions when causal graph knowledge is limited.
method Leverages a causal graph over clusters of variables to train a prediction model, reducing interventional distribution discrepancies.
result Framework strikes a better balance between fairness and accuracy than existing approaches under limited causal graph knowledge.

Infinite hierarchical contrastive clustering identifies personal environments linked to health outcomes.

problem Identifying meaningful relationships between environmental features and health outcomes on an individual level.
method Contrastive clustering framework with stick-breaking prior and participant-specific prediction loss.
result Model effectively identifies distinct personal environments and groups them into meaningful types linked to health outcomes.

VC-PCR improves prediction by clustering correlated variables.

problem Decreased prediction accuracy due to cluster structure in predictor variables.
method Supervised variable selection and clustering to integrate cluster information into a sparse modeling process.
result VC-PCR achieves better prediction, variable selection, and clustering performance.

New model predicts links in community-based networks robustly.

problem Link prediction in community-based networks with local clustering errors.
method Markov Stochastic Block Model (MSBM) with Hidden Markov Model (HMM) predictions.
result Misclassification error decays exponentially with relevant signal-to-noise ratio (SNR).

We introduce a novel algorithmic approach to content recommendation based on adaptive clustering of exploration-exploitation ("bandit") strategies. We provide a sharp regret analysis of this algorithm in a standard stochastic noise setting, demonstrate its scalability properties, and prove its effectiveness on a number…

2014-01-31abs ↗pdf ↗

In this paper, we initiate a rigorous theoretical study of clustering with noisy queries (or a faulty oracle). Given a set of nn elements, our goal is to recover the true clustering by asking minimum number of pairwise queries to an oracle. Oracle can answer queries of the form : "do elements uu and vv belong to the…

2017-06-22abs ↗pdf ↗

The study uses neural networks to classify and predict coronavirus data.

problem Classifying and predicting coronavirus data from input variables.
method Artificial neural networks with logcosh loss function to classify branches of set-valued mappings.
result Successfully classified and predicted coronavirus data for each German district.

We consider the problem of the statistical uncertainty of the correlation matrix in the optimization of a financial portfolio. We show that the use of clustering algorithms can improve the reliability of the portfolio in terms of the ratio between predicted and realized risk. Bootstrap analysis indicates that this impr…

2005-07-01abs ↗pdf ↗

New method predicts wind farm power and wakes using weather patterns.

problem Inefficient and computationally intensive wind energy resource assessment.
method Unsupervised clustering of ERA5 data on wind velocity, WRF simulations at cluster centers, and post-processing.
result Accurate long-term predictions of power and wakes with reduced computational time.

Study examines how cluster number affects short-text clustering, introducing a stability metric.

problem Challenges in finding meaningful clusters in short-text data.
method Introduces a stability metric to determine cluster robustness and visualizes cluster subdivisions.
result Choosing a cluster number involves balancing informativeness and complexity, not seeking a single 'optimal' solution.

In Stochastic blockmodels, which are among the most prominent statistical models for cluster analysis of complex networks, clusters are defined as groups of nodes with statistically similar link probabilities within and between groups. A recent extension by Karrer and Newman incorporates a node degree correction to mod…

2013-11-11abs ↗pdf ↗

SurvMixClust clusters survival data and predicts individual survival curves.

problem Integrating clustering into survival analysis for precision medicine.
method SurvMixClust learns latent representations for clustering and predicts survival functions using a mixture of non-parametric experts.
result SurvMixClust creates balanced clusters with distinct survival curves, outperforming clustering baselines and competing with non-clustering models in predictive accuracy.

The paper proposes a method to cluster data and estimate regression parameters using VI for financial forecasting.

problem Learning relationships between input and output with different parameters in different regions of the input space.
method Cluster-based regression using Variational Inference (VI).
result The approach can predict the expected value and full distribution of predicted output.

Cluster analysis is widely used in the areas of machine learning and data mining. Fuzzy clustering is a particular method that considers that a data point can belong to more than one cluster. Fuzzy clustering helps obtain flexible clusters, as needed in such applications as text categorization. The performance of a clu…

2018-06-05abs ↗pdf ↗

DGC clusters data with side-information for better prediction.

problem Improving clustering strategies through better prediction performance.
method Deep Goal-Oriented Clustering (DGC) framework that clusters data using supervision and unsupervised modeling.
result Achieves prediction accuracies comparable to state-of-the-art, while learning congruent clustering strategies.

New criterion selects optimal number of clusters based on stability.

problem Challenges in selecting optimal number of clusters in non-parametric clustering.
method Proposes a stability-based validation criterion combining between-cluster and within-cluster stability.
result Empirically demonstrates effectiveness in selecting optimal number of clusters.

We introduce a semi-supervised discrete choice model to calibrate discrete choice models when relatively few requests have both choice sets and stated preferences but the majority only have the choice sets. Two classic semi-supervised learning algorithms, the expectation maximization algorithm and the cluster-and-label…

2017-02-16abs ↗pdf ↗

Paper introduces NICc for fast cluster-based validation of prediction models.

problem Validation of prediction models on clustered data.
method Derived NICc to approximate leave-one-cluster-out deviance for standard regression models.
result NICc provides more accurate model size and variable selection, especially with strong clustering.

Develops a new cluster validity index to find multiple optimal cluster numbers.

problem Finding the optimal number of clusters in real-world data with varying densities, sizes, and shapes.
method A new correlation-based cluster validity index that yields multiple local peaks.
result The new index finds multiple optimal cluster numbers in various scenarios.

Paper finds methods to accurately determine the number of clusters in data.

problem Finding the correct number of clusters in a dataset.
method Penalized k-means algorithms with ideal clusters and multiplicative penalties.
result K-means with multiplicative penalties provides a clearer indication of the correct number of clusters.

Mixture of multi-task GPs for clustering and prediction of functional data.

problem Handling multi-task learning, clustering, and prediction for functional data.
method A mixture of multi-task Gaussian processes with a variational EM algorithm for hyper-parameter optimization.
result Enhanced predictive performance for group-structured data.

Paper uses Shapley values to explain how clusters of training data affect predictions.

problem Explaining how training data clusters impact predictions from black-box models.
method Extends Shapley values to cluster importance, using coalitional game theory.
result Shows how different clusters of training data contribute to model predictions.

CAF-HFCM automatically forms a cluster hierarchy and optimizes the number of clusters without trial-and-validation.

problem Challenges in determining the optimal number of clusters in fuzzy c-means.
method CAF-HFCM, an auto-fused hierarchical fuzzy c-means method.
result Automatic agglomeration and optimal number of clusters without validity indices.