38,313 research outputs found
New Evolving Fuzzy System Algorithms Using Dynamic Constraint
An information granule has to be translated into significant frameworks of granular computing to realize interpretability-accuracy tradeoff. These two objectives are in conflict and constitute an open problem. Evolving information granules is a significant concept of granular computing which consider coarser partition (or lower granule i.e. higher error) to fine partition (or higher granule i.e. lower error). While this error reducing granular framework is considered, interpretability constraint is the factor to improve the tradeoff between interpretability and accuracy. Furthermore, overfitting and underfitting criteria are noteworthy to be considered while evolving process continues. In addition, the stability-plasticity tradeoff is another significant consideration to design a granular framework in order to find a consistent and up-to-date fuzzy information granule method. A new operational framework namely evolving fuzzy system (EFS) is developed in this research work, which ensures a compromise between interpretability and reasonable accuracy. Three models are designed based on EFS namely, evolving structural fuzzy system (ESFS), evolving output-context fuzzy system (EOCFS) and evolving information granule (EIG). The evolving information granule is initiated with the first information granule by translating the knowledge of the entire output domain. The initial information granule is considered as an underfitting state with a high approximation error. Then, the EFS starts evolving in the information granule by partitioning the output (or input) domain and uses a dynamic constraint to maintain semantic interpretability in the output (or input) contexts. The outcome on the synthetic and real-world data using the EFS shows the effectiveness of the proposed system, which outperforms state-of-the-art methods. The EFS needs less number of rules (i.e. high interpretable) and low error (i.e. high accuracy) with respect to the existing methods. For example, if the proposed EIG method is applied to the Nakanishi‘s nonlinear system then four fuzzy rules and 0.142 mean square error (MSE) are found. Furthermore, the EIG outperforms if compared with the existing methods. The important criterion in the EFS is to determine the prominent distinction (output or input context) and realize the distinct information granule that depicts the semantics at the fuzzy partition level. The EFS tends to evolve toward the lower error region and realizes the effective rule base by avoiding overfitting. Furthermore, the evolving overfitting index and uncertainty controller of the self-adaptive process are dynamically attained from past and current knowledge. Therefore, effective rule base is the balanced fuzzy model of the approximated system. Within the proposed three models (ESFS, EOCFS and EIG), EIG has the significant ability to tradeoff between interpretability and accuracy, while the proposed ESFS method shows the highly interpretable granular framework which also realizes the interpretability-accuracy tradeoff
Evolving Large-Scale Data Stream Analytics based on Scalable PANFIS
Many distributed machine learning frameworks have recently been built to
speed up the large-scale data learning process. However, most distributed
machine learning used in these frameworks still uses an offline algorithm model
which cannot cope with the data stream problems. In fact, large-scale data are
mostly generated by the non-stationary data stream where its pattern evolves
over time. To address this problem, we propose a novel Evolving Large-scale
Data Stream Analytics framework based on a Scalable Parsimonious Network based
on Fuzzy Inference System (Scalable PANFIS), where the PANFIS evolving
algorithm is distributed over the worker nodes in the cloud to learn
large-scale data stream. Scalable PANFIS framework incorporates the active
learning (AL) strategy and two model fusion methods. The AL accelerates the
distributed learning process to generate an initial evolving large-scale data
stream model (initial model), whereas the two model fusion methods aggregate an
initial model to generate the final model. The final model represents the
update of current large-scale data knowledge which can be used to infer future
data. Extensive experiments on this framework are validated by measuring the
accuracy and running time of four combinations of Scalable PANFIS and other
Spark-based built in algorithms. The results indicate that Scalable PANFIS with
AL improves the training time to be almost two times faster than Scalable
PANFIS without AL. The results also show both rule merging and the voting
mechanisms yield similar accuracy in general among Scalable PANFIS algorithms
and they are generally better than Spark-based algorithms. In terms of running
time, the Scalable PANFIS training time outperforms all Spark-based algorithms
when classifying numerous benchmark datasets.Comment: 20 pages, 5 figure
Evolving Ensemble Fuzzy Classifier
The concept of ensemble learning offers a promising avenue in learning from
data streams under complex environments because it addresses the bias and
variance dilemma better than its single model counterpart and features a
reconfigurable structure, which is well suited to the given context. While
various extensions of ensemble learning for mining non-stationary data streams
can be found in the literature, most of them are crafted under a static base
classifier and revisits preceding samples in the sliding window for a
retraining step. This feature causes computationally prohibitive complexity and
is not flexible enough to cope with rapidly changing environments. Their
complexities are often demanding because it involves a large collection of
offline classifiers due to the absence of structural complexities reduction
mechanisms and lack of an online feature selection mechanism. A novel evolving
ensemble classifier, namely Parsimonious Ensemble pENsemble, is proposed in
this paper. pENsemble differs from existing architectures in the fact that it
is built upon an evolving classifier from data streams, termed Parsimonious
Classifier pClass. pENsemble is equipped by an ensemble pruning mechanism,
which estimates a localized generalization error of a base classifier. A
dynamic online feature selection scenario is integrated into the pENsemble.
This method allows for dynamic selection and deselection of input features on
the fly. pENsemble adopts a dynamic ensemble structure to output a final
classification decision where it features a novel drift detection scenario to
grow the ensemble structure. The efficacy of the pENsemble has been numerically
demonstrated through rigorous numerical studies with dynamic and evolving data
streams where it delivers the most encouraging performance in attaining a
tradeoff between accuracy and complexity.Comment: this paper has been published by IEEE Transactions on Fuzzy System
Adaptive inferential sensors based on evolving fuzzy models
A new technique to the design and use of inferential sensors in the process industry is proposed in this paper, which is based on the recently introduced concept of evolving fuzzy models (EFMs). They address the challenge that the modern process industry faces today, namely, to develop such adaptive and self-calibrating online inferential sensors that reduce the maintenance costs while keeping the high precision and interpretability/transparency. The proposed new methodology makes possible inferential sensors to recalibrate automatically, which reduces significantly the life-cycle efforts for their maintenance. This is achieved by the adaptive and flexible open-structure EFM used. The novelty of this paper lies in the following: (1) the overall concept of inferential sensors with evolving and self-developing structure from the data streams; (2) the new methodology for online automatic selection of input variables that are most relevant for the prediction; (3) the technique to detect automatically a shift in the data pattern using the age of the clusters (and fuzzy rules); (4) the online standardization technique used by the learning procedure of the evolving model; and (5) the application of this innovative approach to several real-life industrial processes from the chemical industry (evolving inferential sensors, namely, eSensors, were used for predicting the chemical properties of different products in The Dow Chemical Company, Freeport, TX). It should be noted, however, that the methodology and conclusions of this paper are valid for the broader area of chemical and process industries in general. The results demonstrate that well-interpretable and with-simple-structure inferential sensors can automatically be designed from the data stream in real time, which predict various process variables of interest. The proposed approach can be used as a basis for the development of a new generation of adaptive and evolving inferential sensors that can a- ddress the challenges of the modern advanced process industry
Evolving temporal fuzzy association rules from quantitative data with a multi-objective evolutionary algorithm
A novel method for mining association rules that are both quantitative and temporal using a multi-objective evolutionary algorithm is presented. This method successfully identifies numerous temporal association rules that occur more frequently in areas of a dataset with specific quantitative values represented with fuzzy sets. The novelty of this research lies in exploring the composition of quantitative and temporal fuzzy association rules and the approach of using a hybridisation of a multi-objective evolutionary algorithm with fuzzy sets. Results show the ability of a multi-objective evolutionary algorithm (NSGA-II) to evolve multiple target itemsets that have been augmented into synthetic datasets
PAC: A Novel Self-Adaptive Neuro-Fuzzy Controller for Micro Aerial Vehicles
There exists an increasing demand for a flexible and computationally
efficient controller for micro aerial vehicles (MAVs) due to a high degree of
environmental perturbations. In this work, an evolving neuro-fuzzy controller,
namely Parsimonious Controller (PAC) is proposed. It features fewer network
parameters than conventional approaches due to the absence of rule premise
parameters. PAC is built upon a recently developed evolving neuro-fuzzy system
known as parsimonious learning machine (PALM) and adopts new rule growing and
pruning modules derived from the approximation of bias and variance. These rule
adaptation methods have no reliance on user-defined thresholds, thereby
increasing the PAC's autonomy for real-time deployment. PAC adapts the
consequent parameters with the sliding mode control (SMC) theory in the
single-pass fashion. The boundedness and convergence of the closed-loop control
system's tracking error and the controller's consequent parameters are
confirmed by utilizing the LaSalle-Yoshizawa theorem. Lastly, the controller's
efficacy is evaluated by observing various trajectory tracking performance from
a bio-inspired flapping-wing micro aerial vehicle (BI-FWMAV) and a rotary wing
micro aerial vehicle called hexacopter. Furthermore, it is compared to three
distinctive controllers. Our PAC outperforms the linear PID controller and
feed-forward neural network (FFNN) based nonlinear adaptive controller.
Compared to its predecessor, G-controller, the tracking accuracy is comparable,
but the PAC incurs significantly fewer parameters to attain similar or better
performance than the G-controller.Comment: This paper has been accepted for publication in Information Science
Journal 201
Learning Opposites Using Neural Networks
Many research works have successfully extended algorithms such as
evolutionary algorithms, reinforcement agents and neural networks using
"opposition-based learning" (OBL). Two types of the "opposites" have been
defined in the literature, namely \textit{type-I} and \textit{type-II}. The
former are linear in nature and applicable to the variable space, hence easy to
calculate. On the other hand, type-II opposites capture the "oppositeness" in
the output space. In fact, type-I opposites are considered a special case of
type-II opposites where inputs and outputs have a linear relationship. However,
in many real-world problems, inputs and outputs do in fact exhibit a nonlinear
relationship. Therefore, type-II opposites are expected to be better in
capturing the sense of "opposition" in terms of the input-output relation. In
the absence of any knowledge about the problem at hand, there seems to be no
intuitive way to calculate the type-II opposites. In this paper, we introduce
an approach to learn type-II opposites from the given inputs and their outputs
using the artificial neural networks (ANNs). We first perform \emph{opposition
mining} on the sample data, and then use the mined data to learn the
relationship between input and its opposite . We have validated
our algorithm using various benchmark functions to compare it against an
evolving fuzzy inference approach that has been recently introduced. The
results show the better performance of a neural approach to learn the
opposites. This will create new possibilities for integrating oppositional
schemes within existing algorithms promising a potential increase in
convergence speed and/or accuracy.Comment: To appear in proceedings of the 23rd International Conference on
Pattern Recognition (ICPR 2016), Cancun, Mexico, December 201
Temporal fuzzy association rule mining with 2-tuple linguistic representation
This paper reports on an approach that contributes towards the problem of discovering fuzzy association rules that exhibit a temporal pattern. The novel application of the 2-tuple linguistic representation identifies fuzzy association rules in a temporal context, whilst maintaining the interpretability of linguistic terms. Iterative Rule Learning (IRL) with a Genetic Algorithm (GA) simultaneously induces rules and tunes the membership functions. The discovered rules were compared with those from a traditional method of discovering fuzzy association rules and results demonstrate how the traditional method can loose information because rules occur at the intersection of membership function boundaries. New information can be mined from the proposed approach by improving upon rules discovered with the traditional method and by discovering new rules
An Incremental Construction of Deep Neuro Fuzzy System for Continual Learning of Non-stationary Data Streams
Existing FNNs are mostly developed under a shallow network configuration
having lower generalization power than those of deep structures. This paper
proposes a novel self-organizing deep FNN, namely DEVFNN. Fuzzy rules can be
automatically extracted from data streams or removed if they play limited role
during their lifespan. The structure of the network can be deepened on demand
by stacking additional layers using a drift detection method which not only
detects the covariate drift, variations of input space, but also accurately
identifies the real drift, dynamic changes of both feature space and target
space. DEVFNN is developed under the stacked generalization principle via the
feature augmentation concept where a recently developed algorithm, namely
gClass, drives the hidden layer. It is equipped by an automatic feature
selection method which controls activation and deactivation of input attributes
to induce varying subsets of input features. A deep network simplification
procedure is put forward using the concept of hidden layer merging to prevent
uncontrollable growth of dimensionality of input space due to the nature of
feature augmentation approach in building a deep network structure. DEVFNN
works in the sample-wise fashion and is compatible for data stream
applications. The efficacy of DEVFNN has been thoroughly evaluated using seven
datasets with non-stationary properties under the prequential test-then-train
protocol. It has been compared with four popular continual learning algorithms
and its shallow counterpart where DEVFNN demonstrates improvement of
classification accuracy. Moreover, it is also shown that the concept drift
detection method is an effective tool to control the depth of network structure
while the hidden layer merging scenario is capable of simplifying the network
complexity of a deep network with negligible compromise of generalization
performance.Comment: This paper has been published in IEEE Transactions on Fuzzy System
- …