2,979 publications from this institution
In this study, we offer a general view at the area of fuzzy modeling and elaborate on a new direction of system modeling by introducing a concept of granular models. Those models constitute a generalization of existing fuzzy models and, in contrast to existing models, generate results in the form of information granules (such as intervals, fuzzy sets, rough sets and others). We present a rationale and some key motivating arguments behind the emergence of granular models and discuss their underlying design process. Central to the development of granular models are granular spaces, namely a granular space of parameters of the models and a granular input space. The development of the granular model is completed through an optimal allocation of information granularity, which optimizes criteria of coverage and specificity of granular information. The emergence of granular models of type-2 and type-n, in general, is discussed along with an elaboration on their formation. It is shown that achieving a sound coverage-specificity tradeoff (compromise) is of essential relevance in the realization of the granular models.
This study presents a nonlinear piezoelectric energy harvester with intent to scavenge energy from diverse mechanical motions. The harvester consists of four piezoelectric cantilever beams, a cylindrical track, and a ferromagnetic ball, with magnets integrated to introduce the magnetic coupling between the ball and the beams. The experimental results demonstrate that the harvester is able to collect energy from various directions of vibrations. For the vibrations perpendicular to the ground, the maximum peak voltage is increased by 3.2 V and the bandwidth of the voltage above 4 V is increased by more than 4 Hz compared to the results obtained when using a conventional design. For the vibrations along the horizontal direction, the frequency up-conversion is realized through the magnetic coupling. Moreover, the proposed design can harvest energy from the sway motion around different directions on the horizontal plane. Harvesting energy from the rotation motion is also achieved with an operating bandwidth of approximately 6 Hz.
In this study, we propose a concept of fuzzy wavelet polynomial neural networks (FWPNNs) based on concepts and constructs of polynomial neural networks and fuzzy wavelet neurons (FWNs). These networks exhibit a rule-based architecture while each rule in the FWN consists of the premise part and consequence part. The premise part is realized by using C-means clustering method, while the consequence part is realized by means of wavelet functions whose parameters are estimated with the aid of the least square method. In some sense, the FWPNN can be regarded as a generalized fuzzy wavelet neural network (FWNN). Unlike Gaussian membership functions that are commonly utilized to implement the premise part of the rules in typical FWNNs, C-means method is employed here to overcome a possible curse of dimensionality. Polynomial neural networks (PNNs) are used to express the nonlinearity of a complex system. Furthermore, the particle swarm optimization is used to optimize the design parameters of the proposed network. Based on the PNNs and FWNNs, the proposed FWPNNs take advantages of these two neural networks: it exhibits the abilities to describe high-order nonlinear relations between input and output variables and it is beneficial to describe models impacted by uncertainty. The proposed FWPNNs are applied for time-series prediction and regression problems (e.g., control of dynamic plants). Several well-known modeling benchmarks including regression and time series are considered to evaluate the performance of the proposed FWPNNs. A comparative analysis shows that the proposed FWPNNs result in better performance when comparing with some previous models reported in the literature.
This article is concerned with a problem of relational factorization which engages fuzzy relational calculus. It forms an interesting alternative to the method of nonnegative matrix factorization that has been commonly discussed and found in numerous applications. The relational factorization takes original <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> -dimensional data located in the unit hypercube and factorizes it into data of lower dimensionality and some fuzzy relations. Owing to the logic nature of processing delivered by relational calculus, the dimensionality reduction exhibits transparency as the reduction mechanism itself is described in terms of logic expressions. Two types of factorizations mechanisms are investigated by using <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s–t</i> and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t–s</i> composition operators where <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</i> and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</i> are triangular norms and conorms, respectively. A two-level process of factorization is designed. A gradient-based learning scheme is developed. The quantification of the performance of the factorization process is realized by bringing a concept of information granularity: The obtained fuzzy relations are formed based on granular constructs and the quality of the produced factorization is assessed in terms of the coverage and specificity of the obtained granular results. A collection of experiments is included to present the performance of factorization and its parametric analysis. In addition, the proposed algorithm comes with sound interpretability in terms of both the structure of the model and an intuitive meaning of the fuzzy relations being the result of factorization.
This paper introduces a concept and design of decision trees based on information granules - multivariable entities characterized by high homogeneity (low variability). As such granules are developed via fuzzy clustering and play a pivotal role in the growth of the decision trees, they will be referred to as C-fuzzy decision trees. In contrast with "standard" decision trees in which one variable (feature) is considered at a time, this form of decision trees involves all variables that are considered at each node of the tree. Obviously, this gives rise to a completely new geometry of the partition of the feature space that is quite different from the guillotine cuts implemented by standard decision trees. The growth of the C-decision tree is realized by expanding a node of tree characterized by the highest variability of the information granule residing there. This paper shows how the tree is grown depending on some additional node expansion criteria such as cardinality (number of data) at a given node and a level of structural dependencies (structurability) of data existing there. A series of experiments is reported using both synthetic and machine learning data sets. The results are compared with those produced by the "standard" version of the decision tree (namely, C4.5).
