This paper focuses on the design of event-triggered controllers for the synchronization of delayed Takagi–Sugeno (T–S) fuzzy neural networks (NNs) under deception attacks. The traditional event-triggered mechanism (ETM) determines the next trigger based on the current sample, resulting in network congestion. Furthermore, such methods suffer from the issues of deception attacks and unmeasurable system states. To enhance the system stability, we adaptively detect the occurrence of events over a period of time. In addition, deception attacks are recharacterized to describe general scenarios. Specifically, the following enhancements are implemented: First, we use a Bernoulli process to model the occurrence of deception attacks, which can describe a variety of attack scenarios as a type of general Markov process. Second, we introduce a sum-based dynamic discrete event-triggered mechanism (SDDETM), which uses a combination of past sampled measurements and internal dynamic variables to determine subsequent triggering events. Finally, we incorporate a dynamic output feedback controller (DOFC) to ensure the system stability. The concurrent design of the DOFC and SDDETM parameters is achieved through the application of the cone complement linearization (CCL) algorithm. We further perform two simulation examples to validate the effectiveness of the algorithm.

Most existing approaches of attributed network embedding often combine topology and attribute information based on the homophily assumption. In many real-world networks, such an assumption does not hold since the nodes are usually associated with many noisy or irrelevant attributes. To tackle this issue, we propose a noise-resistant graph embedding method, called NGE, by leveraging the subspace clustering information (i.e., the formation of communities is driven by different latent features in distinct subspaces). Specifically, we first construct a tensor to represent a given attributed network and then map it into different feature subspaces to capture community structure via tensor decomposition. For structure embedding, the link-level and community-level constraints are imposed. For attribute embedding, the feature-selection constraint is used to reinforce the relationship between topology and noise-removal attributes. By learning structure and attribute embedding with subspace clustering information, NGE can benefit both community detection, link prediction, and node classification. Extensive experimental results have demonstrated the superiority of NGE over many state-of-the-art approaches.

This article proposes a novel discrete event-triggered scheme (DETS) for the synchronization of delayed neural networks (NNs) using the dynamic output-feedback controller (DOFC). The proposed DETS uses both the current and past samples to determine the next trigger, unlike the traditional event-triggered scheme (ETS) that uses only the current sample. The proposed DETS is employed in a dual setup for two network channels to significantly reduce redundant data transmission. A DOFC is designed to achieve the synchronization of the NNs. Stability criteria of the synchronisation error system are derived based on the Lyapunov-Krasovskii functional method, and the co-design of the DOFC and DETS parameters are accomplished using the Cone-complementarity linearization (CCL) approach. The effectiveness and advantages of the proposed method are illustrated considering an example of the chaotic system.

Graph neural networks (GNNs) have achieved great success for semi-supervised node classification by embedding node representation into a low-dimensional space. However, existing approaches usually ignore one intrinsic property of graphs: community structure, where the formation of distinct communities in graphs is often driven by different subset of attributes. In this paper, we introduce a new method, called Community Attention Network (CAT), aiming to extract community-specific features and then enhance node embeddings for classification. To learn such community-specific information, we design a new loss function to ensure the nodes in the same community should share similar attributes (i.e., low covariance), and any unlabelled node should belong to only one class with high probability (i.e., low community distribution entropy) in a community attention network. Extensive experimental results demonstrate the effectiveness of CAT and its advantages over many state-of-the-art approaches. To further illustrate the benefits of CAT to capture the community information, a case study is given and discussed.

Community detection and link prediction are highly dependent since knowing cluster structure as a priori will help identify missing links, and in return, clustering on networks with supplemented missing links will improve community detection performance. In this paper, we propose a Cluster-driven Low-rank Matrix Completion (CLMC), for performing community detection and link prediction simultaneously in a unified framework. To this end, CLMC decomposes the adjacent matrix of a target network as three additive matrices: clustering matrix, noise matrix and supplement matrix. The community-structure and low-rank constraints are imposed on the clustering matrix, such that the noisy edges between communities are removed and the resulting matrix is an ideal block-diagonal matrix. Missing edges are further learned via low-rank matrix completion. Extensive experiments show that CLMC achieves state-of-the-art performance.

In this paper, we introduce a novel method to discover common and distinct structural connectivity patterns between SZP and MDD via a Cluster-Driven Nonnegative Matrix Factorization (called CD-NMF). Specifically, CD-NMF is applied to decompose the joint structural connectivity map into common and distinct parts, and each part is further factorized into two sub-matrices (i.e. common/distinct basis matrix and common/distinct encoding matrix) correspondingly. By imposing the clustering constraints on common and distinct encoding matrices, the discriminative patterns as well as the common patterns between the two disorders are extracted simultaneously. Experimental results demonstrate that CD-NMF allows finding the common and distinct structural patterns effectively. More importantly, the derived distinct patterns, show powerful ability to discriminate the patients of schizophrenia and major depressive disorder.