Brain-computer Interface (BCI) technology enables direct communication between the brain and external devices via non-invasive methods and holds significant potential in neu roengineering, rehabilitation, and human-computer interaction. However, decoding motor imagery (MI) from electroencephalo gram (EEG) signals remains challenging due to these signals' non-stationary characteristics and the limited interpretability of existing deep learning models. In this paper, we propose a novel Hierarchical Collaborative Fuzzy Network (HCFN) for interpretable EEG-based MI decoding. We introduce an Adaptive Fuzzy Temporal Convolutional Network (AFTCN) that employs dynamic fuzzy kernels within causal convolutions to extract robust temporal features from EEG signals. Additionally, we design a fuzzy attention-guided Takagi–Sugeno–Kang (TSK) architecture that achieves a tighter integration between feature extraction and fuzzy inference through a novel fuzzy feedback loop, thereby improving the discriminability of extracted features. Extensive experiments on the BCI Competition IV-2a, IV-2b and OpenBMI datasets, under both subject-dependent and cross subject evaluation paradigms, demonstrate that the proposed model outperforms state-of-the-art methods in classification ac curacy and Cohen's kappa. Furthermore, we provide multi-level interpretability analyses, from macro to micro perspectives, elucidating the model's decision-making processes and highlighting the advantages of our collaborative reasoning framework over conventional cascaded approaches. The code is available at https://github.com/Pitiless-Quinn/HCFN.

Traditional single-center learning algorithms often face significant limitations in handling heterogeneous data integration, including insufficient generalization ability, weak privacy protection, and difficulties adapting to multi-center scenarios. To address these challenges, multi-center learning has emerged as a critical technological framework. Although our previously proposed MKTC-R0T algorithm partially addressed the integration and modeling of multi-center data through the knowledge transfer calibration strategy, it still exhibits notable shortcomings in terms of knowledge fusion stability, model interpretability and generalization, as well as the utilization of complementary information across centers. To overcome these limitations, we propose a Knowledge Calibration Fusion and Label Space Graph Regularization-based Multi-center TSK Fuzzy System (KCF-LSG-MTSK). Specifically, we introduce an enhanced knowledge calibration and fusion strategy to effectively integrate heterogeneous information between the base center (BC) and auxiliary center (AC). We also propose a novel label space graph regularization scheme that constructs both intracenter and intercenter graph structures, leveraging data consistency and complementarity to enhance the quality of knowledge sharing. Furthermore, building upon firstorder TSK fuzzy system optimization, our approach incorporates a projected maximum mean discrepancy (PMMD) transfer term to effectively reduce data distribution discrepancies between the BC and AC. Experimental results on thirteen benchmark datasets demonstrate that KCFLSGMTSK achieves an average accuracy of 88.7%, significantly outperforming stateoftheart singlecenter and multicenter methods, thereby validating the superiority of our approach in heterogeneous data integration, knowledge transfer, and interpretable classification.

To address the challenges of high uncertainty, inter-subject variability, and inefficiency multi-feature utilization in motor imagery electroencephalogram (MI-EEG) classification, this study proposes amultiviewtransferTakagi-Sugeno-Kang (TSK) fuzzy classifier withsoftvariable embedded anddiscriminativestructural preservation (MVT-TSK-SVDS). First, a transfer learning mechanism incorporating soft variable embedding in the consequent part is developed. This mechanism establishes cross-domain correlations via a shared consequent and representation matrix. Within this framework, soft variable embedding and low-rank constrained discriminative learning work in concert to effectively capture supervision information and cross-domain relationships. Second, a local-global structural preservation term incorporating graph embedding and low-rank constraint is implemented to maintain local discriminative information from source domain while integrating global geometric patterns across all data. Third, a multiview adaptive learning framework is designed to address feature representation diversity and information loss during knowledge transfer. MVT-TSK-SVDS dynamically optimizes view-specific contributions through entropy maximization criterion while ensuring collaborative decision via consistency constraints. Experimental results validate strong generalization between and across datasets. Our model achieves 62.16% and 72.71% accuracy in cross-subject tasks on BCI-IV 2a and OpenBMI, respectively. In cross-dataset evaluations, it attains 62.75% accuracy on BCI-IV 2a to OpenBMI and 65.08% accuracy on OpenBMI to BCI-IV 2a, respectively.

Effective pulmonary disease monitoring and diagnosis are crucial for improving patient outcomes and guiding clinical interventions. Pulmonary Electrical Impedance Tomography (EIT) faces challenges due to its nonlinearity and complex data, which has led researchers to directly use raw EIT boundary voltage data for disease classification. However, the data's high non-stationarity, multi-scale time-frequency features, and long-term temporal dependencies limit traditional classification methods. To address these challenges, we propose the Time-Frequency Multi-Scale Convolutional Network (TFMSCNet), a novel architecture that simultaneously captures temporal dynamics and frequency patterns through parallel processing branches. The integrated Multi-Scale Feature Enhancement (MSFE) module adaptively fuses features across different temporal resolutions, enabling robust representation learning from complex EIT signals. Experiments show that TFMSCNet achieves 99.50% accuracy on a private EIT dataset, outperforming eleven baseline methods. Validation on ten public datasets confirms its strong generalization, highlighting its potential for clinical pulmonary disease diagnosis.

Hyperspectral imaging can capture the spectrum of each pixel in an image across various wavelengths, providing unparalleled opportunities for precise detection, classification, and analysis of transportation infrastructure. However, traditional methods often struggle with the curse of dimensionality, inter-class variability, and the spectral-spatial trade-off inherent in hyperspectral data. To address these challenges, we introduce a novel Multi-Source Patch Feature fusion based Neighborhood Flash Attention Transformer (MSPF-NFAT) for pixel-level vehicle and road recognition in hyperspectral images (HSIs). Our methodology hinges on the insight that the integration of complementary features from multiple sources and scales can significantly enhance classification performance. Specifically, the MSPF is designed to aggregate and harmonize features extracted from both spectral and spatial dimensions, as well as from different contextual scales within the image. This fusion process ensures a richer representation of the data, capturing both the fine-grained details and the broader contextual information essential for accurate classification. Building upon this enriched feature set, we employ the NFAT, a state-of-the-art attention mechanism that focuses on capturing local spatial relationships while efficiently scaling to accommodate the high-resolution characteristics of hyperspectral data. In addition, extensive experimental results on four widely used HSIs datasets show that our newly proposed method provides superior performance compared to other state-of-the-art methods.

Skin diseases rank among the most prevalent ailments in humans, which underscores the critical importance of early detection and diagnosis. Considering clinical practice, the integration of information from various modalities holds significant potential to enhance diagnostic accuracy and precision. In this study, we propose a multi-modal and multi-attention fusion network for multi-task skin disease classification. We initially devise the Shifted Window Cross-attention Fusion (SWCF) module based on the shifted window self-attention mechanism, leveraging the advantages of the attention mechanism to learn the correlations between different modalities and fully integrate multi-modal features. Subsequently, taking into account the heterogeneity of the data, we employ the Heterogeneous Data Cross-attention Fusion (HDCF) module using the idea of information decoupling and separation processing to integrate image and text data. Additionally, we suggest the Dynamic Loss Weight Allocation (DLWA) method for multi-task learning to refine the training procedure. We confirm the superiority of the proposed method on the publicly available multi-modal skin lesion dataset, Derm7pt. The average accuracy of multi-modal skin disease classification is 79.14%, surpassing the current state-of-the-art methods.

Knowledge graph completion (KGC) aims to infer missing or incomplete parts in knowledge graph.The existing models are generally divided into structure-based and descriptionbased models, among description-based models often require longer training and inference times as well as increased memory usage.In this paper, we propose Pre-Encoded Masked Language Model (PEMLM) 1 to efficiently solve KGC problem.By encoding textual descriptions into semantic representations before training, the necessary resources are significantly reduced.Furthermore, we introduce a straightforward but effective fusion framework to integrate structural embedding with pre-encoded semantic description, which enhances the model's prediction performance on 1-N relations.The experimental results demonstrate that our proposed strategy attains state-of-the-art performance on the WN18RR (MRR+5.4% and Hits@1+6.4%)and UMLS datasets.Compared to existing models, we have increased inference speed by 30x and reduced training memory by approximately 60%.

The one‐class classification (OCC) problem has always been a popular topic because it is difficult or expensive to obtain abnormal data in many practical applications. Most of OCC methods focused on monomodal data, such as support vector data description (SVDD) and its variants, while we often face multimodal data in reality. The data come from the same task in multimodal learning, and thus, the inherent structures among all modalities should be hold, which is called the consistency principle. However, each modality contains unique information that can be used to repair the incompleteness of other modalities. It is called the complementarity principle. To follow the above two principles, we designed a multimodal graph–regularized term and a sparse projection matrix–regularized term. The former aims to preserve the within‐modal structural and between‐modal relationships, while the latter aims to richly use the complementarity information hidden in multimodal data. Further, we follow the multimodal subspace (MS) SVDD architecture and use two regularized terms to regularize SVDD. Consequently, a novel OCC method for multimodal data is proposed, called the consistency and complementarity jointly regularized subspace SVDD (CCS‐SVDD). Extensive experimental results demonstrate that our approach is more effective and competitive than other algorithms. The source codes are available at https://github.com/wongchuang/CCS_SVDD .

Abstract Internet of autonomous unmanned vehicles (IAUV) is a global network of sensors, robots, and autonomous vehicles. Person re‐identification (Re‐ID) is an important intelligent transportation application in IAUV, which needs to be solved using artificial intelligence algorithms. In this study, a domain adaptation metric learning method embedded with structural information (called DAML‐ESI) is designed for person Re‐ID in IAUV. Due to the lack of labeling information in the target domain, DAML‐ESI realizes person Re‐ID with the help of the discriminative and structural information of pedestrian images of related domains. DAML‐ESI projects pedestrian images selected from different domains into a common metric space and establishes a discriminative metric learning model, which requires that the positive sample pair be mapped to a point, and the distance distribution of the negative sample pair be mapped to a fixed value. The projection matrix learned by DAML‐ESI is used to eliminate the distribution differences between different domains, and the distance metric is used to ensure that the learned metric learning model has strong discriminative ability in the metric space. To verify the effectiveness of DAML‐ESI, experimental comparisons are conducted on three person Re‐ID datasets, and DAML‐ESI achieves satisfactory recognition performance.

In an effective process of cluster analysis, it is indispensable to validate the goodness of different partitions after clustering. Existing internal validation indexes are implemented based on distance and variance, which cannot catpure the real “density” of the cluster. Moreover the time complexity for distance-based indexes is usually too high to be applied for large datasets. Therefore, we propose a novel internal validation index based on the differential entropy, namedinternal purity(IP). The proposed IP index can effectively measure the purity of a cluster without using the external cluster information, and successfully overcome the drawbacks of existing internal indexes. Based on deep representation settings, where six powerful deep pretrained representation models are used, and nondeep representation settings, we use five basic crisp and fuzzy clustering algorithms to compare our index with 17 other well-known internal indexes on five text, five image datasets, and five tabular datasets. The results show that, for 105 test cases in total, our IP index can return the optimal clustering results in 61 cases while the second best index can merely report the optimal partition in 20 cases, which demonstrates the significant superiority of our IP index when validating the goodness of the clustering results. Moreover, theoretical analysis for the effectiveness and efficiency of the proposed index are also provided.

The diagnosis and treatment of epilepsy necessitate the precise identification and classification of electroencephalogram (EEG) signals. However, EEG samples from different medical institutions often exhibit variability due to factors such as institutional characteristics, geographic locations, and the professional levels of physicians. This variability limits the widespread application of existing methods in small or single medical institutions, as they typically rely on large-scale and high-quality datasets. To rapidly assist small or single medical institutions in constructing models for the diagnosis and classification of epileptic EEG signals that are both highly generalizable and interpretable while ensuring patient privacy, this article proposes an innovative learning framework named Multicenter Knowledge Transfer Calibration with rapid zeroth-order TSK fuzzy system (MKTC-R0T). This method employs the zeroth-order TSK fuzzy system as the baseline model for each center and integrates a knowledge transfer calibration strategy within a multicenter learning framework, aiming to enhance the model's generalizability and classification accuracy in the face of inconsistent sample quality and sample heterogeneity. Specifically, MKTC-R0T first establishes a base center model in a large medical institution, and then, by imitating the forgetting mechanism of the human brain, a portion of the knowledge at the base center is randomly forgotten, while the remaining knowledge is utilized to assist the auxiliary centers in rapidly deploying models. Ultimately, through a knowledge integration strategy, all centers collectively guide the target center in building an efficient linear system for the diagnosis and classification of epileptic EEG signals. Extensive experiments conducted on 12 epilepsy EEG signal datasets have validated that MKTC-R0T outperforms other typical algorithms in terms of running time, deployment speed, rule complexity, and the model's generalization and robustness, which demonstrates the substantial potential of MKTC-R0T in the field of epilepsy EEG signal diagnosis and classification.

With the spread of COVID-19 in recent years, wearing masks has increased the difficulty of driver mental fatigue recognition. Electroencephalogram (EEG) signal has become an important physiological signal index to reflect the driver’s mental state. However, the drivers’ EEG data is plagued by inadequate labels and multi-view data, which makes classification difficult. To solve this problem, this study proposes asemi-supervisedmulti-viewsparse regularization andgraph embedding learning (SMSG) model. To obtain discriminative feature representations of semi-supervised EEG data, SMSG fully mines diverse information from multiple views based on sparse regularization embedding and graph embedding technology. SMSG employs the graph embedding to capture the discriminative structure and local manifold structure on multi-view data. Furthermore, SMSG learns the common shared regularization embedding and private regularization embedding factors to preserve the consistency and diversity of the multi-view data. Through self-adaptive learning, the weights of each view can be directly solved adaptively. This works also introduces kernel trick to project the SMSG model into the nonlinear reproducing kernel Hilbert space (RKHS), which can obtain more approximate EEG feature representation. Experiments on the real dataset verify the effectiveness of the SMSG model for EEG-based driver mental fatigue recognition.

3D convolution networks play an important role in extracting spatiotemporal features in video action recognition. However, it usually brings a large number of paramters, which results in deployment difficulty in edge devices with limited memory space. Although lightweight 3DCNNs can reduce the mode size significantly, it causes a serious loss of accuracy. This paper proposes a novel approach to reduce the model size while preserves accuracy by combining lightweight networks with structural reparameterization. To reduce the model size, we propose 3D-DBB module, based on 2D Diverse Branch Block(DBB). Furthermore, we propose three structures based on 3D-DBB: (1) 3D depthwise convolution (called 3D-DBB-DepthWise), (2) the 3D pointwise convolution (called 3D-DBB-PointWise), and (3) reparameterizable depthwise separable structure (called DP3DBB), which is the concatenation of the two previous structures. We design and compare the effect of two different replacements for replacing depthwise separable structures in lightweight networks. Our method achieves 93.33% with only 0.42% loss in accuracy when the model size is only 1/50 of that of 3D-ResNeXt101.

Hyperspectral images (HSI) are more informative than other remote sensing techniques and hence frequently utilized in numerous domains. Convolutional neural network algorithm provides outstanding performance in image processing and currently has established as the main approach in the field of HSI classification . HSI contain numerous channels with various spatial and spectral feature information, and simultaneously contain massive redundant information, leading to dimensional explosion or gradient disappearance in the process of classification. A multilayer network model based on Exponential Linear Units-guided Depthwise Separable Convolution is proposed in this paper to extract both spectral and spatial features from HSI at scales ranging, and the feature maps are then fed into a cross-attention mechanism for weight allocation to improve local feature information and optimize computational resource allocation. Extensive experiments on three well-known hyperspectral datasets are conducted, and the results show that the proposed network model can accurately complete the required HSI classification operation and outperforms other well-established techniques in terms of computing efficiency.

With the development of sensors, more and more multimodal data are accumulated, especially in biomedical and bioinformatics fields. Therefore, multimodal data analysis becomes very important and urgent. In this study, we combine multi-kernel learning and transfer learning, and propose a feature-level multi-modality fusion model with insufficient training samples. To be specific, we firstly extend kernel Ridge regression to its multi-kernel version under the lp-norm constraint to explore complementary patterns contained in multimodal data. Then we use marginal probability distribution adaption to minimize the distribution differences between the source domain and the target domain to solve the problem of insufficient training samples. Based on epilepsy EEG data provided by the University of Bonn, we construct 12 multi-modality & transfer scenarios to evaluate our model. Experimental results show that compared with baselines, our model performs better on most scenarios.

Epilepsy recognition based on electroencephalogram (EEG) and artificial intelligence technology is the main tool of health analysis and diagnosis in Internet of medical things (IoMT). As a distributed learning framework, federated learning can train a shared model from multiple independent edge nodes using local data, which has greatly promoted the development of IoMT. One of the main challenges of EEG-based epilepsy recognition in IoMT is that EEG records show varying distributions in different devices, different times, and different people. This nonstationary characteristic of EEG reduces the accuracy of the recognition model. To improve the classification performance in IoMT, a hierarchical domain adaptation projective dictionary pair learning (HDA-PDPL) model is developed in the study. HDA-PDPL integrates EEG signals from different domains (person, edge nodes, devices, etc.) into a set of hierarchical subspace and simultaneously learns synthesis and analysis dictionary pairs in each layer. Specifically, a nonlinear transform function is introduced to seek hierarchical feature projection. The domain adaptation term on sparse coding builds a connection between different domains. Thus, the shared synthesis and analysis dictionaries can encode domain-invariant representation and discrimination knowledge from different domains. Besides, the local preserved term of projective codes is introduced to capture the potential discriminative local structures of samples. The experimental results on two EEG epilepsy classifications verified that the HDA-PDPL model can outperform other comparisons by utilizing more shared knowledge of different domains.

Federated learning is a promising solution in several industries for co-training models among distributed clients via centralized servers without leaving private user data on the devices. Thus, federated learning can be seen as a stimulus for the edge computing paradigm as it supports collaborative learning and model optimization. In view of the strict requirements for data security and system reliability of hyperspectral classification techniques for surveillance, aerospace, and military missions, this paper proposes a novel stereo attention cross-decoupling fusion-guided federated neural learning algorithm for hyperspectral image classification, which first trains client devices using a scalable federated learning approach consisting of master server, secure aggregator and edge client devices of a certain size.The distributed devices train local models of the neural network for classifying hyperspectral images and send them to the secure aggregator, which aggregates the local models using a weighted averaging strategy and sends them to the master server for iteration. In addition, the stereo attention cross-decoupling fusion module is used to mine the multidimensional spatial details of the hyperspectral images, specifically by first extracting the most discriminative features from different directions (horizontal, vertical, and spatial) using the attention mechanism, and then using the decoupling fusion strategy to classify the original feature map into three levels: significant, minor, and redundant, and use them to model the multidimensional spatial relationships, thus strengthening the capability to represent features. Extensive experiments on several public datasets have shown that the proposed method provides competitive performance and, more importantly, is effective in enhancing privacy and reliability for hyperspectral image classification.

Currently, the use of rich spectral and spatial information of hyperspectral images (HSIs) to classify ground objects is a research hotspot. However, the classification ability of existing models is significantly affected by its high data dimensionality and massive information redundancy. Therefore, we focus on the elimination of redundant information and the mining of promising features and propose a novel Bole convolution (BC) neural network with a tandem three-direction attention (TDA) mechanism (BTA-Net) for the classification of HSI. A new BC is proposed for the first time in this algorithm, whose core idea is to enhance effective features and eliminate redundant features through feature punishment and reward strategies. Considering that traditional attention mechanisms often assign weights in a one-direction manner, leading to a loss of the relationship between the spectra, a novel three-direction (horizontal, vertical, and spatial directions) attention mechanism is proposed, and an addition strategy and a maximization strategy are used to jointly assign weights to improve the context sensitivity of spatial–spectral features. In addition, we also designed a tandem TDA mechanism module and combined it with a multiscale BC output to improve classification accuracy and stability even when training samples are small and unbalanced. We conducted scene classification experiments on four commonly used hyperspectral datasets to demonstrate the superiority of the proposed model. The proposed algorithm achieves competitive performance on small samples and unbalanced data, according to the results of comparison and ablation experiments. The source code for BTA-Net can be found athttps://github.com/vivitsai/BTA-Net.

Although convolutional neural networks (CNNs) have shown superior performance to traditional machine learning algorithms for hyperspectral image classification tasks, the ability of traditional CNNs to model remote dependencies in the spatial orientation of HSIs is still limited, and they always extract similar low-level features, leading to feature redundancy. To cope with this limitation, this paper proposes a novel multi-order statistical representation-guided graph convolution and continuous context threshold-aware network for the classification of hyperspectral images with limited training samples. Initially, the spectral spatial information is separately modeled using first-order features and second-order pooling operators. Secondly, we propose graph-structuring the patch’s features. By employing a random walk transition probability matrix, graph-structured convolution can mine more discriminative direction features. In addition, we design a continuous context threshold-aware network to model multidimensional spatial relationships, thereby enhancing the representation of graph features. Specifically, the cross-attention mechanism is used to calculate the attention weights in the vertical and horizontal directions, and the features are divided into two levels—important and secondary—by solving the cosine distance between feature vectors, and the former is retained and the latter is punished. Extensive experiments on multiple HSIs datasets demonstrated that the proposed method delivers competitive performance. The code will be available at: https://github.com/vivitsai/GSC-CCTA.

The safety monitoring system of intelligent transportation provides driving fatigue warning and risk control. Electroencephalogram (EEG) signals can directly reflect the neuronal activity of the brain. The detection and early warning of driving fatigue using EEG signals has important practical significance. However, because of the non-stationarity and timeliness of EEG signals, the single feature detection method is significantly impacted by data distribution differences. In this paper, in the framework of multi-input multi-output (MIMO) Takagi-Sugeno-Kang (TSK) fuzzy system, transferable TSK fuzzy classifier with multi-views (T-TSK-MV) is developed for EEG-based driving fatigue recognition in intelligent transportation. First, in view-specific consequent parameter learning, the view-specific consequent regularizer is designed based on technologies of ridge regression, maximum mean discrepancy (MMD), and manifold regularization, which becomes the bridge to transfer the discriminative information from the related domain to the target domain. In addition, the$\ell _{2,1} $-norm sparse constraint on consequent parameters is used to simplify fuzzy rules. Then multi-view learning is integrated into the consequent parameter learning, in which T-TSK-MV explores the view-shared consequent regularizer and adaptively assigns weights to each view. The$\ell _{2,1} $-norm sparse constraint on view-shared consequent regularizer can effectively exploit the local structure of multi-view data. Finally, the fuzzy classifier is constructed on view-specific regularizers and view weights. The experiment on real-word datasets shows that the proposed fuzzy classifier can significantly improve the driving fatigue recognition performance.

Decomposition methods play a critical role in cooperative co-evolutionary algorithms (CCEAs) for solving large-scale optimization problems. Although some well-performing decomposition methods have been designed based on the interactions among variables (IaV), their grouping accuracy is still limited due to the poor performance on the overlapping problems and the computational roundoff errors of IaV in the implementation. To deal with these limitations, a graph-based deep decomposition (GDD) method is proposed to obtain more accurate grouping results, especially for the overlapping problems. On the one hand, the GDD mines the IaV information and obtains the minimum vertex separator of the interaction graph of variables, so as to group variables deeply and recursively. On the other hand, the GDD has the ability of fault tolerance to deal with the computational roundoff errors of IaV and can improve the grouping accuracy. For better experimental studies of overlapping problems, a novel overlapping function generator is designed with the random and complicate overlap type, and two new metrics are proposed to evaluate the grouping accuracy. Comprehensive experiments show that GDD can greatly improve the grouping accuracy and help CCEAs perform better than other existing algorithms, especially on the overlapping problems. In addition, the GDD is highly fault tolerant and can divide problems accurately even on the inaccurate IaV.

Cognitive computing is dedicated to researching a computing principle and method that can simulate the intelligence ability of human brain. Human emotion is the basic component of human cognitive activities. Electroencephalogram (EEG) computer signals obtained from a brain computer interface are difficult to conceal, and using machine learning methods to analyze EEG emotion is a hot topic in artificial intelligence. However, the EEG signal is non-stationary, making it difficult to select sufficient data from the same person to train a classifier for a subject. To promote the performance of emotion recognition methods, a multi-source domain transfer discriminative dictionary learning modeling (MDTDDL) is proposed in this study. The method integrates transfer learning and dictionary learning in a learning model, including the concepts of subspace learning, manifold smoothness, margin-based discriminant embedding, and large margin. The domain-specific transformation matrix projects EEG signals from various domains into the transfer subspace. The domain-invariant dictionary can find potential connections between multiple source domains and target domain. The manifold smoothness and margin-based discriminant embedding term further improve the model’s learning ability. The alternating optimization technique is used in model solving to efficiently compute model parameters. Experiments on the SEED and DEAP datasets demonstrate the effectiveness of MDTDDL.

Supply chain management (SCM) is a significant and complex system in a smart city that requires advanced artificial intelligence (AI) and optimization techniques. The multiobjective supply chain configuration (MOSCC) in SCM is to set the optimal configurations for supply chain members to minimize both the cost of goods sold ($CoGS$) and the lead time ($LT$). Although some algorithms have been proposed for the MOSCC, they do not make the best use of the problem-related knowledge and cannot perform well on the large-scale instances with many members and configuration options. Therefore, this article proposes a multipopulation ant colony system with knowledge-based local searches (MPACS-KLSs). First, the multiobjective algorithm is based on the multiple populations for multiple objectives framework. Two ant colonies are used to separately minimize$CoGS$and$LT$, which helps to search in the biobjective space sufficiently. Second, with the considerations of the problem-related knowledge, a priority-based solution construction method, a rank-based heuristic strategy, and an objective-oriented global pheromone updating strategy are proposed. Third, to speed up the convergence, especially for large-scale MOSCC instances, two knowledge-based local searches are designed to minimize$CoGS$and$LT$of solutions, respectively. Exhaustive experiments are conducted on both the instances from the real life and the randomly generated instances with different problem scales. The results show that MPACS-KLS is superior to the contestant algorithms, especially on the large-scale MOSCC instances, which significantly extends the AI and optimization techniques in practical applications of the smart city.

Computed tomography (CT) provides information for diagnosis, PET attenuation correction (AC), and radiation treatment planning (RTP). Disadvantages of CT include poor soft tissue contrast and exposure to ionizing radiation. While MRI can overcome these disadvantages, it lacks the photon absorption information needed for PET AC and RTP. Thus, an intelligent transformation from MR to CT, i.e., the MR-based synthetic CT generation, is of great interest as it would support PET/MR AC and MR-only RTP. Using an MR pulse sequence that combines ultra-short echo time (UTE) and modified Dixon (mDixon), we propose a novel method for synthetic CT generation jointly leveraging prior knowledge as well as partial supervision (SCT-PK-PS for short) on large-field-of-view images that span abdomen and pelvis. Two key machine learning techniques, i.e., the knowledge-leveraged transfer fuzzy c-means (KL-TFCM) and the Laplacian support vector machine (LapSVM), are used in SCT-PK-PS. The significance of our effort is threefold: 1) Using the prior knowledge-referenced KL-TFCM clustering, SCT-PK-PS is able to group the feature data of MR images into five initial clusters of fat, soft tissue, air, bone, and bone marrow. Via these initial partitions, clusters needing to be refined are observed and for each of them a few additionally labeled examples are given as the partial supervision for the subsequent semi-supervised classification using LapSVM; 2) Partial supervision is usually insufficient for conventional algorithms to learn the insightful classifier. Instead, exploiting not only the given supervision but also the manifold structure embedded primarily in numerous unlabeled data, LapSVM is capable of training multiple desired tissue-recognizers; 3) Benefiting from the joint use of KL-TFCM and LapSVM, and assisted by the edge detector filter based feature extraction, the proposed SCT-PK-PS method features good recognition accuracy of tissue types, which ultimately facilitates the good transformation from MR images to CT images of the abdomen-pelvis. Applying the method on twenty subjects' feature data of UTE-mDixon MR images, the average score of the mean absolute prediction deviation (MAPD) of all subjects is 140.72 ± 30.60 HU which is statistically significantly better than the 241.36 ± 21.79 HU obtained using the all-water method, the 262.77 ± 42.22 HU obtained using the four-cluster-partitioning (FCP, i.e., external-air, internal-air, fat, and soft tissue) method, and the 197.05 ± 76.53 HU obtained via the conventional SVM method. These results demonstrate the effectiveness of our method for the intelligent transformation from MR to CT on the body section of abdomen-pelvis.

Industry 4.0 places special emphasis on the use of intelligent models to discover patterns in data. In this article, we propose a novel Takagi-Sugeno-Kang (TSK) fuzzy system with low model complexity for multiview data pattern discovery. Compared with the classic TSK fuzzy systems, the proposed one has three merits: First, we introduce a transformation matrix to relax the strict binary label matrix of the training set so that the margins between classes become more discriminative. Second, we introduce two kinds of sparsity regularizations, i.e., cross-rule and cross-view, to reduce indiscriminative fuzzy rules and consequent parameters so that the model complexity is significantly reduced. Third, we introduce the alternating direction method of multipliers to optimize the objective function so that we have compact closed-form solutions in each iteration. Extensive experiments on different kinds of multiview image datasets indicate the promising performance for data pattern discovery with low model complexity.

We attempt to intelligently identify violations of throwing waste from vehicles (TWV) in real-time traffic surveillance videos. In addition to polluting the environment, TWV easily causes injury to sanitation workers responsible for cleaning roads by passing vehicles. However, manual inspection is still the commonest way to recognize such uncivilized behavior in videos with very high time and labor-consuming. In answer to these challenges, we design a novel 20-layer residual network (Nov-ResNet-20) for training the vehicle-thrown-waste identification model (VTWIM). Then, incorporating Nov-ResNet-20, Selective Search, and Non-Maximum Suppression (NMS), we propose the deep-residual-network-leveraged vehicle-thrown-waste identification method (DRN-VTWI). Our method first splits one video frame into several regions matching suspected objects marked with location boxes via Selective Search. Then, in terms of the VTWIM trained by Nov-ResNet-20 our method identifies the regions containing TWV. Last, our method removes the redundant location boxes for each recognized, vehicle-thrown waste and only keeps the best one. The significance of our work is four-fold: 1) Nov-ResNet-20 has a moderate depth: 6 convolutional layers, 7 residual layers, and in total 20 weight layers. Due to the joint contribution of the residual, batch normalization, dropout, and cross-entropy loss, it is eligible to identify TWV using a small quantity of manually-annotated training samples. 2) Selective Search diversely marks all possible, suspected objects in video frames, whereas NMS keeps the best location box for each recognized vehicle-thrown waste, removing all redundancies. In this way, DRN-VTWI finds potential violations of TWV as many as possible and optimally annotates vehicle-thrown wastes in frames as well. 3) Combining the power of Nov-ResNet-20, Selective Search, and NMS, DRN-VTWI well solves the challenging, intelligent identification of vehicle-thrown wastes for real-time traffic surveillance. Experimental studies conducted on real-time traffic surveillance videos demonstrate the effectiveness as well as superiority of our efforts.

Using unsupervised learning methods for clinical diagnosis is very meaningful. In this study, we propose an unsupervised multi-view & multi-medoid variant-entropy-based fuzzy clustering (M 2 VEFC) method for epilepsy EEG signals detecting. Comparing with existing related studies, M 2 VEFC has four main merits and contributions: (1) Features in original EEG data are represented from different perspectives that can provide more pattern information for epilepsy signals detecting. (2) During multi-view modeling, multi-medoids are used to capture the structure of clusters in each view. Furthermore, we assume that the medoids in a cluster observed from different views should keep invariant, which is taken as one of the collaborative learning mechanisms in this study. (3) A variant entropy is designed as another collaborative learning mechanism in which view weight learning is controlled by a user-free parameter. The parameter is derived from the distribution of samples in each view such that the learned weights have more discrimination. (4) M 2 VEFC does not need original data as its input—it only needs a similarity matrix and feature statistical information. Therefore, the original data are not exposed to users and hence the privacy is protected. We use several different kinds of feature extraction techniques to extract several groups of features as multi-view data from original EEG data to test the proposed method M 2 VEFC. Experimental results indicate M 2 VEFC achieves a promising performance that is better than benchmarking models.

We propose a new method for generating synthetic CT images from modified Dixon (mDixon) MR data. The synthetic CT is used for attenuation correction (AC) when reconstructing PET data on abdomen and pelvis. While MR does not intrinsically contain any information about photon attenuation, AC is needed in PET/MR systems in order to be quantitatively accurate and to meet qualification standards required for use in many multi-center trials. Existing MR-based synthetic CT generation methods either use advanced MR sequences that have long acquisition time and limited clinical availability or use matching of the MR images from a newly scanned subject to images in a library of MR-CT pairs which has difficulty in accounting for the diversity of human anatomy especially in patients that have pathologies. To address these deficiencies, we present a five-phase interlinked method that uses mDixon MR acquisition and advanced machine learning methods for synthetic CT generation. Both transfer fuzzy clustering and active learning-based classification (TFC-ALC) are used. The significance of our efforts is fourfold: 1) TFC-ALC is capable of better synthetic CT generation than methods currently in use on the challenging abdomen using only common Dixon-based scanning. 2) TFC partitions MR voxels initially into the four groups regarding fat, bone, air, and soft tissue via transfer learning; ALC can learn insightful classifiers, using as few but informative labeled examples as possible to precisely distinguish bone, air, and soft tissue. Combining them, the TFC-ALC method successfully overcomes the inherent imperfection and potential uncertainty regarding the co-registration between CT and MR images. 3) Compared with existing methods, TFC-ALC features not only preferable synthetic CT generation but also improved parameter robustness, which facilitates its clinical practicability. Applying the proposed approach on mDixon-MR data from ten subjects, the average score of the mean absolute prediction deviation (MAPD) was 89.78±8.76 which is significantly better than the 133.17±9.67 obtained using the all-water (AW) method (p=4.11E-9) and the 104.97±10.03 obtained using the four-cluster-partitioning (FCP, i.e., external-air, internal-air, fat, and soft tissue) method (p=0.002). 4) Experiments in the PET SUV errors of these approaches show that TFC-ALC achieves the highest SUV accuracy and can generally reduce the SUV errors to 5% or less. These experimental results distinctively demonstrate the effectiveness of our proposed TFCALC method for the synthetic CT generation on abdomen and pelvis using only the commonly-available Dixon pulse sequence.

Recognition of epileptic electroencephalogram (EEG) signals using machine learning techniques is becoming popular. In general, the construction of intelligent epileptic EEG recognition system involves two steps. First, an appropriate feature extraction method is applied to obtain representative features from the original raw EEG signals. Second, an effective intelligent model is trained based on the extracted features. However, there exist two major challenges in the process: 1) it is nontrivial to determine the appropriate feature extraction method to be used; 2) although many classical machine learning methods have been used for epileptic EEG recognition, most of them are “black box” approaches and more interpretable methods are desirable. To address these two challenges, a new epileptic EEG recognition method based on a multiview learning framework and fuzzy system modeling is proposed. First, multiview EEG data are generated by employing different feature extraction methods to obtain the features from different views of the signals. Second, the classical Takagi-Sugeno-Kang fuzzy system (TSK-FS) is introduced as an easy-to-interpret recognition model to develop a multiview TSK-FS method, called MV-TSK-FS, to identify epileptic EEG signals. For the proposed MV-TSK-FS, the importance of each view, i.e., the importance of each feature extraction method, can be evaluated according to the weighting of each view, and consequently the final decision can be made based on the weighted outputs of different views. Experimental results indicate that the MV-TSK-FS is a promising method when compared with the state-of-the-art algorithms.

The existing, semisupervised, spectral clustering approaches have two major drawbacks, i.e., either they cannot cope with multiple categories of supervision or they sometimes exhibit unstable effectiveness. To address these issues, two normalized affinity and penalty jointly constrained spectral clustering frameworks as well as their corresponding algorithms, referred to as type-I affinity and penalty jointly constrained spectral clustering (TI-APJCSC) and type-II affinity and penalty jointly constrained spectral clustering (TII-APJCSC), respectively, are proposed in this paper. TI refers to type-I and TII to type-II. The significance of this paper is fourfold. First, benefiting from the distinctive affinity and penalty jointly constrained strategies, both TI-APJCSC and TII-APJCSC are substantially more effective than the existing methods. Second, both TI-APJCSC and TII-APJCSC are fully compatible with the three well-known categories of supervision, i.e., class labels, pairwise constraints, and grouping information. Third, owing to the delicate framework normalization, both TI-APJCSC and TII-APJCSC are quite flexible. With a simple tradeoff factor varying in the small fixed interval (0, 1], they can self-adapt to any semisupervised scenario. Finally, both TI-APJCSC and TII-APJCSC demonstrate strong robustness, not only to the number of pairwise constraints but also to the parameter for affinity measurement. As such, the novel TI-APJCSC and TII-APJCSC algorithms are very practical for medium- and small-scale semisupervised data sets. The experimental studies thoroughly evaluated and demonstrated these advantages on both synthetic and real-life semisupervised data sets.

The classical maximum entropy clustering (MEC) algorithm usually cannot achieve satisfactory results in the situations where the data is insufficient, incomplete, or distorted. To address this problem, inspired by transfer learning, the specific cluster prototypes and fuzzy memberships jointly leveraged (CPM-JL) framework for cross-domain MEC (CDMEC) is firstly devised in this paper, and then the corresponding algorithm referred to as CPM-JL-CDMEC and the dedicated validity index named fuzzy memberships-based cross-domain difference measurement (FM-CDDM) are concurrently proposed. In general, the contributions of this paper are fourfold: 1) benefiting from the delicate CPM-JL framework, CPM-JL-CDMEC features high-clustering effectiveness and robustness even in some complex data situations; 2) the reliability of FM-CDDM has been demonstrated to be close to well-established external criteria, e.g., normalized mutual information and rand index, and it does not require additional label information. Hence, using FM-CDDM as a dedicated validity index significantly enhances the applicability of CPM-JL-CDMEC under realistic scenarios; 3) the performance of CPM-JL-CDMEC is generally better than, at least equal to, that of MEC because CPM-JL-CDMEC can degenerate into the standard MEC algorithm after adopting the proper parameters, and which avoids the issue of negative transfer; and 4) in order to maximize privacy protection, CPM-JL-CDMEC employs the known cluster prototypes and their associated fuzzy memberships rather than the raw data in the source domain as prior knowledge. The experimental studies thoroughly evaluated and demonstrated these advantages on both synthetic and real-life transfer datasets.

Clustering with multiview data is becoming a hot topic in data mining, pattern recognition, and machine learning. In order to realize an effective multiview clustering, two issues must be addressed, namely, how to combine the clustering result from each view and how to identify the importance of each view. In this paper, based on a newly proposed objective function which explicitly incorporates two penalty terms, a basic multiview fuzzy clustering algorithm, called collaborative fuzzy c-means (Co-FCM), is firstly proposed. It is then extended into its weighted view version, called weighted view collaborative fuzzy c-means (WV-Co-FCM), by identifying the importance of each view. The WV-Co-FCM algorithm indeed tackles the above two issues simultaneously. Its relationship with the latest multiview fuzzy clustering algorithm Collaborative Fuzzy K-Means (Co-FKM) is also revealed. Extensive experimental results on various multiview datasets indicate that the proposed WV-Co-FCM algorithm outperforms or is at least comparable to the existing state-of-the-art multitask and multiview clustering algorithms and the importance of different views of the datasets can be effectively identified.

Soft subspace fuzzy clustering algorithms have been successfully utilized for high dimensional data in recent studies. However, the existing works often utilize only one distance function to evaluate the similarity between data items along with each feature, which leads to performance degradation for some complex data sets. In this work, a novel soft subspace fuzzy clustering algorithm MKEWFC-K is proposed by extending the existing entropy weight soft subspace clustering algorithm with a multiple-kernel learning setting. By incorporating multiple-kernel learning strategy into the framework of soft subspace fuzzy clustering, MKEWFC-K can learning the distance function adaptively during the clustering process. Moreover, it is more immune to ineffective kernels and irrelevant features in soft subspace, which makes the choice of kernels less crucial. Experiments on real-world data demonstrate the effectiveness of the proposed MKEWFC-K algorithm.

Although graph-based relaxed clustering (GRC) is one of the spectral clustering algorithms with straightforwardness and self-adaptability, it is sensitive to the parameters of the adopted similarity measure and also has high time complexity O(N(3)) which severely weakens its usefulness for large data sets. In order to overcome these shortcomings, after introducing certain constraints for GRC, an enhanced version of GRC [constrained GRC (CGRC)] is proposed to increase the robustness of GRC to the parameters of the adopted similarity measure, and accordingly, a novel algorithm called fast GRC (FGRC) based on CGRC is developed in this paper by using the core-set-based minimal enclosing ball approximation. A distinctive advantage of FGRC is that its asymptotic time complexity is linear with the data set size N. At the same time, FGRC also inherits the straightforwardness and self-adaptability from GRC, making the proposed FGRC a fast and effective clustering algorithm for large data sets. The advantages of FGRC are validated by various benchmarking and real data sets.