Applied Filters
- Yang Liu
- AuthorRemove filter
People
Colleagues
- Qing He (12)
- Xiang Ao (12)
- Yang Liu (12)
- Jinghua Feng (6)
- Hao Yang (4)
- Jianfeng Chi (4)
- Kuan Li (3)
- Fuli Feng (2)
- Jiayu Tang (2)
- Linfeng Dong (2)
- Qiwei Zhong (2)
- Zidi Qin (2)
- Binbin Hu (1)
- Chao Zhang (1)
- Fuzheng Zhen Zhuang (1)
- Jin Wang (1)
- Luo Zuo (1)
- Tat-Seng Chua (1)
- Weizhong Zhao (1)
- Yunshan Ma (1)
Publication
Proceedings/Book Names
- KDD '22: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2)
- CIKM '20: Proceedings of the 29th ACM International Conference on Information & Knowledge Management (1)
- CIKM '22: Proceedings of the 31st ACM International Conference on Information & Knowledge Management (1)
- Database Systems for Advanced Applications (1)
- Database Systems for Advanced Applications (1)
- KDD '23: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (1)
- WWW '20: Proceedings of The Web Conference 2020 (1)
- WWW '21: Proceedings of the Web Conference 2021 (1)
- WWW '22: Proceedings of the ACM Web Conference 2022 (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-articleOpen AccessPublished By ACMPublished By ACM
FLOOD: A Flexible Invariant Learning Framework for Out-of-Distribution Generalization on Graphs
- Yang Liu
Institute of Computing Technology, CAS, Beijing, China
, - Xiang Ao
Institute of Computing Technology, CAS, Beijing, China
, - Fuli Feng
Institute of Computing Technology, CAS, Hefei, China
, - Yunshan Ma
Institute of Computing Technology, CAS, Singapore, Singapore
, - Kuan Li
Institute of Computing Technology, CAS, Beijing, China
, - Tat-Seng Chua
Institute of Computing Technology, CAS, Singapore, Singapore
, - Qing He
Institute of Computing Technology, CAS, Beijing, China
KDD '23: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining•August 2023, pp 1548-1558• https://doi.org/10.1145/3580305.3599355Graph Neural Networks (GNNs) have achieved remarkable success in various domains but most of them are developed under the in-distribution assumption. Under out-of-distribution (OOD) settings, they suffer from the distribution shift between the training ...
- 4Citation
- 1,295
- Downloads
MetricsTotal Citations4Total Downloads1,295Last 12 Months1,201Last 6 weeks85- 2
- Yang Liu
- short-paperOpen AccessPublished By ACMPublished By ACM
Explainable Graph-based Fraud Detection via Neural Meta-graph Search
- Zidi Qin
Institute of Computing Technology, Chinese Academy of Sciences & University of Chinese Academy of Sciences, Beijing, China
, - Yang Liu
Institute of Computing Technology, Chinese Academy of Sciences & University of Chinese Academy of Sciences, Beijing, China
, - Qing He
Institute of Computing Technology, Chinese Academy of Sciences & University of Chinese Academy of Sciences, Beijing, China
, - Xiang Ao
Institute of Computing Technology, Chinese Academy of Sciences & University of Chinese Academy of Sciences, Beijing, China
CIKM '22: Proceedings of the 31st ACM International Conference on Information & Knowledge Management•October 2022, pp 4414-4418• https://doi.org/10.1145/3511808.3557598Though graph neural networks (GNNs)-based fraud detectors have received remarkable success in identifying fraudulent activities, few of them pay equal attention to models' performance and explainability. In this paper, we attempt to achieve high ...
- 8Citation
- 1,000
- Downloads
MetricsTotal Citations8Total Downloads1,000Last 12 Months519Last 6 weeks66
- Zidi Qin
- research-articleOpen AccessPublished By ACMPublished By ACM
Reliable Representations Make A Stronger Defender: Unsupervised Structure Refinement for Robust GNN
- Kuan Li
Institute of Computing Technology, Chinese Academy of Sciences & University of Chinese Academy of Sciences, Beijing, China
, - Yang Liu
Institute of Computing Technology, Chinese Academy of Sciences & University of Chinese Academy of Sciences, Beijing, China
, - Xiang Ao
Institute of Computing Technology, Chinese Academy of Sciences & University of Chinese Academy of Sciences, Beijing, China
, - Jianfeng Chi
Alibaba Group, Hangzhou, China
, - Jinghua Feng
Alibaba Group, Hangzhou, China
, - Hao Yang
Alibaba Group, Hangzhou, China
, - Qing He
Institute of Computing Technology, Chinese Academy of Sciences & University of Chinese Academy of Sciences, Beijing, China
KDD '22: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining•August 2022, pp 925-935• https://doi.org/10.1145/3534678.3539484Benefiting from the message passing mechanism, Graph Neural Networks (GNNs) have been successful on flourish tasks over graph data. However, recent studies have shown that attackers can catastrophically degrade the performance of GNNs by maliciously ...
- 20Citation
- 1,445
- Downloads
MetricsTotal Citations20Total Downloads1,445Last 12 Months616Last 6 weeks70- 1
Supplementary MaterialKDD22-rtfp1839.mp4
- Kuan Li
- research-articleOpen AccessPublished By ACMPublished By ACM
UD-GNN: Uncertainty-aware Debiased Training on Semi-Homophilous Graphs
- Yang Liu
Institute of Computing Technology, CAS & University of Chinese Academy of Sciences, Beijing, China
, - Xiang Ao
Institute of Computing Technology, CAS & University of Chinese Academy of Sciences, Beijing, China
, - Fuli Feng
University of Science and Technology of China, Hefei, China
, - Qing He
Institute of Computing Technology, CAS & University of Chinese Academy of Sciences, Beijing, China
KDD '22: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining•August 2022, pp 1131-1140• https://doi.org/10.1145/3534678.3539483Recent studies on Graph Neural Networks (GNNs) point out that most GNNs depend on the homophily assumption but fail to generalize to graphs with heterophily where dissimilar nodes connect. The concept of homophily or heterophily defined previously is a ...
- 9Citation
- 1,179
- Downloads
MetricsTotal Citations9Total Downloads1,179Last 12 Months419Last 6 weeks25- 1
Supplementary MaterialKDD22-rtfp1458.mp4
- Yang Liu
- research-articleOpen AccessPublished By ACMPublished By ACM
AUC-oriented Graph Neural Network for Fraud Detection
- Mengda Huang
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology, CAS, China and University of Chinese Academy of Sciences, China
, - Yang Liu
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology, CAS, China and University of Chinese Academy of Sciences, China
, - Xiang Ao
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology, CAS, China and University of Chinese Academy of Sciences, China
, - Kuan Li
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology, CAS, China and University of Chinese Academy of Sciences, China
, - Jianfeng Chi
Alibaba Group, China
, - Jinghua Feng
Alibaba Group, China
, - Hao Yang
Alibaba Group, China
, - Qing He
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology, CAS, China and University of Chinese Academy of Sciences, China
WWW '22: Proceedings of the ACM Web Conference 2022•April 2022, pp 1311-1321• https://doi.org/10.1145/3485447.3512178Though Graph Neural Networks (GNNs) have been successful for fraud detection tasks, they suffer from imbalanced labels due to limited fraud compared to the overall userbase. This paper attempts to resolve this label-imbalance problem for GNNs by ...
- 38Citation
- 2,143
- Downloads
MetricsTotal Citations38Total Downloads2,143Last 12 Months750Last 6 weeks95
- Mengda Huang
- Article
Bi-Level Selection via Meta Gradient for Graph-Based Fraud Detection
- Linfeng Dong
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology CAS, 100190, Beijing, China
University of Chinese Academy of Sciences, 100049, Beijing, China
, - Yang Liu
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology CAS, 100190, Beijing, China
University of Chinese Academy of Sciences, 100049, Beijing, China
, - Xiang Ao
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology CAS, 100190, Beijing, China
University of Chinese Academy of Sciences, 100049, Beijing, China
Institute of Intelligent Computing Technology, Suzhou, CAS, Suzhou, China
, - Jianfeng Chi
Alibaba Group, Hangzhou, China
, - Jinghua Feng
Alibaba Group, Hangzhou, China
, - Hao Yang
Alibaba Group, Hangzhou, China
, - Qing He
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology CAS, 100190, Beijing, China
University of Chinese Academy of Sciences, 100049, Beijing, China
Henan Institutes of Advanced Technology, Zhengzhou University, 450052, Zhengzhou, China
Database Systems for Advanced Applications•April 2022, pp 387-394• https://doi.org/10.1007/978-3-031-00123-9_31AbstractGraph Neural Networks (GNNs) have achieved remarkable successes by utilizing rich interactions in network data. When applied to fraud detection tasks, the scarcity and concealment of fraudsters bring two challenges: class imbalance and label ...
- 0Citation
MetricsTotal Citations0
- Linfeng Dong
- research-article
Spatiotemporal Activity Modeling via Hierarchical Cross-Modal Embedding
- Yang Liu
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology, CAS, Beijing, China
, - Xiang Ao
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology, CAS, Beijing, China
, - Linfeng Dong
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology, CAS, Beijing, China
, - Chao Zhang
College of Computing, Georgia Tech, Atlanta, GA, USA
, - Jin Wang
Department of Computer Science, University of California, Los Angeles, Los Angeles, CA, USA
, - Qing He
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology, CAS, Beijing, China
IEEE Transactions on Knowledge and Data Engineering, Volume 34, Issue 1•Jan. 2022, pp 462-474 • https://doi.org/10.1109/TKDE.2020.2983892With the ever-increasing urbanization process, modeling people's spatiotemporal activities from their online traces has become a crucial task. State-of-the-art methods for this task rely on cross-modal embedding, which maps items from different ...
- 5Citation
MetricsTotal Citations5
- Yang Liu
- research-articleOpen AccessPublished By ACMPublished By ACM
Pick and Choose: A GNN-based Imbalanced Learning Approach for Fraud Detection
- Yang Liu
Institute of Computing Technology, Chinese Academy of Sciences and University of Chinese Academy of Sciences, China
, - Xiang Ao
Institute of Computing Technology, Chinese Academy of Sciences and University of Chinese Academy of Sciences, China
, - Zidi Qin
Institute of Computing Technology, Chinese Academy of Sciences and University of Chinese Academy of Sciences, China
, - Jianfeng Chi
Alibaba Group, China
, - Jinghua Feng
Alibaba Group, China
, - Hao Yang
Alibaba Group, China
, - Qing He
Institute of Computing Technology, CAS and University of Chinese Academy of Sciences, China
WWW '21: Proceedings of the Web Conference 2021•April 2021, pp 3168-3177• https://doi.org/10.1145/3442381.3449989Graph-based fraud detection approaches have escalated lots of attention recently due to the abundant relational information of graph-structured data, which may be beneficial for the detection of fraudsters. However, the GNN-based algorithms could fare ...
- 120Citation
- 7,837
- Downloads
MetricsTotal Citations120Total Downloads7,837Last 12 Months2,957Last 6 weeks349
- Yang Liu
- short-paperPublished By ACMPublished By ACM
Alike and Unlike: Resolving Class Imbalance Problem in Financial Credit Risk Assessment
- Yang Liu
Institute of Computing Technology, Chinese Academy of Sciences & University of Chinese Academy of Sciences, Beijing, China
, - Xiang Ao
Institute of Computing Technology, Chinese Academy of Sciences & University of Chinese Academy of Sciences, Beijing, China
, - Qiwei Zhong
Alibaba Group, Hangzhou, China
, - Jinghua Feng
Alibaba Group, Hangzhou, China
, - Jiayu Tang
Alibaba Group, Hangzhou, China
, - Qing He
Institute of Computing Technology, Chinese Academy of Sciences & University of Chinese Academy of Sciences, Beijing, China
CIKM '20: Proceedings of the 29th ACM International Conference on Information & Knowledge Management•October 2020, pp 2125-2128• https://doi.org/10.1145/3340531.3412111Financial credit risk assessment serves as the impetus to evaluate the credit admission or potential business failure of customers in order to make early actions prior to the actual financial crisis. It aims to predict the probability that a customer ...
- 17Citation
- 336
- Downloads
MetricsTotal Citations17Total Downloads336Last 12 Months28Last 6 weeks3- 1
Supplementary Material3340531.3412111.mp4
- Yang Liu
- research-articlePublished By ACMPublished By ACM
Financial Defaulter Detection on Online Credit Payment via Multi-view Attributed Heterogeneous Information Network
- Qiwei Zhong
Alibaba Group Hangzhou China
, - Yang Liu
Institute of Computing Technology Chinese Academy of Sciences
, - Xiang Ao
Institute of Computing Technology Chinese Academy of Sciences
, - Binbin Hu
Ant Financial Services Group Hangzhou China
, - Jinghua Feng
Alibaba Group Hangzhou China
, - Jiayu Tang
Alibaba Group Hangzhou China
, - Qing He
Institute of Computing Technology Chinese Academy of Sciences
WWW '20: Proceedings of The Web Conference 2020•April 2020, pp 785-795• https://doi.org/10.1145/3366423.3380159Default user detection plays one of the backbones in credit risk forecasting and management. It aims at, given a set of corresponding features, e.g., patterns extracted from trading behaviors, predicting the polarity indicating whether a user will fail ...
- 64Citation
- 1,772
- Downloads
MetricsTotal Citations64Total Downloads1,772Last 12 Months153Last 6 weeks26
- Qiwei Zhong
- research-article
Grid-based DBSCAN: Indexing and inference
- Thapana Boonchoo
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology, CAS, Beijing 100190, China
University of Chinese Academy of Sciences, Beijing 100049, China
, - Xiang Ao
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology, CAS, Beijing 100190, China
University of Chinese Academy of Sciences, Beijing 100049, China
, - Yang Liu
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology, CAS, Beijing 100190, China
University of Chinese Academy of Sciences, Beijing 100049, China
, - Weizhong Zhao
School of Computer, Central China Normal University, Wuhan, China and Hubei Key Laboratory of Artificial Intelligence and Smart Learning, Central China Normal University, Wuhan, China
, - Fuzhen Zhuang
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology, CAS, Beijing 100190, China
University of Chinese Academy of Sciences, Beijing 100049, China
, - Qing He
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology, CAS, Beijing 100190, China
University of Chinese Academy of Sciences, Beijing 100049, China
Pattern Recognition, Volume 90, Issue C•Jun 2019, pp 271-284 • https://doi.org/10.1016/j.patcog.2019.01.034Highlights- The proposed method extends grid-based DBSCAN scalable to higher-dimensional dataset.
AbstractDBSCAN is one of clustering algorithms which can report arbitrarily-shaped clusters and noises without requiring the number of clusters as a parameter (unlike the other clustering algorithms, k-means, for example). Because the running ...
- 9Citation
MetricsTotal Citations9
- Thapana Boonchoo
- Article
Free-Rider Episode Screening via Dual Partition Model
- Xiang Ao
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology, CAS, 100190, Beijing, China
University of Chinese Academy of Sciences, 100049, Beijing, China
, - Yang Liu
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology, CAS, 100190, Beijing, China
University of Chinese Academy of Sciences, 100049, Beijing, China
, - Zhen Huang
Tsinghua University, Beijing, China
, - Luo Zuo
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology, CAS, 100190, Beijing, China
University of Chinese Academy of Sciences, 100049, Beijing, China
, - Qing He
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences (CAS), Institute of Computing Technology, CAS, 100190, Beijing, China
University of Chinese Academy of Sciences, 100049, Beijing, China
Database Systems for Advanced Applications•May 2018, pp 665-683• https://doi.org/10.1007/978-3-319-91452-7_43AbstractOne of the drawbacks of frequent episode mining is that overwhelmingly many of the discovered patterns are redundant. Free-rider episode, as a typical example, consists of a real pattern doped with some additional noise events. Because of the ...
- 0Citation
MetricsTotal Citations0
- Xiang Ao
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