Advanced technical applications like routing systems or electrical network management systems introduce the need for complex manipulations of large size graphs. Efficiently supporting this requirement is now regarded as a key feature of future database systems. This paper proposes an abstraction mechanism, called Database Graph View, to define and manipulate various kinds of graphs stored in ei...

Let $G=(V,E)$ be a simple graph. A set $Ssubseteq V$ isindependent set of $G$,  if no two vertices of $S$ are adjacent.The  independence number $alpha(G)$ is the size of a maximumindependent set in the graph. In this paper we study and characterize the independent sets ofthe zero-divisor graph $Gamma(R)$ and ideal-based zero-divisor graph $Gamma_I(R)$of a commutative ring $R$.

As one of the most important research topics in unsupervised learning field, Multi-View Clustering (MVC) has been widely studied past decade and numerous MVC methods have developed. Among these methods, recently emerged Graph Neural Networks (GNN) shine a light on modeling both topological structure node attributes form graphs, to guide unified embedding clustering. However, effectiveness exist...

This study investigates the problem of multi-view subspace clustering, goal which is to explore underlying grouping structure data collected from different fields or measurements. Since do not always comply with linear models in many real-world applications, most existing clustering methods based on shallow may fail practice. Furthermore, graph information usually ignored methods. To address af...

Spectral-based graph neural networks (SGNNs) have been attracting increasing attention in representation learning. However, existing SGNNs are limited implementing filters with rigid transforms and cannot adapt to signals residing on graphs tasks at hand. In this paper, we propose a novel class of that realizes adaptive wavelets. Specifically, the wavelets learned network-parameterized lifting ...