Zobrazeno 1 - 10
of 850
pro vyhledávání: '"Yang, Renchi"'
Subspace clustering seeks to identify subspaces that segment a set of n data points into k (k<
Externí odkaz:
http://arxiv.org/abs/2411.11074
Publikováno v:
The VLDB Journal (2024) 1-31
Attributed networks containing entity-specific information in node attributes are ubiquitous in modeling social networks, e-commerce, bioinformatics, etc. Their inherent network topology ranges from simple graphs to hypergraphs with high-order intera
Externí odkaz:
http://arxiv.org/abs/2408.05459
Graph representation learning (GRL) is to encode graph elements into informative vector representations, which can be used in downstream tasks for analyzing graph-structured data and has seen extensive applications in various domains. However, the ma
Externí odkaz:
http://arxiv.org/abs/2406.13369
In recent years, graph neural networks (GNNs) have emerged as a potent tool for learning on graph-structured data and won fruitful successes in varied fields. The majority of GNNs follow the message-passing paradigm, where representations of each nod
Externí odkaz:
http://arxiv.org/abs/2406.05482
Attributed bipartite graphs (ABGs) are an expressive data model for describing the interactions between two sets of heterogeneous nodes that are associated with rich attributes, such as customer-product purchase networks and author-paper authorship g
Externí odkaz:
http://arxiv.org/abs/2405.11922
Heterogeneous graphs are ubiquitous to model complex data. There are urgent needs on powerful heterogeneous graph neural networks to effectively support important applications. We identify a potential semantic mixing issue in existing message passing
Externí odkaz:
http://arxiv.org/abs/2405.01927
Autor:
Yang, Renchi
Given a network G, edge centrality is a metric used to evaluate the importance of edges in G, which is a key concept in analyzing networks and finds vast applications involving edge ranking. In spite of a wealth of research on devising edge centralit
Externí odkaz:
http://arxiv.org/abs/2402.12623
Autor:
Yang, Renchi, Shi, Jieming
A bipartite graph contains inter-set edges between two disjoint vertex sets, and is widely used to model real-world data, such as user-item purchase records, author-article publications, and biological interactions between drugs and proteins. k-Bipar
Externí odkaz:
http://arxiv.org/abs/2312.16926
Autor:
Yang, Renchi, Tang, Jing
Given an undirected graph G, the effective resistance r(s,t) measures the dissimilarity of node pair s,t in G, which finds numerous applications in real-world problems, such as recommender systems, combinatorial optimization, molecular chemistry, and
Externí odkaz:
http://arxiv.org/abs/2312.06123
Autor:
Yang, Renchi
Similarity search over a bipartite graph aims to retrieve from the graph the nodes that are similar to each other, which finds applications in various fields such as online advertising, recommender systems etc. Existing similarity measures either (i)
Externí odkaz:
http://arxiv.org/abs/2312.06724