Clustering algorithms for fuzzy rules decomposition

This paper presents the development, testing and evaluation of generalized Possibilistic fuzzy c-means (FCM) algorithms applied to fuzzy sets. Clustering is formulated as a constrained minimization problem, whose solution depends on the constraints imposed on the membership function of the cluster and on the relevance measure of the fuzzy rules. This fuzzy clustering of fuzzy rules leads to a fuzzy partition of the fuzzy rules, one for each cluster, which corresponds to a new set of fuzzy sub-systems. When applied to the clustering of a flat fuzzy system results a set of decomposed sub-systems that will be conveniently linked into a Hierarchical Prioritized Structures

Water leakage forecasting: The application of a modified fuzzy evolving algorithm

This paper investigates the use of evolving fuzzy algorithms in forecasting. An evolving Takagi-Sugeno (eTS) algorithm, which is based on a recursive version of the subtractive algorithm is considered. It groups data into several clusters based on Euclidean distance between the relevant independent variables. The Mod eTS algorithm, which incorporates a modified dynamic update of cluster radii while accommodating new available data is proposed. The created clusters serve as a base for fuzzy If-Then rules with Gaussian membership functions which are defined using the cluster centres and have linear functions in the consequent i.e., Then parts of rules. The parameters of the linear functions are calculated using a weighted version of the Recursive Least Squares algorithm. The proposed algorithm is applied to a leakage forecasting problem faced by one of the leading UK water supplying companies. Using the real world data provided by the company the forecasting results obtained from the proposed modified eTS algorithm, Mod eTS, are compared to the standard eTS algorithm, exTS, eTS+ and fuzzy C-means clustering algorithm and some standard statistical forecasting methods. Different measures of forecasting accuracy are used. The results show higher accuracy achieved by applying the algorithm proposed compared to other fuzzy clustering algorithms and statistical methods. Similar results are obtained when comparing with other fuzzy evolving algorithms with dynamic cluster radii. Furthermore the algorithm generates typically a smaller number of clusters than standard fuzzy forecasting methods which leads to more transparent forecasting models

Speaker specific feature based clustering and its applications in language independent forensic speaker recognition

Forensic speaker recognition (FSR) is the process of determining whether the source of a questioned voice recording (trace) is a specific individual (suspected speaker). The role of the forensic expert is to testify by using, if possible, a quantitative measure of this value to the value of the voice evidence. Using this information as an aid in their judgments and decisions are up to the judge and/or the jury. Most existing methods measure inter-utterance similarities directly based on spectrum-based characteristics, the resulting clusters may not be well related to speaker’s, but rather to different acoustic classes. This research addresses this deficiency by projecting language-independent utterances into a reference space equipped to cover the standard voice features underlying the entire utterance set. The resulting projection vectors naturally represent the language-independent voice-like relationships among all the utterances and are therefore more robust against non-speaker interference. Then a clustering approach is proposed based on the peak approximation in order to maximize the similarities between language-independent utterances within all clusters. This method uses a K-medoid, Fuzzy C-means, Gustafson and Kessel and Gath-Geva algorithm to evaluate the cluster to which each utterance should be allocated, overcoming the disadvantage of traditional hierarchical clustering that the ultimate outcome can only hit the optimum recognition efficiency. The recognition efficiency of K-medoid, Fuzzy C-means, Gustafson and Kessel and Gath-Geva clustering algorithms are 95.2%, 97.3%, 98.5% and 99.7% and EER are 3.62%, 2.91 %, 2.82%, and 2.61% respectively. The EER improvement of the Gath-Geva technique based FSRsystem compared with Gustafson and Kessel and Fuzzy C-means is 8.04% and 11.49% respectivel

Autoregressive time series prediction by means of fuzzy inference systems using nonparametric residual variance estimation

We propose an automatic methodology framework for short- and long-term prediction of time series by means of fuzzy inference systems. In this methodology, fuzzy techniques and statistical techniques for nonparametric residual variance estimation are combined in order to build autoregressive predictive models implemented as fuzzy inference systems. Nonparametric residual variance estimation plays a key role in driving the identification and learning procedures. Concrete criteria and procedures within the proposed methodology framework are applied to a number of time series prediction problems. The learn from examples method introduced by Wang and Mendel (W&M) is used for identification. The Levenberg–Marquardt (L–M) optimization method is then applied for tuning. The W&M method produces compact and potentially accurate inference systems when applied after a proper variable selection stage. The L–M method yields the best compromise between accuracy and interpretability of results, among a set of alternatives. Delta test based residual variance estimations are used in order to select the best subset of inputs to the fuzzy inference systems as well as the number of linguistic labels for the inputs. Experiments on a diverse set of time series prediction benchmarks are compared against least-squares support vector machines (LS-SVM), optimally pruned extreme learning machine (OP-ELM), and k-NN based autoregressors. The advantages of the proposed methodology are shown in terms of linguistic interpretability, generalization capability and computational cost. Furthermore, fuzzy models are shown to be consistently more accurate for prediction in the case of time series coming from real-world applications.Ministerio de Ciencia e Innovación TEC2008-04920Junta de Andalucía P08-TIC-03674, IAC07-I-0205:33080, IAC08-II-3347:5626

A New Approach to Adaptive Neuro-fuzzy Modeling using Kernel based Clustering

Data clustering is a well known technique for fuzzy model identification or fuzzy modelling for apprehending the system behavior in the form of fuzzy if-then rules based on experimental data Fuzzy c- Means FCM clustering and subtractive clustering SC are efficient techniques for fuzzy rule extraction in fuzzy modeling of Adaptive Neuro-fuzzy Inference System ANFIS In this paper we have employed a novel technique to build the rule base of ANFIS based on the kernel based variants of these two clustering techniques which have shown better clustering accuracy In kernel based clustering approach the kernel functions are used to calculate the distance measure between the data points during clustering which enables to map the data to a higher dimensional space This generalization makes data set more distinctly separable which results in more accurate cluster centers and therefore a more precise rule base for the ANFIS can be constructed which increases the prediction performance of the system The performance analysis of ANFIS models built using kernel based FCM and kernel based SC has been done on three business prediction problems viz sales forecasting stock price prediction and qualitative bankruptcy prediction A performance comparison with the ANFIS models based on conventional SC and FCM clustering for each of these forecasting problems has been provided and discusse