Previous multi-view clustering algorithms mostly partition the multi-view data in their original feature space, the efficacy of which heavily and implicitly relies on the quality of the original feature presentation. In light of this, this paper proposes a novel approach termed Multi-view Clustering in Latent Embedding Space (MCLES), which is able to cluster the multi-view data in a learned latent embedding space while simultaneously learning the global structure and the cluster indicator matrix in a unified optimization framework. Specifically, in our framework, a latent embedding representation is firstly discovered which can effectively exploit the complementary information from different views. The global structure learning is then performed based on the learned latent embedding representation. Further, the cluster indicator matrix can be acquired directly with the learned global structure. An alternating optimization scheme is introduced to solve the optimization problem. Extensive experiments conducted on several real-world multi-view datasets have demonstrated the superiority of our approach.

/pdf/multi-view-clustering-in-latent-embedding-space-3x63mioa70.pdf

Multi-View Clustering in Latent Embedding Space

Random walks are widely adopted in various network analysis tasks ranging from network embedding to label propagation. It could capture and convert geometric structures into structured sequences while alleviating the issues of sparsity and curse of dimensionality. Though random walks on plain networks have been intensively studied, in real-world systems, nodes are often not pure vertices, but own different characteristics, described by the rich set of data associated with them. These node attributes contain plentiful information that often complements the network, and bring opportunities to the random-walk-based analysis. However, it is unclear how random walks could be developed for attributed networks towards an effective joint information extraction. Node attributes make the node interactions more complicated and are heterogeneous with respect to topological structures. To bridge the gap, we explore to perform joint random walks on attributed networks, and utilize them to boost the deep node representation learning. The proposed framework GraphRNA consists of two major components, i.e., a collaborative walking mechanism - AttriWalk, and a tailored deep embedding architecture for random walks, named graph recurrent networks (GRN). AttriWalk considers node attributes as a bipartite network and uses it to propel the walking more diverse and mitigate the tendency of converging to nodes with high centralities. AttriWalk enables us to advance the prominent deep network embedding model, graph convolutional networks, towards a more effective architecture - GRN. GRN empowers node representations to interact in the same way as nodes interact in the original attributed network. Experimental results on real-world datasets demonstrate the effectiveness of GraphRNA compared with the state-of-the-art embedding algorithms.

https://dl.acm.org/doi/pdf/10.1145/3292500.3330941

Graph Recurrent Networks With Attributed Random Walks

Multi-view intact space clustering

Network community detection is a hot research topic in network analysis. Although many methods have been proposed for community detection, most of them only take into consideration the lower-order structure of the network at the level of individual nodes and edges. Thus, they fail to capture the higher-order characteristics at the level of small dense subgraph patterns, e.g., motifs. Recently, some higher-order methods have been developed but they typically focus on the motif-based hypergraph which is assumed to be a connected graph. However, such assumption cannot be ensured in some real-world networks. In particular, the hypergraph may become fragmented. That is, it may consist of a large number of connected components and isolated nodes, despite the fact that the original network is a connected graph. Therefore, the existing higher-order methods would suffer seriously from the above fragmentation issue, since in these approaches, nodes without connection in hypergraph can't be grouped together even if they belong to the same community. To address the above fragmentation issue, we propose an Edge enhancement approach for Motif-aware community detection (EdMot ). The main idea is as follows. Firstly, a motif-based hypergraph is constructed and the top K largest connected components in the hypergraph are partitioned into modules. Afterwards, the connectivity structure within each module is strengthened by constructing an edge set to derive a clique from each module. Based on the new edge set, the original connectivity structure of the input network is enhanced to generate a rewired network, whereby the motif-based higher-order structure is leveraged and the hypergraph fragmentation issue is well addressed. Finally, the rewired network is partitioned to obtain the higher-order community structure. Extensive experiments have been conducted on eight real-world datasets and the results show the effectiveness of the proposed method in improving the community detection performance of state-of-the-art methods.

EdMot: An Edge Enhancement Approach for Motif-aware Community Detection

A new algorithm for positive influence maximization in signed networks

Discriminative metric learning for multi-view graph partitioning

Recently, network embedding has received a large amount of attention in network analysis. Although some network embedding methods have been developed from different perspectives, on one hand, most of the existing methods only focus on leveraging the plain network structure, ignoring the abundant attribute information of nodes. On the other hand, for some methods integrating the attribute information, only the lower-order proximities (e.g. microscopic proximity structure) are taken into account, which may suffer if there exists the sparsity issue and the attribute information is noisy. To overcome this problem, the attribute information and mesoscopic community structure are utilized. In this paper, we propose a novel network embedding method termed Attributed Network Embedding with Micro-Meso structure (ANEM), which is capable of preserving both the attribute information and the structural information including the microscopic proximity structure and mesoscopic community structure. In particular, both the microscopic proximity structure and node attributes are factorized by Nonnegative Matrix Factorization (NMF), from which the low-dimensional node representations can be obtained. For the mesoscopic community structure, a community membership strength matrix is inferred by a generative model from the linkage structure, which is then factorized by NMF to obtain the low-dimensional node representations. The three components are jointly correlated by the low-dimensional node representations, from which an objective function can be defined. An efficient alternating optimization scheme is proposed to solve the optimization problem. Extensive experiments have been conducted to confirm the superior performance of the proposed model over the state-of-the-art network embedding methods.

Attributed Network Embedding with Micro-meso Structure

In recent years, network embedding has attracted more and more attention due to its effectiveness and convenience to compress the network structured data. In this paper, we propose a community-based variational autoencoder (ComVAE) model to learn network embedding, which consists of a community detection module and a deep learning module. In the proposed model, both community information and deep learning techniques are utilized to learn low-dimensional vertex representations. First, community information reveals an implicit relationship between vertices from a global view, which can be a supplement to local information and help to improve the embedding quality. To obtain the community information, community detection algorithms are utilized as a module and the modularization design makes the model more flexible. Second, deep learning techniques can not only integrate and preserve the information from both local and global views efficiently but also strengthen the robustness of vertex representations. To demonstrate the performance of our model, extensive experiments are conducted in four downstream tasks, namely, network reconstruction, node classification, link prediction, and visualization. The experimental results show that our model outperforms the state-of-the-art approaches to real-world datasets.

/pdf/network-embedding-via-community-based-variational-19wi8oszwh.pdf

Network Embedding via Community Based Variational Autoencoder

Tinnitus is a kind of auditory disease characterized by an ongoing conscious perception of a sound in the absence of any external sound source. It is a common symptom for which no effective treatment exists. Though many non-invasive functional imaging modalities have been rapidly developed and applied to this field, yet, whether the EEG signal can be utilized to distinguish tinnitus patients from normal populations has not been investigated. In the present study, we perform a binary classification based on EEG signal to distinguish tinnitus patients from normal populations. In this study, 22 subjects are involved in the experiment with 15 of them being tinnitus patients and the others being normal controls. The collected EEG signals are preprocessed in frequency domain and well represented as features that depict each subject. Then the linear support vector machine is applied to classify the subjects. Satisfactory results have been achieved, where the accuracy of the classification could reach 90.91% in spite of the undeniable fact that the collected EEG signals contain noises. Accordingly, the present study reveals that the EEG signals can be utilized to distinguish tinnitus patients from normal populations, which could be regarded as an auxiliary therapy in tinnitus.

A SVM-Based EEG Signal Analysis: An Auxiliary Therapy for Tinnitus

Recently, network embedding has received a large amount of attention in network analysis. Although some network embedding methods have been developed from different perspectives, on one hand, most of the existing methods only focus on leveraging the plain network structure, ignoring the abundant attribute information of nodes. On the other hand, for some methods integrating the attribute information, only the lower-order proximities (e.g., microscopic proximity structure) are taken into account, which may suffer if there exists the sparsity issue and the attribute information is noisy. To overcome this problem, the attribute information and mesoscopic community structure are utilized. In this article, we propose a novel network embedding method termed Attributed Network Embedding with Micro-Meso structure, which is capable of preserving both the attribute information and the structural information including the microscopic proximity structure and mesoscopic community structure. In particular, both the microscopic proximity structure and node attributes are factorized by Nonnegative Matrix Factorization (NMF), from which the low-dimensional node representations can be obtained. For the mesoscopic community structure, a community membership strength matrix is inferred by a generative model (i.e., BigCLAM) or modularity from the linkage structure, which is then factorized by NMF to obtain the low-dimensional node representations. The three components are jointly correlated by the low-dimensional node representations, from which two objective functions (i.e., ANEM_B and ANEM_M) can be defined. Two efficient alternating optimization schemes are proposed to solve the optimization problems. Extensive experiments have been conducted to confirm the superior performance of the proposed models over the state-of-the-art network embedding methods.

Juan-Hui Li

Papers

Discriminative metric learning for multi-view graph partitioning

Attributed Network Embedding with Micro-meso Structure

Network Embedding via Community Based Variational Autoencoder

A SVM-Based EEG Signal Analysis: An Auxiliary Therapy for Tinnitus

Attributed Network Embedding with Micro-Meso Structure