FUJI scores similarity of ranked lists more robustly.
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.
Trend · papers per month
Improved stock index analysis using fuzzy parameters and machine learning.
New validity index for fuzzy-possibilistic c-means clustering.
New cluster validity index detects optimal number of clusters and secondary options.
Proposes new random models for fuzzy clustering similarity measures.
A deep convolutional fuzzy system (DCFS) on a high-dimensional input space is a multi-layer connection of many low-dimensional fuzzy systems, where the input variables to the low-dimensional fuzzy systems are selected through a moving window across the input spaces of the layers. To design the DCFS based on input-outpu…
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…
Enhanced fuzzy system predicts chaotic time series with improved accuracy.
In the present paper, a fuzzy logic based method is combined with wavelet decomposition to develop a step-by-step dynamic hybrid model for the estimation of financial time series. Empirical tests on fuzzy regression, wavelet decomposition as well as the new hybrid model are conducted on the well known index fin…
ReliefE ranks features faster and better in high-dimensional data.
A new adaptive binarization technique using fuzzy integrals improves image quality.
Complex classification performance metrics such as the F-measure and Jaccard index are often used, in order to handle class-imbalanced cases such as information retrieval and image segmentation. These performance metrics are not decomposable, that is, they cannot be expressed in a per-example manner, which hinder…
This short article aims at demonstrate that the Intersection over Union (or Jaccard index) is not a submodular function. This mistake has been made in an article which is cited and used as a foundation in another article. The Intersection of Union is widely used in machine learning as a cost function especially for imb…
New method phenotypes sleep apnea patients using time series analysis.
CAF-HFCM automatically forms a cluster hierarchy and optimizes the number of clusters without trial-and-validation.
Clustering is an extensive research area in data science. The aim of clustering is to discover groups and to identify interesting patterns in datasets. Crisp (hard) clustering considers that each data point belongs to one and only one cluster. However, it is inadequate as some data points may belong to several clusters…
Two private algorithms estimate Jaccard similarity efficiently.
Two simple proofs of the triangle inequality for the Jaccard distance in terms of nonnegative, monotone, submodular functions are given and discussed.
The expected utility operators introduced in a previous paper, offer a framework for a general risk aversion theory, in which risk is modelled by a fuzzy number . In this paper we formulate a coinsurance problem in the possibilistic setting defined by an expected utility operator . Some properties of the optimal …
FCM clustering adapts to persistence diagrams for topological data analysis.
Realization of uncertainty of prices is captured by volatility, that is the tendency of prices to vary along a period of time. This is generally measured as standard deviation of daily returns. In this paper we propose and investigate the application of fuzzy transform and its inverse as an alternative measure of volat…
This paper introduces Bounded Fuzzy Possibilistic Method (BFPM) by addressing several issues that previous clustering/classification methods have not considered. In fuzzy clustering, object's membership values should sum to 1. Hence, any object may obtain full membership in at most one cluster. Possibilistic clustering…
Study enhances financial forecasting with machine learning and fuzzy MCDM.
The probability Jaccard similarity was recently proposed as a natural generalization of the Jaccard similarity to measure the proximity of sets whose elements are associated with relative frequencies or probabilities. In combination with a hash algorithm that maps those weighted sets to compact signatures which allow f…
Paper simulates LR fuzzy intervals with interval-valued cores.
Stability in clinical prediction models is crucial for transferability between studies, yet has received little attention. The problem is paramount in high dimensional data which invites sparse models with feature selection capability. We introduce an effective method to stabilize sparse Cox model of time-to-events usi…
This project explores several Machine Learning methods to predict movie genres based on plot summaries. Naive Bayes, Word2Vec+XGBoost and Recurrent Neural Networks are used for text classification, while K-binary transformation, rank method and probabilistic classification with learned probability threshold are employe…
In this paper, we have tried to apply the concepts of fuzzy sets to Lie groups and its relative concepts. First, we define a fuzzy submanifold after reviewing fuzzy manifold definition. In main section, we defined the Lie group and some its relative concepts such as fuzzy transformation group,…
Fuzzy eIX method evolves classifiers for online data streams.
Paper uses ANFIS to predict cryptocurrency prices.
Fuzzy prediction sets generalize binary predictions to include elements at varying confidence levels.
Possibilistic risk theory starts from the hypothesis that risk is modelled by fuzzy numbers. In particular, in a possibilistic portfolio choice problem, the return of a risky asset will be a fuzzy number. The expected utility operators have been introduced in a previous paper to build an abstract theory of possibilisti…
The minimization of loss functions is the heart and soul of Machine Learning. In this paper, we propose an off-the-shelf optimization approach that can minimize virtually any non-differentiable and non-decomposable loss function (e.g. Miss-classification Rate, AUC, F1, Jaccard Index, Mathew Correlation Coefficient, etc…
iCVI-ARTMAP accelerates clustering with adaptive resonance theory and validity indices.
Paper investigates differentiable fuzzy implications and their suitability for learning.
SESSC clusters fuzzy rules for TSK classifiers, improving performance with label info.
A new fuzzy clustering method using hyperbolic smoothing for large datasets.
In this paper we use fuzzy systems theory to convert the technical trading rules commonly used by stock practitioners into excess demand functions which are then used to drive the price dynamics. The technical trading rules are recorded in natural languages where fuzzy words and vague expressions abound. In Part I of t…
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 …
This study proposes methods for multi-step-ahead stock price prediction using decomposition and neural networks.
Takagi-Sugeno-Kang (TSK) fuzzy systems are very useful machine learning models for regression problems. However, to our knowledge, there has not existed an efficient and effective training algorithm that ensures their generalization performance, and also enables them to deal with big data. Inspired by the connections b…
We propose an approach to reduce both computational complexity and data storage requirements for the online positioning stage of a fingerprinting-based indoor positioning system (FIPS) by introducing segmentation of the region of interest (RoI) into sub-regions, sub-region selection using a modified Jaccard index, and …
Unified probabilistic foundation for fuzzy simplicial sets in dimensionality reduction.
This paper introduces the concept of kernels on fuzzy sets as a similarity measure for -valued functions, a.k.a. \emph{membership functions of fuzzy sets}. We defined the following classes of kernels: the cross product, the intersection, the non-singleton and the distance-based kernels on fuzzy sets. Applicabili…
Proposes a new network to improve nuclei segmentation in histopathology images.
Optimized fuzzy entropy framework improves feature selection and classification performance.
Measuring the similarity of two files is an important task in malware analysis, with fuzzy hash functions being a popular approach. Traditional fuzzy hash functions are data agnostic: they do not learn from a particular dataset how to determine similarity; their behavior is fixed across all datasets. In this paper, we …
A new hybrid fuzzy-crisp clustering algorithm addresses imbalanced cluster sizes.