◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Ying Zhang

21 papers hereh-index 477.3k citations188 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author14
  • last author7

Across the 21 of 21 papers where every author was matched, so the position is known.

fields
  • cs.DB9
  • cs.SI4
  • cs.LG3
  • cs.DC2
  • cs.CV1
  • cs.DS1
same name
  • Ying Zhang — 58 papers, h 19
  • Ying Zhang — 20 papers, h 11
  • Ying Zhang — 14 papers, h 11
  • Ying Zhang — 12 papers, h 21
  • Ying Zhang — 12 papers, h 2
  • Ying Zhang — 10 papers, h 8

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20152026
most citedGoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions

97 citations · 217 across the 21 of their papers we have counts for

collaborators
Showing cs.SIShow all

4 papers · 1 filter

cs.SI2021★ 1 cited

Towards User Engagement Dynamics in Social Networks

Qingyuan Linghu, Fan Zhang, Xuemin Lin +2

The engagement of each user in a social network is an essential indicator for maintaining a sustainable service. Existing studies use the coreness of a user to well estimate its…

cs.SI2020★ 1 cited

Exploring Cohesive Subgraphs with Vertex Engagement and Tie Strength in Bipartite Graphs

Yizhang He, Kai Wang, Wenjie Zhang +2

We propose a novel cohesive subgraph model called τ-strengthened (α,β)-core (denoted as (α,β)τ​-core), which is the first to consider both tie strength and vertex engagement…

cs.SI2018

Efficient Butterfly Counting for Large Bipartite Networks

Kai Wang, Xuemin Lin, Lu Qin +2

Bipartite networks are of great importance in many real-world applications. In bipartite networks, butterfly (i.e., a complete 2 x 2 biclique) is the smallest non-trivial cohesive…

cs.SI2016★ 11 cited

When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks

Fan Zhang, Ying Zhang, Lu Qin +2

In this paper, we investigate the problem of (k,r)-core which intends to find cohesive subgraphs on social networks considering both user engagement and similarity perspectives. In…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.