Validation is one of the most important aspects of clustering, but most approaches have been batch methods. Recently, interest has grown in providing incremental alternatives. This paper extends the incremental cluster validity index (iCVI) family to include incremental versions of Calinski-Harabasz (iCH), I index and …
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
48 results for “incremental validity indices”
Cluster analysis is used to explore structure in unlabeled data sets in a wide range of applications. An important part of cluster analysis is validating the quality of computationally obtained clusters. A large number of different internal indices have been developed for validation in the offline setting. However, thi…
iCVI-ARTMAP accelerates clustering with adaptive resonance theory and validity indices.
problem Improving clustering efficiency and accuracy using adaptive resonance theory.
method Integrates adaptive resonance theory (ARTMAP) with incremental cluster validity indices (iCVIs) for clustering.
result Significantly reduces clustering time and outperforms other methods on synthetic and real-world data.
Tensor decompositions are invaluable tools in analyzing multimodal datasets. In many real-world scenarios, such datasets are far from being static, to the contrary they tend to grow over time. For instance, in an online social network setting, as we observe new interactions over time, our dataset gets updated in its "t…
Rough volatility of Bitcoinq-fin.ST
Recent studies have found that the log-volatility of asset returns exhibit roughness. This study investigates roughness or the anti-persistence of Bitcoin volatility. Using the multifractal detrended fluctuation analysis, we obtain the generalized Hurst exponent of the log-volatility increments and find that the genera…
Scaling and correlation in financial datacond-mat.stat-mech
The statistical properties of the increments x(t+T) - x(t) of a financial time series depend on the time resolution T on which the increments are considered. A non-parametric approach is used to study the scale dependence of the empirical distribution of the price increments x(t+T) - x(t) of S&P Index futures, for time…
This paper presents a novel approach for incremental semiparametric inverse dynamics learning. In particular, we consider the mixture of two approaches: Parametric modeling based on rigid body dynamics equations and nonparametric modeling based on incremental kernel methods, with no prior information on the mechanical …
Mirror flows converge to a limiting flow with a convex potential.
problem Incremental learning in mirror flows
method Rescaled trajectories converge to a limiting mirror flow
result Primal variable minimizes the loss over a time-dependent hypothesis set
Cross-validation (CV) is one of the main tools for performance estimation and parameter tuning in machine learning. The general recipe for computing CV estimate is to run a learning algorithm separately for each CV fold, a computationally expensive process. In this paper, we propose a new approach to reduce the computa…
Paper presents a method for imputing and forecasting structural response from incomplete sensor data.
problem Missing sensor data in structural health monitoring (SHM).
method Incremental Bayesian tensor learning for spatiotemporal missing data reconstruction and forecasting.
result The proposed method achieves accurate and robust imputation and prediction even with high rates of missing data.
Simulation workflow is a top-level model for the design and control of simulation process. It connects multiple simulation components with time and interaction restrictions to form a complete simulation system. Before the construction and evaluation of the component models, the validation of upper-layer simulation work…
PrIU optimizes machine learning model updates after data cleaning.
problem Incrementally updating machine learning models after removing problematic training samples.
method Provenance-based approach for efficient model parameter updates.
result PrIU-opt achieves up to two orders of magnitude speed-up compared to retraining from scratch.
A new permutation method improves two-sample testing power.
problem Two-sample testing with improved power and validity.
method Structured block-restricted cross-swaps.
result Block-restricted permutations achieve higher power than full permutations.
Narrative disclosures in 10-K filings improve bankruptcy prediction beyond accounting ratios.
problem Traditional bankruptcy prediction models rely on accounting ratios, which may not capture early warning signals.
method Developed a PB Stress Score based on distress-specific language in 10-K narratives, evaluated against accounting and dictionary benchmarks.
result Adding the PB Stress Score increases AUC from 0.8323 to 0.9019 and improves top-decile bankruptcy capture from 44.12% to 64.71%.
New algorithm improves on EM for streaming data, outperforming existing methods.
problem Processing high-volume, streaming data efficiently.
method Incremental stochastic Majorization-Minimization (MM) algorithm.
result The algorithm converges to a stationary point with vanishing gradient.
Growth rate of real GDP per capita is represented as a sum of two components -- a monotonically decreasing economic trend and fluctuations related to a specific age population change. The economic trend is modeled by an inverse function of real GDP per capita with a numerator potentially constant for the largest develo…
Asymptotic Separability of Diffusion and Jump Components in High-Frequency CIR and CKLS Modelsq-fin.ST
Robustly detects jumps in high-frequency CIR and CKLS models.
problem Jump detection in high-frequency jump-diffusion processes.
method MDPDE-based robust estimators for drift and diffusion coefficients.
result Maximum of normalized residuals converges to Gumbel distribution.
Incremental Learning with Maximum Entropy Regularization: Rethinking Forgetting and Intransigencecs.LG
Incremental learning suffers from two challenging problems; forgetting of old knowledge and intransigence on learning new knowledge. Prediction by the model incrementally learned with a subset of the dataset are thus uncertain and the uncertainty accumulates through the tasks by knowledge transfer. To prevent overfitti…
Optimizes subset selection in sparse learning problems.
problem Sparse learning problems, particularly best subset selection.
method Developed an efficient primal-dual algorithm leveraging dual range estimation and incremental strategy.
result Improves solutions of best subset selection with reduced redundant computation.
Paper improves privacy-preserving measurement of advertising incrementality.
problem Privacy degradation in randomized lift tests for advertising measurement.
method Formulates a robust causal decision problem under signal losses, projecting clean worlds onto incrementality.
result Sharp decision frontier shows valid certification or rejection outside the frontier.
This paper reviews and proposes a new approach for evaluating internal cluster validation indices.
problem Selecting the best-performing unsupervised classification algorithm without external information.
method Examines and proposes a new evaluation approach for internal validation indices.
result Suggests a new evaluation approach for internal validation indices.
Efficient algorithms solve large-scale DRSVM problems.
problem Optimizing support vector machines under worst-case distribution uncertainty.
method Epigraphical projection-based incremental algorithms.
result Incremental algorithms solve DRSVM problems up to 1000x faster than state-of-the-art methods.
Various health-care applications such as assisted living, fall detection etc., require modeling of user behavior through Human Activity Recognition (HAR). HAR using mobile- and wearable-based deep learning algorithms have been on the rise owing to the advancements in pervasive computing. However, there are two other ch…
In this paper we present an incremental variant of the Twin Support Vector Machine (TWSVM) called Fuzzy Bounded Twin Support Vector Machine (FBTWSVM) to deal with large datasets and learning from data streams. We combine the TWSVM with a fuzzy membership function, so that each input has a different contribution to each…
Generative replay improves continual learning by using generated data as negative examples.
problem Catastrophic forgetting in continual learning.
method Using generative models to provide negative examples for new classes.
result Generative replay can improve learning new classes even when existing approaches fail.
The paper challenges the validity of cluster validity measures in unsupervised learning.
problem The validity of cluster validity measures in selecting optimal clusterings.
method The authors investigate the use of cluster validity measures as objective functions in unsupervised learning and introduce a new variant of the Dunn index.
result Many cluster validity measures promote clusterings that do not match expert knowledge well.
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.
Introduces BCVI, a Bayesian cluster validity index for better cluster selection.
problem Selecting the optimal number of clusters in clustering algorithms.
method Develops BCVI using Dirichlet or generalized Dirichlet priors, evaluated against existing indices.
result BCVI offers clear advantages in scenarios where user expertise is valuable.
New indices for determining cluster compactness and separability.
problem Challenges in identifying true clusters in data sets.
method Developed absolute cluster indices to measure compactness and separability.
result Demonstrated improved performance compared to existing indices.
Communication through e-mails remains to be highly formalized, conventional and indispensable method for the exchange of information over the Internet. An ever-increasing ratio and adversary nature of spam e-mails have posed a great many challenges such as uneven class distribution, unequal error cost, frequent change …
Real GDP per capita since 1870q-fin.GN
The growth rate of real GDP per capita in the biggest OECD countries is represented as a sum of two components - a steadily decreasing trend and fluctuations related to the change in some specific age population. The long term trend in the growth rate is modelled by an inverse function of real GDP per capita with a con…
A plain well-trained deep learning model often does not have the ability to learn new knowledge without forgetting the previously learned knowledge, which is known as catastrophic forgetting. Here we propose a novel method, SupportNet, to efficiently and effectively solve the catastrophic forgetting problem in the clas…
As we enter into the big data age and an avalanche of images have become readily available, recognition systems face the need to move from close, lab settings where the number of classes and training data are fixed, to dynamic scenarios where the number of categories to be recognized grows continuously over time, as we…
A new method for real-time anomaly detection in flight data.
problem Challenges in clustering dynamically growing flight data for anomaly detection.
method Incremental Gaussian Mixture Model (GMM) using EM algorithm.
result Significantly reduced processing time and memory usage compared to offline methods.
We introduce incremental variational inference and apply it to latent Dirichlet allocation (LDA). Incremental variational inference is inspired by incremental EM and provides an alternative to stochastic variational inference. Incremental LDA can process massive document collections, does not require to set a learning …
Motivated by the need for accurate frequency information, a novel algorithm for estimating the fundamental frequency and its rate of change in three-phase power systems is developed. This is achieved through two stages of Kalman filtering. In the first stage a quaternion extended Kalman filter, which provides a unified…
A new framework uses an Incremental Transformer to design geopolymer mixtures efficiently.
problem Designing geopolymer mixtures with limited data and physical constraints.
method Topology-aware surrogate framework guided by Incremental Transformer.
result The design space is redundant, with fewer effective mixture regimes.
Develops platforms to analyze social media data for human behavior and emotions.
problem Understanding human behavior and emotions from social media data.
method Self-structuring incremental machine learning, event detection, natural language processing.
result Captured salient topics and events from social media data, validated against news.
Scaling in stock market data: stable laws and beyondcond-mat.stat-mech
The concepts of scale invariance, self-similarity and scaling have been fruitfully applied to the study of price fluctuations in financial markets. After a brief review of the properties of stable Levy distributions and their applications to market data we indicate the shortcomings of such models and describe the trunc…
DPGIIL clusters structural anomalies using transmissibility functions with deep learning and Dirichlet process.
problem Clustering structural anomalies in high-dimensional streaming data with optimal cluster number determination.
method Combines Dirichlet process and deep generative models for incremental learning and anomaly detection.
result DPGIIL outperforms traditional methods in anomaly detection and clustering.
A new framework for generating predictive features in noisy multivariate time series.
problem Predicting noisy multivariate time series with limited user effort.
method Develops a feature programming framework based on spin-gas dynamical Ising models.
result Validated the method on synthetic and real-world datasets.
Inverse reinforcement learning (IRL) is the problem of learning the preferences of an agent from the observations of its behavior on a task. While this problem has been well investigated, the related problem of {\em online} IRL---where the observations are incrementally accrued, yet the demands of the application often…
Support Vector Data Description (SVDD) is a popular outlier detection technique which constructs a flexible description of the input data. SVDD computation time is high for large training datasets which limits its use in big-data process-monitoring applications. We propose a new iterative sampling-based method for SVDD…
Online Estimation with Rolling Validation: Adaptive Nonparametric Estimation with Streaming Datamath.ST
New method improves online nonparametric estimators with minimal extra computation.
problem Model selection and hyperparameter tuning for online nonparametric estimators.
method Weighted rolling validation procedure for online cross-validation.
result Improves base estimators to achieve better heuristic performance and adaptive convergence rate.
This paper tackles deep clustering evaluation challenges in high-dimensional data.
problem Evaluation of deep clustering methods is problematic due to the curse of dimensionality and variations in embedding spaces.
method Develops a theoretical framework to highlight the ineffectiveness of internal validation measures and proposes a systematic approach to applying clustering validity indices in deep learning.
result The proposed framework reduces misguidance from improper use of clustering validity indices in deep learning.
Deep learning has been widely accepted as a promising solution for medical image segmentation, given a sufficiently large representative dataset of images with corresponding annotations. With ever increasing amounts of annotated medical datasets, it is infeasible to train a learning method always with all data from scr…
Paper proposes faster incremental subclass discriminant analysis.
problem Efficiently classify subclasses in incremental data.
method Exact and approximate linear and kernelized solutions.
result Superior training time and accuracy compared to existing methods.
The extreme event statistics plays a very important role in the theory and practice of time series analysis. The reassembly of classical theoretical results is often undermined by non-stationarity and dependence between increments. Furthermore, the convergence to the limit distributions can be slow, requiring a huge am…