MWMeijia Wang
Meijia Wang
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Meijia Wang has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Hanghang Tong
University of Illinois Urbana-Champaign, Urbana, IL, USA
1 shared publication - Jian Kang
MBZUAI, Abu Dhabi, United Arab Emirates
1 shared publication - Jingyu He
City University of Hong Kong (CITYU)
1 shared publication - Nan Cao
College of Design and Innovation, Tongji University, Shanghai, China
1 shared publication P. Richard Hahn
Arizona State University, Tempe, AZ
1 shared publication- Wei Fan
IBM T.J. Watson Research
1 shared publication
Latest Publications
- 21 September 2023
- Published by Taylor & Francis in Journal of Computational and Graphical Statistics
- Vol. 33 (2) , 724-735
Local Gaussian Process Extrapolation for BART Models with Applications to Causal Inference
- 21 September 2023
- Published by Taylor & Francis in Journal of Computational and Graphical Statistics
- Vol. 33 (2) , 724-735
Local Gaussian Process Extrapolation for BART Models with Applications to Causal Inference
- 24 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 33 (10) , 3366-3380
Graph Ranking Auditing: Problem Definition and Fast Solutions
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.- 24 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 33 (10) , 3366-3380
Graph Ranking Auditing: Problem Definition and Fast Solutions
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.