Journal of Intelligent & Fuzzy Systems - Volume 30, issue 1

Authors: Bagheri, Mansour | Miri, Mahmoud | Shabakhty, Naser

Article Type: Research Article

Abstract: In real world application of structural reliability analysis some random variables contains two types of random and epistemic uncertainty, while in classic methods of structural reliability only the random uncertainty is considered completely. Therefore in order to have a reliable estimation of structural safety, random variables should cover both random and epistemic uncertainty. In this paper, modeling of epistemic uncertainty of random variables has been brought in to focus. Hybrid random variables are simulated using fuzzy numbers. A new alpha level set optimization approach applying particle swarm optimization technique was addressed in order to determine the minimum and the maximum …members of reliability index interval. Importance sampling technique was used for reliability analysis to decrease the computational effort. Three numerical examples were given to illustrate the accuracy and efficiency of the proposed method. Results showed that the proposed method was more efficient compared to the alternative search approaches thorough low computational burden. Show more

Keywords: Fuzzy RandomVariable (FRV), alpha level set optimization, ParticleSwarm Optimization (PSO), Importance Sampling (IS)

DOI: 10.3233/IFS-151749

Citation: Journal of Intelligent & Fuzzy Systems, vol. 30, no. 1, pp. 235-244, 2016

Authors: Jin, Cong | Jin, Shu-Wei

Article Type: Research Article

Abstract: Digital watermark technology has been proposed as an effective method to protect the copyright of digital image. By exploiting the characteristic of human visual system (HVS) and considering properties of discrete wavelet transform (DWT) coefficient, a novel image watermark scheme is designed in this paper. For embedding watermark, it selects wavelet detail coefficients to utilize HVS characteristic by fuzzy rough sets (FRS). The proposed scheme provides to select wavelet coefficients method using the fuzzy lower and upper approximations, which is partitioned by the FRS according to HVS. The experimental results confirm that the embedded watermarks by the proposed scheme are …robust against common image processing attacks, such as JPEG compression, Gaussian noise, Salt & Pepper noise, cropping, mean filtering, wiener filtering, histogram equalization, and scaling etc. Proposed scheme can provide very good results in terms of image imperceptibility, too. Show more

Keywords: Digital image watermark, human visual system, imperceptibility, fuzzy rough sets, robustness, wavelets

DOI: 10.3233/IFS-151750

Citation: Journal of Intelligent & Fuzzy Systems, vol. 30, no. 1, pp. 245-256, 2016

Authors: Kalanat, Nasrin | Minaei-Bidgoli, Behrouz

Article Type: Research Article

Abstract: Most of machine learning and data mining techniques only focus on finding patterns satisfying technical interestingness measures. They do not consider business interestingness measures in the mining process, so most of mined patterns may not be usable in corresponding domain. Moreover, the techniques do not interpret the patterns in order that business people know what actions to take to support their business decisions. They require a considerable amount of extra work by domain experts to interpret the patterns. Actionable Knowledge Discovery techniques deliver technical and business significant patterns and support automatically converting patterns into deliverables in business-friendly and operable forms …such as actions. In this paper, we incorporate fuzzy set theory and attribute flexibility for the enhancement fuzzy cost-effective action mining algorithm (F-CEAMA). We present an algorithm that suggests actions regarding to their practical applicability. The algorithm takes into account attribute flexibility and fuzzy cost of actions and attempts to maximize the fuzzy net profit. The contribution of the work is in taking the output from fuzzy decision tree, using flexibility of its attributes, and producing novel and actionable knowledge through automatic fuzzy post processing. The performance of proposed algorithm is compared to F-CEAMA using several real-life datasets taken from the UCI Machine Learning Repository. Experimental results show that the proposed algorithm outperforms F-CEAMA not only in finding more actions but also in finding actions with more fuzzy net profit. Show more

Keywords: Actionable knowledge discovery, action mining, fuzzy decision tree, flexibility

DOI: 10.3233/IFS-151751

Citation: Journal of Intelligent & Fuzzy Systems, vol. 30, no. 1, pp. 257-265, 2016

Authors: Chen, Dong | Cao, Erbao | Lai, Wentian

Article Type: Research Article

Abstract: In this paper, a pickups and deliveries problem with fuzzy time windows (PDPFTW) is presented and solved. The customer service level associated with time window is characterized by fuzzy membership functions based on fuzzy set theory. A novel multi-objective fuzzy programming model of PDPFTW is proposed. The proposed model aims at minimizing the vehicle numbers and the overall travel costs and maximizing the total customer service level. A novel differential evolution algorithm (DE) for PDPFTW is also proposed. In DE, we first adopted the novel decimal coding to construct an initial population, and then used some improved differential evolution operators …unlike existing algorithm, in mutation operation, we used an integer order criterion based on natural number coding method and introduced a penalty technical to publish the infeasible solution. In addition, in the crossover operation, we designed a self-adapting crossover probability that varied with iteration. Our experimental results demonstrate the efficiency of the proposed DE, which saved some running time compare with GA in 100,200,400 and 1000 cases. At the same time, DE can get better solutions compare with GA in total distance of vehicles, total services level of customers and vehicle numbers. Moreover, we found that total service level would increase with wider time window. Show more

Keywords: Differential evolution algorithm, vehicle routing problem, pickups and deliveries, fuzzy, time window

DOI: 10.3233/IFS-151752

Citation: Journal of Intelligent & Fuzzy Systems, vol. 30, no. 1, pp. 267-277, 2016

Authors: Lin, Jian | Zhang, Qiang

Article Type: Research Article

Abstract: The least square B-nucleolus for fuzzy cooperative games is proposed based on the bi-excess of fuzzy coalitions. The proposed solutions consider not only the size of fuzzy coalitions, but also the blocking and constructive powers. The uniqueness of the least square B-prenucleolus for fuzzy cooperative games is proved detailedly. Some quadratic programming models for generating the least square B-nucleolus of complete and incomplete fuzzy cooperative games are presented, respectively. The least square B-prenucleolus is extended to the multiplicative setting, and the logarithmic least square B-prenucleolus for multiplicative fuzzy cooperative games is derived.

Keywords: Least square nucleolus, cooperative game, quadratic programming, fuzzy coalition

DOI: 10.3233/IFS-151754

Citation: Journal of Intelligent & Fuzzy Systems, vol. 30, no. 1, pp. 279-289, 2016

Authors: Wu, Xiu-Yun | Bai, Shi-Zhong

Article Type: Research Article

Abstract: Three Lowen factors, namely, ω , [ ] and ι , are extended into I -fuzzy topogenous spaces and their properties are studied. Then concepts of induced I -fuzzy topogenous spaces, weakly induced I -fuzzy topogenous spaces and stratified I -fuzzy topogenous spaces are introduced and characterized by Lowen factors. Also, relations among these spaces can also be preserved in their quotient spaces and subspaces.

Keywords: Fuzzy topogenous order, I-fuzzy topogenous order, weakly induced I-fuzzy topogenous order, induced I-fuzzy topogenous order, stratified I-fuzzy topogenous order

DOI: 10.3233/IFS-151755

Citation: Journal of Intelligent & Fuzzy Systems, vol. 30, no. 1, pp. 291-302, 2016

Authors: Liu, Caihui | Pedrycz, Witold

Article Type: Research Article

Abstract: As a new and meaningful extension of the Pawlak rough set, multi-granulation rough sets (MGRSs) have attracted much attention and fruitful achievements have been reported in different aspects. By combining with fuzzy rough set, the paper introduces multi-granulation fuzzy rough sets in the covering approximation space, namely, covering-based multi-granulation fuzzy rough sets (CMFRS), which form the extension of fuzzy rough sets. We first investigate several important properties of lower and upper approximations of concepts in covering-based multi-granulation fuzzy rough sets and elaborate on the differences between the proposed models and the existing ones in literature. By employing the notions of …reduct and exclusion of a covering, the paper studies the necessary and sufficient conditions for two CMFRS to generate identical lower and upper approximations of a target concept in the given covering approximation space. Finally, the relationships between the new models are explored in the paper. Show more

Keywords: Covering, exclusion, fuzzy rough sets, multi-granulation, reduct

DOI: 10.3233/IFS-151757

Citation: Journal of Intelligent & Fuzzy Systems, vol. 30, no. 1, pp. 303-318, 2016

Authors: Li, Yuting | Li, Junmin

Article Type: Research Article

Abstract: This paper investigates the state feedback stabilization problem for the fractional order Takagi-Sugeno fuzzy interconnected systems with multiple time delays. A parallel distributed compensate controller based on fractional order Takagi-Sugeno fuzzy model is designed to asymptotically stabilize the fractional order interconnected systems, and a sufficient condition is given in the format of linear matrix inequalities. Simulation examples are given to validate the effectiveness of the approach.

Keywords: Fractional order interconnected systems, multiple time delays, state feedback control, Takagi-Sugeno(T-S) fuzzy model, fractional order duffing chaotic system

DOI: 10.3233/IFS-151758

Citation: Journal of Intelligent & Fuzzy Systems, vol. 30, no. 1, pp. 319-331, 2016

Authors: Lin, Sin Hong | Liao, Ming Hong

Article Type: Research Article

Abstract: Knowledge discovery on social network data can benefit general public, since these data contain latent social trends and valuable information. Recent research finds that preserving data privacy plays a vital role in knowledge discovery. Therefore, social network data need to be anonymized to preserve users’ identity before the data can be released for research purposes. In this paper, we model social network data as directed graphs with signed edge weights; formally define privacy, attack models for the anonymization problem. Based on our analysis, we develop a graph anonymization approach. The other main contribution is our graph clustering algorithm which can …effectively group similar graph nodes into clusters with minimum cluster size constraints. Finally, we carry out a series of experiments to evaluate the effectiveness and utility of our approach on anonymizing social network data. Show more

Keywords: Data publishing, K-anonymity, clustering algorithm, information system

DOI: 10.3233/IFS-151759

Citation: Journal of Intelligent & Fuzzy Systems, vol. 30, no. 1, pp. 333-345, 2016

Authors: Rostami, Reza | Ebrahimnejad, Ali

Article Type: Research Article

Abstract: Network flows over time (also called Dynamic Network Flows) are considered as generalized form of standard (static) networks by adding an element of time. The factor of transit time on the arcs which specify the amount of time it takes for one unit of the flows to pass through a particular arc, make these networks different to traditional form of networks. While in most of network flow problems, transit times and capacities are given constant, stochastic or Fuzzy numbers, in this paper we suppose that transit times, capacities and consequently flows on arcs fall within specific ranges expressed as compact …intervals. This vagueness in transit times, capacities and flows could arise in a number of ways: 1) when determining the exact capacity or transit time quantities is hard and there may happen errors in determining them which intervals reflect the measurement errors; 2) when it is impossible or even it is not needed to produce neither a distribution nor fuzzy functions but transit times, capacities and flows lie within specific ranges, or vary in time within these ranges. While determining the exact time for traveling in specific path in network transportation system is extremely difficult or almost impossible, determination of interval which can describe the range of required time for travelling in the network would be easy and fully operational. Our contribution in this paper is producing maximum flow and quickest s  - t flow algorithms, first to network flows over time with interval-valued capacities and then to T-length bounded network flows over time with interval-valued transit times and capacities. Show more

Keywords: Maximum flows over time, interval-valued transit times, interval-valued capacities, temporally repeated flows

DOI: 10.3233/IFS-151760

Citation: Journal of Intelligent & Fuzzy Systems, vol. 30, no. 1, pp. 347-358, 2016