Multi-view learning becomes increasingly attractive and promising because multimodal or multi-view data are commonly encountered in real-world applications. In this study, we develop a novel multi-view Takagi–Sugeno–Kang (TSK) fuzzy system framework to handle classification problems for such data. We propose an anchor and graph subspace clustering strategy to discover and represent the actual latent data distribution for each view separately. In this way, the discriminate anchors (landmarks) are learned to capture the main structure of the multi-view data. This strategy also provides a computationally efficient clustering algorithm with respect to the number of instances. These resulting anchors are formed as the prototypes of information granules (IGs) for fuzzy modeling. Then we construct an information-granule-based multi-view TSK fuzzy classification model inherited from the natural interpretability of fuzzy rule-based systems. Concretely, the relationship between the multi-view input and label output spaces is depicted by IGs-oriented fuzzy rules. The experimental studies involve various commonly used benchmark datasets, which indicate that our proposed method achieves comparable or better performance compared to the state-of-the-art algorithms.

Incomplete data are frequently encountered and bring difficulties when it comes to further processing. The concepts of granular computing (GrC) help deliver a higher level of abstraction to address this problem. Most of the existing data imputation and related modeling methods are of numeric nature and require prior numeric models to be provided. The underlying objective of this study is to introduce a novel and straightforward approach that uses information granules as a vehicle to effectively represent missing data and build granular fuzzy models directly from resulting hybrid granular and numeric data. The evaluation and optimization of this method are guided by the principle of justifiable granularity engaging the coverage and specificity criteria and carried out with the help of particle swarm optimization. We provide a collection of experimental studies using a synthetic dataset and several publicly available real-world datasets to demonstrate the feasibility and analyze the main features of this method.

We investigate essential relationships between generalization capabilities and fuzziness of fuzzy classifiers (viz., the classifiers whose outputs are vectors of membership grades of a pattern to the individual classes). The study makes a claim and offers sound evidence behind the observation that higher fuzziness of a fuzzy classifier may imply better generalization aspects of the classifier, especially for classification data exhibiting complex boundaries. This observation is not intuitive with a commonly accepted position in “traditional” pattern recognition. The relationship that obeys the conditional maximum entropy principle is experimentally confirmed. Furthermore, the relationship can be explained by the fact that samples located close to classification boundaries are more difficult to be correctly classified than the samples positioned far from the boundaries. This relationship is expected to provide some guidelines as to the improvement of generalization aspects of fuzzy classifiers.

Border Gateway Protocol (BGP) is the core component of the Internet's routing infrastructure. Abnormal routing behavior impairs global Internet connectivity and stability. Hence, designing and implementing anomaly detection algorithms is important for improving performance of routing protocols. While various machine learning techniques may be employed to detect BGP anomalies, their performance strongly depends on the employed learning algorithms. These techniques have multiple variants that often work well for detecting a particular anomaly. In this paper, we use the decision tree and fuzzy rough set methods for feature selection. Decision tree and extreme learning machine classification techniques are then used to maximize the accuracy of detecting BGP anomalies. The proposed techniques are tested using Internet traffic traces.

Choquet Integral (CI), which is known as a fuzzy measure-based technique, has been a general aggregation tool for multi-criteria decision making problem. In this paper, we apply Choquet Integral to unit selection problem in Real Time Strategy (RTS) game. In addition, three new fuzzy integrals named Mean based Fuzzy Integral (Me-based FI), Max-based Fuzzy Integral (Ma-based FI), and Order-based Fuzzy Integral (Or-based FI) are developed, which relax the monotonicity requirement of the traditional fuzzy measures and consider different properties of game play. We compare the performance of Choquet Integral and the new proposed ones on this practical application with highly non-monotonic data. Experiments show that the proposed new fuzzy integrals achieved better learning performance and testing result.

Choquet integral, one of ensemble operators, is used widely in multiple classifiers combination when we consider the interaction between classifiers. The diversity of combination system can affect the classification accuracy and the generalization ability of the combination system. In this paper, two different types of classifiers, neural network and fuzzy decision tree, are introduced in combination system (called mix-combination system). Genetic algorithm is used to determine a non-additive set function μ which is the key issue before Choquet integral combining multiple classifiers. Some simulated experiments are run in iris, pima, cmc three datasets. The experiment results show the mix-combination systems have better performance than the combination systems only including three neural network classifiers or three fuzzy decision tree classifiers.

CBR systems that are built for the classification problems are called CBR classifiers. This paper presents a novel and fast approach to building efficient and competent CBR classifiers that combines both feature reduction (FR) and case selection (CS). It has three central contributions: 1) it develops a fast rough-set method based on relative attribute dependency among features to compute the approximate reduct, 2) it constructs and compares different case selection methods based on the similarity measure and the concepts of case coverage and case reachability, and 3) CBR classifiers built using a combination of the FR and CS processes can reduce the training burden as well as the need to acquire domain knowledge. The overall experimental results demonstrating on four real-life data sets show that the combined FR and CS method can preserve, and may also improve, the solution accuracy while at the same time substantially reducing the storage space. The case retrieval time is also greatly reduced because the use of CBR classifier contains a smaller amount of cases with fewer features. The developed FR and CS combination method is also compared with the kernel PCA and SVMs techniques. Their storage requirement, classification accuracy, and classification speed are presented and discussed.