Sorry, you need to enable JavaScript to visit this website.

Diffusion kernel algorithms are interesting tools for distributed nonlinear estimation. However, for the sake of feasibility, it is essential in practice to restrict their computational cost and the number of communications. In this paper, we propose a censoring algorithm for adaptive kernel diffusion networks based on random Fourier features that locally adapts the number of nodes censored according to the estimation error.

In this paper, we revisit the popular affinity matrix based on the anchor graph and point out that the spectral embedding obtained using symmetric normalized Laplacian is only a side view of the bipartite structure. Based on the analysis, we propose Fast Spectral Clustering based on the Random Walk Laplacian (FRWL) method to explicitly balance the popularity of anchors and the independence of data points, which is especially important for clustering of boundary points.

Learning representations of nodes in a low dimensional space is a crucial task with many interesting applications in network analysis, including link prediction and node classification. Two popular approaches for this problem include matrix factorization and random walk-based models. In this paper, we aim to bring together the best of both worlds, towards learning latent node representations. In particular, we propose a weighted matrix factorization model which encodes random walk-based information about the nodes of the graph.

Electroencephalography (EEG) has been widely used in human brain research. Several techniques in EEG relies on analyzing the topographical distribution of the data. One of the most common analysis is EEG microstate (EEG-ms). EEG-ms reflects the stable topographical representation of EEG signal lasting a few dozen milliseconds. EEG-ms were associated with resting state fMRI networks and were associated with mental processes and abnormalities.

We develop a new method called Discriminated Hub Graphical Lasso (DHGL) based on Hub Graphical Lasso (HGL) by providing the prior information of hubs. We apply this new method in two situations: with known hubs and without known hubs. Then we compare DHGL with HGL using several measures of performance. When some hubs are known, we can always estimate the precision matrix better via DHGL than HGL.

This paper proposes a novel graph signal-based deep learning method for electroencephalography (EEG) and its application to EEG-based video identification. We present new methods to effectively represent EEG data as signals on graphs, and learn them using graph convolutional neural networks. Experimental results for video identification using EEG responses obtained while watching videos show the effectiveness of the proposed approach in comparison to existing methods. Effective schemes for graph signal representation of EEG are also discussed.