Xiaorui Liu
Applied Filters
- Xiaorui Liu
- AuthorRemove filter
People
Colleagues
- Xiaorui Liu (21)
- Jiliang Tang (17)
- Wei Jin (7)
- Yao Ma (7)
- Haoyu Han (5)
- Wenqi Fan (5)
- Charu C. Aggarwal (4)
- Han Xu (3)
- Mohamad Ali Torkamani (3)
- Tyler Scott Derr (3)
- Yiqi Wang (3)
- Anil Kumar Jain (2)
- Neil Shah (2)
- Qing Li (2)
- Rui Xue (2)
- Tong Zhao (2)
- Wentao Wang (2)
- Yaxing Li (2)
- Zitao Liu (2)
- Graham Cormode (1)
Publication
Proceedings/Book Names
- CIKM '21: Proceedings of the 30th ACM International Conference on Information & Knowledge Management (3)
- KDD '23: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (3)
- ICML'23: Proceedings of the 40th International Conference on Machine Learning (2)
- KDD '21: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining (2)
- Efficient and Secure Message Passing for Machine Learning (1)
- KDD '20: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (1)
- KDD '22: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (1)
- NIPS '21: Proceedings of the 35th International Conference on Neural Information Processing Systems (1)
- NIPS '23: Proceedings of the 37th International Conference on Neural Information Processing Systems (1)
- SIGIR '22: Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval (1)
- WSDM '20: Proceedings of the 13th International Conference on Web Search and Data Mining (1)
- WWW '22: Companion Proceedings of the Web Conference 2022 (1)
- WWW '24: Proceedings of the ACM Web Conference 2024 (1)
Publication Date
Export Citations
Publications
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-article
Graph neural networks with adaptive residual
- Xiaorui Liu
Michigan State University, East Lansing, MI
, - Jiayuan Ding
Michigan State University, East Lansing, MI
, - Wei Jin
Michigan State University, East Lansing, MI
, - Han Xu
Michigan State University, East Lansing, MI
, - Yao Ma
New Jersey Institute of Technology, Newark, NJ
, - Zitao Liu
TAL Education Group, Beijing, China
, - Jiliang Tang
Michigan State University, East Lansing, MI
NIPS '21: Proceedings of the 35th International Conference on Neural Information Processing Systems•December 2021, Article No.: 744, pp 9720-9733Graph neural networks (GNNs) have shown the power in graph representation learning for numerous tasks. In this work, we discover an interesting phenomenon that although residual connections in the message passing of GNNs help improve the performance, ...
- 0Citation
MetricsTotal Citations0- 1
Supplementary Material3540261.3541005_supp.pdf
- Xiaorui Liu
- research-article
Towards label position bias in graph neural networks
- Haoyu Han
Michigan State University
, - Xiaorui Liu
North Carolina State University
, - Feng Shi
TigerGraph
, - Mohamad Ali Torkamani
Amazon
, - Charu C. Aggarwal
IBM T.J. Watson Research Center
, - Jiliang Tang
Michigan State University
NIPS '23: Proceedings of the 37th International Conference on Neural Information Processing Systems•December 2023, Article No.: 997, pp 22999-23018Graph Neural Networks (GNNs) have emerged as a powerful tool for semi- supervised node classification tasks. However, recent studies have revealed various biases in GNNs stemming from both node features and graph topology. In this work, we uncover a new ...
- 0Citation
MetricsTotal Citations0
- Haoyu Han
- research-articleOpen AccessPublished By ACMPublished By ACM
Linear-Time Graph Neural Networks for Scalable Recommendations
- Jiahao Zhang
The Hong Kong Polytechnic University, Kowloon, Hong Kong
, - Rui Xue
North Carolina State University, Raleigh, USA
, - Wenqi Fan
The Hong Kong Polytechnic University, Kowloon, Hong Kong
, - Xin Xu
The Hong Kong Polytechnic University, Kowloon, Hong Kong
, - Qing Li
The Hong Kong Polytechnic University, Kowloon, Hong Kong
, - Jian Pei
Duke University, Durham, USA
, - Xiaorui Liu
North Carolina State University, Raleigh, USA
WWW '24: Proceedings of the ACM Web Conference 2024•May 2024, pp 3533-3544• https://doi.org/10.1145/3589334.3645486In an era of information explosion, recommender systems are vital tools to deliver personalized recommendations for users. The key of recommender systems is to forecast users' future behaviors based on previous user-item interactions. Due to their strong ...
- 1Citation
- 484
- Downloads
MetricsTotal Citations1Total Downloads484Last 12 Months484Last 6 weeks192- 1
Supplementary Materialrfp1047.mp4
- Jiahao Zhang
- abstractfreePublished By ACMPublished By ACM
Large-Scale Graph Neural Networks: The Past and New Frontiers
- Rui Xue
North Carolina State University, Raleigh, NC, USA
, - Haoyu Han
Michigan State University, East Lansing, MI, USA
, - Tong Zhao
Snap Inc., Seattle, WA, USA
, - Neil Shah
Snap Inc., Seattle, WA, USA
, - Jiliang Tang
Michigan State University, East Lansing, MI, USA
, - Xiaorui Liu
North Carolina State University, Raleigh, NC, USA
KDD '23: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining•August 2023, pp 5835-5836• https://doi.org/10.1145/3580305.3599565Graph Neural Networks (GNNs) have gained significant attention in recent years due to their ability to model complex relationships between entities in graph-structured data such as social networks, protein structures, and knowledge graphs. However, due ...
- 0Citation
- 705
- Downloads
MetricsTotal Citations0Total Downloads705Last 12 Months471Last 6 weeks24
- Rui Xue
- research-articlefreePublished By ACMPublished By ACM
How does the Memorization of Neural Networks Impact Adversarial Robust Models?
- Han Xu
Michigan State University, East Lansing, MI, USA
, - Xiaorui Liu
North Carilina State University, Raleigh, NC, USA
, - Wentao Wang
Michigan State University, East Lansing, MI, USA
, - Zitao Liu
Jinan University, Guangzhou, Guangdong, China
, - Anil K Jain
Michigan State University, East Lansing, MI, USA
, - Jiliang Tang
Michigan State University, East Lansing, MI, USA
KDD '23: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining•August 2023, pp 2801-2812• https://doi.org/10.1145/3580305.3599381Recent studies suggest that "memorization" is one necessary factor for overparameterized deep neural networks (DNNs) to achieve optimal performance. Specifically, the perfectly fitted DNNs can memorize the labels of many atypical samples, generalize ...
- 0Citation
- 409
- Downloads
MetricsTotal Citations0Total Downloads409Last 12 Months279Last 6 weeks18- 1
Supplementary Materialvideo5325257242.mp4
- Han Xu
- research-articlefreePublished By ACMPublished By ACM
Enhancing Graph Representations Learning with Decorrelated Propagation
- Hua Liu
Shandong University, Jinan, China
, - Haoyu Han
Michigan State University, East Lansing, MI, USA
, - Wei Jin
Michigan State University, East Lansing, MI, USA
, - Xiaorui Liu
North Carolina State University, Raleigh, NC, USA
, - Hui Liu
Michigan State University, East Lansing, MI, USA
KDD '23: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining•August 2023, pp 1466-1476• https://doi.org/10.1145/3580305.3599334In recent years, graph neural networks (GNNs) have been widely used in many domains due to their powerful capability in representation learning on graph-structured data. While a majority of extant studies focus on mitigating the over-smoothing problem, ...
- 1Citation
- 804
- Downloads
MetricsTotal Citations1Total Downloads804Last 12 Months673Last 6 weeks41- 1
Supplementary Material<10.1145:3580305.3599334#>-2min-promo.mp4
- Hua Liu
- research-article
LazyGNN: large-scale graph neural networks via lazy propagation
- Rui Xue
North Carolina State University, Raleigh
, - Haoyu Han
Michigan State University, East Lansing
, - MohamadAli Torkamani
Amazon
, - Jian Pei
Duke University, Durham
, - Xiaorui Liu
North Carolina State University, Raleigh
ICML'23: Proceedings of the 40th International Conference on Machine Learning•July 2023, Article No.: 1622, pp 38926-38937Recent works have demonstrated the benefits of capturing long-distance dependency in graphs by deeper graph neural networks (GNNs). But deeper GNNs suffer from the long-lasting scalability challenge due to the neighborhood explosion problem in large-...
- 0Citation
MetricsTotal Citations0
- Rui Xue
- research-article
Alternately optimized graph neural networks
- Haoyu Han
Department of Computer Science and Engineering, Michigan State University, East Lansing,
, - Xiaorui Liu
Department of Computer Science, North Carolina State University, Raleigh
, - Haitao Mao
Department of Computer Science and Engineering, Michigan State University, East Lansing,
, - MohamadAli Torkamani
Amazon
, - Feng Shi
TigerGraph
, - Victor Lee
TigerGraph
, - Jiliang Tang
Department of Computer Science and Engineering, Michigan State University, East Lansing,
ICML'23: Proceedings of the 40th International Conference on Machine Learning•July 2023, Article No.: 502, pp 12411-12429Graph Neural Networks (GNNs) have greatly advanced the semi-supervised node classification task on graphs. The majority of existing GNNs are trained in an end-to-end manner that can be viewed as tackling a bi-level optimization problem. This process is ...
- 0Citation
MetricsTotal Citations0
- Haoyu Han
- surveyPublished By ACMPublished By ACM
Trustworthy AI: A Computational Perspective
- Haochen Liu
Michigan State University, East Lansing, MI, USA
, - Yiqi Wang
Michigan State University, East Lansing, MI, USA
, - Wenqi Fan
The Hong Kong Polytechnic University, Hong Kong
, - Xiaorui Liu
Michigan State University, East Lansing, MI, USA
, - Yaxin Li
Michigan State University, East Lansing, MI, USA
, - Shaili Jain
Twitter, San Francisco, CA, USA
, - Yunhao Liu
Tsinghua University, Beijing, China
, - Anil Jain
Michigan State University, East Lansing, MI, USA
, - Jiliang Tang
Michigan State University, East Lansing, MI, USA
ACM Transactions on Intelligent Systems and Technology, Volume 14, Issue 1•February 2023, Article No.: 4, pp 1-59 • https://doi.org/10.1145/3546872In the past few decades, artificial intelligence (AI) technology has experienced swift developments, changing everyone’s daily life and profoundly altering the course of human society. The intention behind developing AI was and is to benefit humans by ...
- 56Citation
- 5,042
- Downloads
MetricsTotal Citations56Total Downloads5,042Last 12 Months2,786Last 6 weeks264
- Haochen Liu
- tutorialPublished By ACMPublished By ACM
Accepted Tutorials at The Web Conference 2022
- Riccardo Tommasini
INSA de Lyon - CRNS LIRIS, France
, - Senjuti Basu Roy
New Jersey Institute of Technology, USA
, - Xuan Wang
University of Illinois at Urbana-Champaign, USA
, - Hongwei Wang
University of Illinois at Urbana-Champaign, USA
, - Heng Ji
University of Illinois at Urbana-Champaign, USA
, - Jiawei Han
University of Illinois at Urbana-Champaign, USA
, - Preslav Nakov
Qatar Computing Research Institute, HBKU, Qatar
, - Giovanni Da San Martino
University of Padova, Italy
, - Firoj Alam
Qatar Computing Research Institute, Qatar
, - Markus Schedl
Johannes Kepler University, Austria
, - Elisabeth Lex
Graz University of Technology, Austria
, - Akash Bharadwaj
Meta AI, USA
, - Graham Cormode
Meta AI, USA
, - Milan Dojchinovski
DBpedia Association & Czech Technical University in Prague, Czech Rep
, - Jan Forberg
DBpedia Association, Germany
, - Johannes Frey
DBpedia Association, Germany
, - Pieter Bonte
Ghent University, Belgium
, - Marco Balduini
Quantia Consulting, Italy
, - Matteo Belcao
Quantia Consulting, Italy
, - Emanuele Della Valle
Politecnico di Milano, Italy
, - Junliang Yu
The University of Queensland, Australia
, - Hongzhi Yin
The University of Queensland, Australia
, - Tong Chen
The University of Queensland, Australia
, - Haochen Liu
Michigan State University, USA
, - Yiqi Wang
Michigan State University, USA
, - Wenqi Fan
The Hong Kong Polytechnic University, Hong Kong
, - Xiaorui Liu
Michigan State University, USA
, - Jamell Dacon
Michigan State University, USA
, - Lingjuan Lye
Sony AI, Japan
, - Jiliang Tang
Michigan State University, USA
, - Aristides Gionis
KTH Royal Institute of Technology, Sweden
, - Stefan Neumann
KTH Royal Institute of Technology, Sweden
, - Bruno Ordozgoiti
Queen Mary University of London, United Kingdom
, - Simon Razniewski
Max Planck Insitute of Informatics, Germany
, - Hiba Arnaout
Max Planck Insitute of Informatics, Germany
, - Shrestha Ghosh
Max Planck Insitute of Informatics, Germany
, - Fabian Suchanek
Institut Polytechnique de Paris, France
, - Lingfei Wu
JD.COM Silicon Valley Research Center, USA
, - Yu Chen
Meta AI, USA
, - Yunyao Li
IBM Research AI, USA
, - Bang Liu
University of Montreal, Canada
, - Filip Ilievski
University of Southern California, USA
, - Daniel Garijo
Universidad Politécnica de Madrid, Spain
, - Hans Chalupsky
University of Southern California, USA
, - Pedro Szekely
University of Southern California, USA
, - Ilias Kanellos
Athena Research Center, Greece
, - Dimitris Sacharidis
Université Libre de Bruxelles, Belgium
, - Thanasis Vergoulis
Athena Research Center, Greece
, - Nurendra Choudhary
Virginia Tech, USA
, - Nikhil Rao
Amazon, USA
, - Karthik Subbian
Amazon, USA
, - Srinivasan Sengamedu
Amazon, USA
, - Chandan K. Reddy
Virginia Tech, USA
, - Friedhelm Victor
Technical University of Berlin, Germany
, - Bernhard Haslhofer
AIT - Austrian Institute of Technology, Austria
, - George Katsogiannis- Meimarakis
Athena Research Center, Greece
, - Georgia Koutrika
Athena Research Center, Greece
, - Shengmin Jin
Syracuse University, USA
, - Danai Koutra
University of Michigan, USA
, - Reza Zafarani
Syracuse University, USA
, - Yulia Tsvetkov
University of Washington, USA
, - Vidhisha Balachandran
Carnegie Mellon University, USA
, - Sachin Kumar
Carnegie Mellon University, USA
, - Xiangyu Zhao
City University of Hong Kong, Hong Kong
, - Bo Chen
Huawei Noah's Ark Lab Hong Kong, Hong Kong
, - Huifeng Guo
Huawei Noah's Ark Lab, Hong Kong
, - Yejing Wang
University of Science and Technology of China, China
, - Ruiming Tang
Huawei Noah's Ark Lab, Hong Kong
, - Yang Zhang
University of Science and Technology of China, China
, - Wenjie Wang
National University of Singapore, Singapore
, - Peng Wu
Peking University, China
, - Fuli Feng
University of Science and Technology of China, China
, - Xiangnan He
University of Science and Technology of China, China
WWW '22: Companion Proceedings of the Web Conference 2022•April 2022, pp 391-399• https://doi.org/10.1145/3487553.3547182This paper summarizes the content of the 20 tutorials that have been given at The Web Conference 2022: 85% of these tutorials are lecture style, and 15% of these are hands on.
- 0Citation
- 202
- Downloads
MetricsTotal Citations0Total Downloads202Last 12 Months58Last 6 weeks1
- Riccardo Tommasini
- research-articlePublic AccessPublished By ACMPublished By ACM
Feature Overcorrelation in Deep Graph Neural Networks: A New Perspective
- Wei Jin
Michigan State University, East Lansing, MI, USA
, - Xiaorui Liu
Michigan State University, East Lansing, MI, USA
, - Yao Ma
New Jersey Institute of Technology, Newark, NJ, USA
, - Charu Aggarwal
IBM T.J. Watson Research Center, New York, NY, USA
, - Jiliang Tang
Michigan State University, East Lansing, MI, USA
KDD '22: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining•August 2022, pp 709-719• https://doi.org/10.1145/3534678.3539445Recent years have witnessed remarkable success achieved by graph neural networks (GNNs) in many real-world applications such as recommendation and drug discovery. Despite the success, oversmoothing has been identified as one of the key issues which limit ...
- 15Citation
- 691
- Downloads
MetricsTotal Citations15Total Downloads691Last 12 Months221Last 6 weeks26
- Wei Jin
- research-articlePublished By ACMPublished By ACM
Graph Trend Filtering Networks for Recommendation
- Wenqi Fan
The Hong Kong Polytechnic University, Hong Kong, UNK, Hong Kong
, - Xiaorui Liu
Michigan State University, East Lansing, MI, USA
, - Wei Jin
Michigan State University, East Lansing, MI, USA
, - Xiangyu Zhao
City University of Hong Kong, Hong Kong, UNK, Hong Kong
, - Jiliang Tang
Michigan State University, East Lansing, MI, USA
, - Qing Li
The Hong Kong Polytechnic University, Hong Kong, UNK, China
SIGIR '22: Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval•July 2022, pp 112-121• https://doi.org/10.1145/3477495.3531985Recommender systems aim to provide personalized services to users and are playing an increasingly important role in our daily lives. The key of recommender systems is to predict how likely users will interact with items based on their historical online ...
- 49Citation
- 1,136
- Downloads
MetricsTotal Citations49Total Downloads1,136Last 12 Months333Last 6 weeks38
- Wenqi Fan
- Doctoral Theses
Efficient and Secure Message Passing for Machine Learning
- Xiaorui Liu
Michigan State University
, - Tang, Jiliang
Michigan State University
, - Yan, Ming
Michigan State University
, - Jain, Anil K.
Michigan State University
, - Aggarwal, Charu
Michigan State University
AbstractMachine learning (ML) techniques have brought revolutionary impact to human society, and they will continue to act as technological innovators in the future. To broaden its impact, it is urgent to solve the emerging and critical challenges in ...
- 0Citation
MetricsTotal Citations0
- Xiaorui Liu
- research-articlePublic AccessPublished By ACMPublished By ACM
Graph Feature Gating Networks
- Wei Jin
Michigan State University, East Lansing, MI, USA
, - Xiaorui Liu
Michigan State University, East Lansing, MI, USA
, - Yao Ma
New Jersey Institute of Technology, Newark, NJ, USA
, - Tyler Derr
Vanderbilt University, Nashville, TN, USA
, - Charu Aggarwal
IBM T. J. Watson Research Center, New York, NY, USA
, - Jiliang Tang
Michigan State University, East Lansing, MI, USA
CIKM '21: Proceedings of the 30th ACM International Conference on Information & Knowledge Management•October 2021, pp 813-822• https://doi.org/10.1145/3459637.3482434Graph neural networks (GNNs) have received tremendous attention due to their power in learning effective representations for graphs. Most GNNs follow a message-passing scheme where the node representations are updated by aggregating and transforming the ...
- 1Citation
- 228
- Downloads
MetricsTotal Citations1Total Downloads228Last 12 Months114Last 6 weeks16
- Wei Jin
- research-articlePublic AccessPublished By ACMPublished By ACM
Deep Adversarial Network Alignment
- Tyler Derr
Vanderbilt University, Nashville, TN, USA
, - Hamid Karimi
Utah State University, Logan, UT, USA
, - Xiaorui Liu
Michigan State University, East Lansing, MI, USA
, - Jiejun Xu
HRL Laboratories, Malibu, CA, USA
, - Jiliang Tang
Michigan State University, East Lansing, MI, USA
CIKM '21: Proceedings of the 30th ACM International Conference on Information & Knowledge Management•October 2021, pp 352-361• https://doi.org/10.1145/3459637.3482418Network alignment, in general, seeks to discover the hidden underlying correspondence between nodes across two (or more) networks when given their network structure. However, most existing network alignment methods have added assumptions of additional ...
- 12Citation
- 581
- Downloads
MetricsTotal Citations12Total Downloads581Last 12 Months195Last 6 weeks26
- Tyler Derr
- research-articlePublic AccessPublished By ACMPublished By ACM
A Unified View on Graph Neural Networks as Graph Signal Denoising
- Yao Ma
New Jersey Institute of Technology, Newark, NJ, USA
, - Xiaorui Liu
Michigan State University, East Lansing, MI, USA
, - Tong Zhao
University of Notre Dame, Notre Dame, OH, USA
, - Yozen Liu
Snap Inc., Santa Monica, CA, USA
, - Jiliang Tang
Michigan State University, East Lansing, MI, USA
, - Neil Shah
Snap Inc., Seattle, WA, USA
CIKM '21: Proceedings of the 30th ACM International Conference on Information & Knowledge Management•October 2021, pp 1202-1211• https://doi.org/10.1145/3459637.3482225Graph Neural Networks (GNNs) have risen to prominence in learning representations for graph structured data. A single GNN layer typically consists of a feature transformation and a feature aggregation operation. The former normally uses feed-forward ...
- 48Citation
- 1,876
- Downloads
MetricsTotal Citations48Total Downloads1,876Last 12 Months815Last 6 weeks69
- Yao Ma
- abstractPublic AccessPublished By ACMPublished By ACM
Graph Representation Learning: Foundations, Methods, Applications and Systems
- Wei Jin
Michigan State University, East Lansing, MI, USA
, - Yao Ma
Michigan State University, East Lansing, MI, USA
, - Yiqi Wang
Michigan State University, East Lansing, MI, USA
, - Xiaorui Liu
Michigan State University, East Lansing, MI, USA
, - Jiliang Tang
Michigan State University, East Lansing, MI, USA
, - Yukuo Cen
Tsinghua University, Beijing, China
, - Jiezhong Qiu
Tsinghua University, Beijing, China
, - Jie Tang
Tsinghua University, Beijing, China
, - Chuan Shi
Beijing University of Posts and Telecommunications, Beijing, China
, - Yanfang Ye
Case Western Reserve University, Cleveland, OH, USA
, - Jiawei Zhang
Florida State University, Tallahassee, FL, USA
, - Philip S. Yu
University of Illinois at Chicago, Chicago, IL, USA
KDD '21: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining•August 2021, pp 4044-4045• https://doi.org/10.1145/3447548.3470824Graphs such as social networks and molecular graphs are ubiquitous data structures in the real world. Due to their prevalence, it is of great research importance to extract meaningful patterns from graph structured data so that downstream tasks can be ...
- 1Citation
- 956
- Downloads
MetricsTotal Citations1Total Downloads956Last 12 Months215Last 6 weeks45
- Wei Jin
- abstractPublished By ACMPublished By ACM
Adversarial Robustness in Deep Learning: From Practices to Theories
- Han Xu
Michigan State University, East Lansing, MI, USA
, - Yaxin Li
Michigan State University, East Lansing, MI, USA
, - Xiaorui Liu
Michigan State University, East Lansing, MI, USA
, - Wentao Wang
Michigan State University, East Lansing, MI, USA
, - Jiliang Tang
Michigan State University, East Lansing, MI, USA
KDD '21: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining•August 2021, pp 4086-4087• https://doi.org/10.1145/3447548.3470812Deep neural networks (DNNs) have achieved unprecedented accomplishments in various machine learning tasks. However, recent studies demonstrate that DNNs are extremely vulnerable to adversarial examples. They are manually synthesized input samples which ...
- 0Citation
- 265
- Downloads
MetricsTotal Citations0Total Downloads265Last 12 Months24Last 6 weeks2
- Han Xu
- research-articlePublic AccessPublished By ACMPublished By ACM
Graph Structure Learning for Robust Graph Neural Networks
- Wei Jin
Michigan State University, East Lansing, MI, USA
, - Yao Ma
Michigan State University, East Lansing, MI, USA
, - Xiaorui Liu
Michigan State University, East Lansing, MI, USA
, - Xianfeng Tang
The Pennsylvania State University, State College, PA, USA
, - Suhang Wang
The Pennsylvania State University, State College, PA, USA
, - Jiliang Tang
Michigan State University, East Lansing, MI, USA
KDD '20: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining•August 2020, pp 66-74• https://doi.org/10.1145/3394486.3403049Graph Neural Networks (GNNs) are powerful tools in representation learning for graphs. However, recent studies show that GNNs are vulnerable to carefully-crafted perturbations, called adversarial attacks. Adversarial attacks can easily fool GNNs in ...
- 286Citation
- 9,272
- Downloads
MetricsTotal Citations286Total Downloads9,272Last 12 Months2,949Last 6 weeks297- 1
Supplementary Material3394486.3403049.mp4
- Wei Jin
- research-articlePublic AccessPublished By ACMPublished By ACM
Epidemic Graph Convolutional Network
- Tyler Derr
Michigan State University, East Lansing, MI, USA
, - Yao Ma
Michigan State University, East Lansing, MI, USA
, - Wenqi Fan
City University of Hong Kong, Hong Kong, Hong Kong
, - Xiaorui Liu
Michigan State University, East Lansing, MI, USA
, - Charu Aggarwal
IBM T. J. Watson Research Center, Yorktown Heights, NY, USA
, - Jiliang Tang
Michigan State University, East Lansing, MI, USA
WSDM '20: Proceedings of the 13th International Conference on Web Search and Data Mining•January 2020, pp 160-168• https://doi.org/10.1145/3336191.3371807A growing trend recently is to harness the structure of today's big data, where much of the data can be represented as graphs. Simultaneously, graph convolutional networks (GCNs) have been proposed and since seen rapid development. More recently, due to ...
- 18Citation
- 1,241
- Downloads
MetricsTotal Citations18Total Downloads1,241Last 12 Months156Last 6 weeks29
- Tyler Derr
Author Profile Pages
- Description: The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM bibliographic database, the Guide. Coverage of ACM publications is comprehensive from the 1950's. Coverage of other publishers generally starts in the mid 1980's. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community.
Please see the following 2007 Turing Award winners' profiles as examples: - History: Disambiguation of author names is of course required for precise identification of all the works, and only those works, by a unique individual. Of equal importance to ACM, author name normalization is also one critical prerequisite to building accurate citation and download statistics. For the past several years, ACM has worked to normalize author names, expand reference capture, and gather detailed usage statistics, all intended to provide the community with a robust set of publication metrics. The Author Profile Pages reveal the first result of these efforts.
- Normalization: ACM uses normalization algorithms to weigh several types of evidence for merging and splitting names.
These include:- co-authors: if we have two names and cannot disambiguate them based on name alone, then we see if they have a co-author in common. If so, this weighs towards the two names being the same person.
- affiliations: names in common with same affiliation weighs toward the two names being the same person.
- publication title: names in common whose works are published in same journal weighs toward the two names being the same person.
- keywords: names in common whose works address the same subject matter as determined from title and keywords, weigh toward being the same person.
The more conservative the merging algorithms, the more bits of evidence are required before a merge is made, resulting in greater precision but lower recall of works for a given Author Profile. Many bibliographic records have only author initials. Many names lack affiliations. With very common family names, typical in Asia, more liberal algorithms result in mistaken merges.
Automatic normalization of author names is not exact. Hence it is clear that manual intervention based on human knowledge is required to perfect algorithmic results. ACM is meeting this challenge, continuing to work to improve the automated merges by tweaking the weighting of the evidence in light of experience.
- Bibliometrics: In 1926, Alfred Lotka formulated his power law (known as Lotka's Law) describing the frequency of publication by authors in a given field. According to this bibliometric law of scientific productivity, only a very small percentage (~6%) of authors in a field will produce more than 10 articles while the majority (perhaps 60%) will have but a single article published. With ACM's first cut at author name normalization in place, the distribution of our authors with 1, 2, 3..n publications does not match Lotka's Law precisely, but neither is the distribution curve far off. For a definition of ACM's first set of publication statistics, see Bibliometrics
- Future Direction:
The initial release of the Author Edit Screen is open to anyone in the community with an ACM account, but it is limited to personal information. An author's photograph, a Home Page URL, and an email may be added, deleted or edited. Changes are reviewed before they are made available on the live site.
ACM will expand this edit facility to accommodate more types of data and facilitate ease of community participation with appropriate safeguards. In particular, authors or members of the community will be able to indicate works in their profile that do not belong there and merge others that do belong but are currently missing.
A direct search interface for Author Profiles will be built.
An institutional view of works emerging from their faculty and researchers will be provided along with a relevant set of metrics.
It is possible, too, that the Author Profile page may evolve to allow interested authors to upload unpublished professional materials to an area available for search and free educational use, but distinct from the ACM Digital Library proper. It is hard to predict what shape such an area for user-generated content may take, but it carries interesting potential for input from the community.
Bibliometrics
The ACM DL is a comprehensive repository of publications from the entire field of computing.
It is ACM's intention to make the derivation of any publication statistics it generates clear to the user.
- Average citations per article = The total Citation Count divided by the total Publication Count.
- Citation Count = cumulative total number of times all authored works by this author were cited by other works within ACM's bibliographic database. Almost all reference lists in articles published by ACM have been captured. References lists from other publishers are less well-represented in the database. Unresolved references are not included in the Citation Count. The Citation Count is citations TO any type of work, but the references counted are only FROM journal and proceedings articles. Reference lists from books, dissertations, and technical reports have not generally been captured in the database. (Citation Counts for individual works are displayed with the individual record listed on the Author Page.)
- Publication Count = all works of any genre within the universe of ACM's bibliographic database of computing literature of which this person was an author. Works where the person has role as editor, advisor, chair, etc. are listed on the page but are not part of the Publication Count.
- Publication Years = the span from the earliest year of publication on a work by this author to the most recent year of publication of a work by this author captured within the ACM bibliographic database of computing literature (The ACM Guide to Computing Literature, also known as "the Guide".
- Available for download = the total number of works by this author whose full texts may be downloaded from an ACM full-text article server. Downloads from external full-text sources linked to from within the ACM bibliographic space are not counted as 'available for download'.
- Average downloads per article = The total number of cumulative downloads divided by the number of articles (including multimedia objects) available for download from ACM's servers.
- Downloads (cumulative) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server since the downloads were first counted in May 2003. The counts displayed are updated monthly and are therefore 0-31 days behind the current date. Robotic activity is scrubbed from the download statistics.
- Downloads (12 months) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 12-month period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (12-month download counts for individual works are displayed with the individual record.)
- Downloads (6 weeks) = The cumulative number of times all works by this author have been downloaded from an ACM full-text article server over the last 6-week period for which statistics are available. The counts displayed are usually 1-2 weeks behind the current date. (6-week download counts for individual works are displayed with the individual record.)
ACM Author-Izer Service
Summary Description
ACM Author-Izer is a unique service that enables ACM authors to generate and post links on both their homepage and institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge.
Downloads from these sites are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to definitive version of ACM articles should reduce user confusion over article versioning.
ACM Author-Izer also extends ACM’s reputation as an innovative “Green Path” publisher, making ACM one of the first publishers of scholarly works to offer this model to its authors.
To access ACM Author-Izer, authors need to establish a free ACM web account. Should authors change institutions or sites, they can utilize the new ACM service to disable old links and re-authorize new links for free downloads from a different site.
How ACM Author-Izer Works
Authors may post ACM Author-Izer links in their own bibliographies maintained on their website and their own institution’s repository. The links take visitors to your page directly to the definitive version of individual articles inside the ACM Digital Library to download these articles for free.
The Service can be applied to all the articles you have ever published with ACM.
Depending on your previous activities within the ACM DL, you may need to take up to three steps to use ACM Author-Izer.
For authors who do not have a free ACM Web Account:
- Go to the ACM DL http://dl.acm.org/ and click SIGN UP. Once your account is established, proceed to next step.
For authors who have an ACM web account, but have not edited their ACM Author Profile page:
- Sign in to your ACM web account and go to your Author Profile page. Click "Add personal information" and add photograph, homepage address, etc. Click ADD AUTHOR INFORMATION to submit change. Once you receive email notification that your changes were accepted, you may utilize ACM Author-izer.
For authors who have an account and have already edited their Profile Page:
- Sign in to your ACM web account, go to your Author Profile page in the Digital Library, look for the ACM Author-izer link below each ACM published article, and begin the authorization process. If you have published many ACM articles, you may find a batch Authorization process useful. It is labeled: "Export as: ACM Author-Izer Service"
ACM Author-Izer also provides code snippets for authors to display download and citation statistics for each “authorized” article on their personal pages. Downloads from these pages are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking to the definitive version of ACM articles should reduce user confusion over article versioning.
Note: You still retain the right to post your author-prepared preprint versions on your home pages and in your institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library. But any download of your preprint versions will not be counted in ACM usage statistics. If you use these AUTHOR-IZER links instead, usage by visitors to your page will be recorded in the ACM Digital Library and displayed on your page.
FAQ
- Q. What is ACM Author-Izer?
A. ACM Author-Izer is a unique, link-based, self-archiving service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles for free.
- Q. What articles are eligible for ACM Author-Izer?
- A. ACM Author-Izer can be applied to all the articles authors have ever published with ACM. It is also available to authors who will have articles published in ACM publications in the future.
- Q. Are there any restrictions on authors to use this service?
- A. No. An author does not need to subscribe to the ACM Digital Library nor even be a member of ACM.
- Q. What are the requirements to use this service?
- A. To access ACM Author-Izer, authors need to have a free ACM web account, must have an ACM Author Profile page in the Digital Library, and must take ownership of their Author Profile page.
- Q. What is an ACM Author Profile Page?
- A. The Author Profile Page initially collects all the professional information known about authors from the publications record as known by the ACM Digital Library. The Author Profile Page supplies a quick snapshot of an author's contribution to the field and some rudimentary measures of influence upon it. Over time, the contents of the Author Profile page may expand at the direction of the community. Please visit the ACM Author Profile documentation page for more background information on these pages.
- Q. How do I find my Author Profile page and take ownership?
- A. You will need to take the following steps:
- Create a free ACM Web Account
- Sign-In to the ACM Digital Library
- Find your Author Profile Page by searching the ACM Digital Library for your name
- Find the result you authored (where your author name is a clickable link)
- Click on your name to go to the Author Profile Page
- Click the "Add Personal Information" link on the Author Profile Page
- Wait for ACM review and approval; generally less than 24 hours
- Q. Why does my photo not appear?
- A. Make sure that the image you submit is in .jpg or .gif format and that the file name does not contain special characters
- Q. What if I cannot find the Add Personal Information function on my author page?
- A. The ACM account linked to your profile page is different than the one you are logged into. Please logout and login to the account associated with your Author Profile Page.
- Q. What happens if an author changes the location of his bibliography or moves to a new institution?
- A. Should authors change institutions or sites, they can utilize ACM Author-Izer to disable old links and re-authorize new links for free downloads from a new location.
- Q. What happens if an author provides a URL that redirects to the author’s personal bibliography page?
- A. The service will not provide a free download from the ACM Digital Library. Instead the person who uses that link will simply go to the Citation Page for that article in the ACM Digital Library where the article may be accessed under the usual subscription rules.
However, if the author provides the target page URL, any link that redirects to that target page will enable a free download from the Service.
- Q. What happens if the author’s bibliography lives on a page with several aliases?
- A. Only one alias will work, whichever one is registered as the page containing the author’s bibliography. ACM has no technical solution to this problem at this time.
- Q. Why should authors use ACM Author-Izer?
- A. ACM Author-Izer lets visitors to authors’ personal home pages download articles for no charge from the ACM Digital Library. It allows authors to dynamically display real-time download and citation statistics for each “authorized” article on their personal site.
- Q. Does ACM Author-Izer provide benefits for authors?
- A. Downloads of definitive articles via Author-Izer links on the authors’ personal web page are captured in official ACM statistics to more accurately reflect usage and impact measurements.
Authors who do not use ACM Author-Izer links will not have downloads from their local, personal bibliographies counted. They do, however, retain the existing right to post author-prepared preprint versions on their home pages or institutional repositories with DOI pointers to the definitive version permanently maintained in the ACM Digital Library.
- Q. How does ACM Author-Izer benefit the computing community?
- A. ACM Author-Izer expands the visibility and dissemination of the definitive version of ACM articles. It is based on ACM’s strong belief that the computing community should have the widest possible access to the definitive versions of scholarly literature. By linking authors’ personal bibliography with the ACM Digital Library, user confusion over article versioning should be reduced over time.
In making ACM Author-Izer a free service to both authors and visitors to their websites, ACM is emphasizing its continuing commitment to the interests of its authors and to the computing community in ways that are consistent with its existing subscription-based access model.
- Q. Why can’t I find my most recent publication in my ACM Author Profile Page?
- A. There is a time delay between publication and the process which associates that publication with an Author Profile Page. Right now, that process usually takes 4-8 weeks.
- Q. How does ACM Author-Izer expand ACM’s “Green Path” Access Policies?
- A. ACM Author-Izer extends the rights and permissions that authors retain even after copyright transfer to ACM, which has been among the “greenest” publishers. ACM enables its author community to retain a wide range of rights related to copyright and reuse of materials. They include:
- Posting rights that ensure free access to their work outside the ACM Digital Library and print publications
- Rights to reuse any portion of their work in new works that they may create
- Copyright to artistic images in ACM’s graphics-oriented publications that authors may want to exploit in commercial contexts
- All patent rights, which remain with the original owner