◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Zhewei Wei

38 papers hereh-index 328.9k citations83 works total

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

author position
  • first author4
  • middle author23
  • last author11

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

fields
  • cs.LG16
  • cs.DS11
  • cs.DB4
  • cs.SI2
  • q-bio.BM2
  • cs.AI1
same name
  • Zhewei Wei — 11 papers, h 5
  • Zhewei Wei — 9 papers, h 5
  • Zhewei Wei — 7 papers, h 5
  • Zhewei Wei — 6 papers, h 3
  • Zhewei Wei — 5 papers, h 4
  • Zhewei Wei — 4 papers, h 3

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
20082023
most citedA Survey on Large Language Model based Autonomous Agents

1.6k citations · 2.5k across the 36 of their papers we have counts for

collaborators
Showing 2019Show all

4 papers · 1 filter

cs.SI2019★ 2 cited

Efficient Algorithms for Approximate Single-Source Personalized PageRank Queries

Sibo Wang, Renchi Yang, Runhui Wang +5

Given a graph G, a source node s and a target node t, the personalized PageRank (PPR) of t with respect to s is the probability that a random walk starting from s termi…

cs.LG2019

Scalable Graph Embeddings via Sparse Transpose Proximities

Yuan Yin, Zhewei Wei

Graph embedding learns low-dimensional representations for nodes in a graph and effectively preserves the graph structure. Recently, a significant amount of progress has been made…

cs.DS2019★ 45 cited

PRSim: Sublinear Time SimRank Computation on Large Power-Law Graphs

Zhewei Wei, Xiaodong He, Xiaokui Xiao +4

{\it SimRank} is a classic measure of the similarities of nodes in a graph. Given a node u in graph G=(V,E), a {\em single-source SimRank query} returns the SimRank similarit…

cs.SI2019★ 33 cited

Efficient Estimation of Heat Kernel PageRank for Local Clustering

Renchi Yang, Xiaokui Xiao, Zhewei Wei +3

Given an undirected graph G and a seed node s, the local clustering problem aims to identify a high-quality cluster containing s in time roughly proportional to the size of the clu…

◍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.