Meijia Wang

Meijia Wang

Auto-generated profile, based on publicly available information

Meijia Wang

Arizona State University, Tempe, AZ

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 September 2023 in Journal of Computational and Graphical Statistics
Verified
Journal Article
Closed access
MWMeijia Wang
Meijia Wang
JHJingyu He
Jingyu He
PHP. Richard Hahn
P. Richard Hahn

24 January 2020 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
MWMeijia Wang
Meijia Wang
JKJian Kang
Jian Kang
NCNan Cao
Nan Cao
YXYinglong Xia
Yinglong Xia
WFWei Fan
Wei Fan
HTHanghang Tong
Hanghang Tong
Ranking on graphs is a centerpiece in many high-impact application domains, such as information retrieval, recommender systems, team management, neuroscience and many more. PageRank, along with many of its variants, is widely used across these application domains thanks to its mathematical elegance and the superior performance. Although PageRank and its variants are effective in ranking nodes on graphs, they often lack an efficient and effective way to audit the ranking results in terms of the input graph structure, e.g., which node or edge in the graph contributes most to the top-1 ranked node; which subgraph plays a crucial role in generating the overall ranking result? In this paper, we propose to audit graph ranking by finding the influential graph elements (e.g., edges, nodes, attributes, and subgraphs) regarding their impact on the ranking results. First, we formulate graph ranking auditing problem as quantifying the influence of graph elements on the ranking results. Second, we show that our formulation can be applied to a variety of graph structures. Third, we propose effective and efficient algorithms to find the top- $k$ influential edges/nodes/subgraph. Finally, we perform extensive empirical evaluations on real-world datasets to demonstrate that the proposed methods ( Aurora ) provide intuitive auditing results with linear scalability.