Jingchao Ni
Applied Filters
- Jingchao Ni
- AuthorRemove filter
People
Colleagues
- Jingchao Ni (18)
- Haifeng Chen (14)
- Wei Cheng (9)
- Zhengzhang Chen (7)
- Xiang Zhang (6)
- Bo Zong (5)
- Dongjin Song (5)
- Wenchao Yu (4)
- Dongsheng Luo (3)
- Yuncong Chen (3)
- Cheng Zheng (2)
- Dongkuan Xu (2)
- Hanghang Tong (2)
- Jiaping Gui (2)
- Wei Fan (2)
- Wei Wang (2)
- Xiang Zhang (2)
- Xuchao Zhang (2)
- Yanchi Liu (2)
- Yuchen Bian (2)
Publication
Proceedings/Book Names
- CIKM '21: Proceedings of the 30th ACM International Conference on Information & Knowledge Management (2)
- AAAI'19/IAAI'19/EAAI'19: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial Intelligence (1)
- AAAI'23/IAAI'23/EAAI'23: Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence (1)
- ICML'20: Proceedings of the 37th International Conference on Machine Learning (1)
- IJCAI'19: Proceedings of the 28th International Joint Conference on Artificial Intelligence (1)
- KDD '14: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining (1)
- KDD '15: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (1)
- KDD '21: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining (1)
- KDD '22: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (1)
- KDD '23: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (1)
- Machine Learning and Knowledge Discovery in Databases (1)
- MM '21: Proceedings of the 29th ACM International Conference on Multimedia (1)
- WSDM '20: Proceedings of the 13th International Conference on Web Search and Data Mining (1)
- WSDM '21: Proceedings of the 14th ACM International Conference on Web Search and Data Mining (1)
- WWW '18: Proceedings of the 2018 World Wide Web Conference (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-articlefreePublished By ACMPublished By ACM
Interdependent Causal Networks for Root Cause Localization
- Dongjie Wang
University of Central Florida, Orlando, FL, USA
, - Zhengzhang Chen
NEC Laboratories America Inc, Princeton, NJ, USA
, - Jingchao Ni
AWS AI Labs, Amazon, Settale, WA, USA
, - Liang Tong
NEC Laboratories America Inc, Princeton, NJ, USA
, - Zheng Wang
University of Utah, Salt Lake City, UT, USA
, - Yanjie Fu
University of Central Florida, Orlando, FL, USA
, - Haifeng Chen
NEC Laboratories America Inc, Princeton, NJ, USA
KDD '23: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining•August 2023, pp 5051-5060• https://doi.org/10.1145/3580305.3599849The goal of root cause analysis is to identify the underlying causes of system problems by discovering and analyzing the causal structure from system monitoring data. It is indispensable for maintaining the stability and robustness of large-scale complex ...
- 9Citation
- 908
- Downloads
MetricsTotal Citations9Total Downloads908Last 12 Months680Last 6 weeks50- 1
Supplementary Materialapfp246-2min-promo.mp4
- Dongjie Wang
- research-article
Time series contrastive learning with information-aware augmentations
- Dongsheng Luo
Florida International University
, - Wei Cheng
NEC Lab America
, - Yingheng Wang
Cornell University
, - Dongkuan Xu
North Carolina State University
, - Jingchao Ni
AWS AI Labs
, - Wenchao Yu
NEC Lab America
, - Xuchao Zhang
Microsoft
, - Yanchi Liu
NEC Lab America
, - Yuncong Chen
NEC Lab America
, - Haifeng Chen
NEC Lab America
, - Xiang Zhang
The Pennsylvania State University
AAAI'23/IAAI'23/EAAI'23: Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence•February 2023, Article No.: 506, pp 4534-4542• https://doi.org/10.1609/aaai.v37i4.25575Various contrastive learning approaches have been proposed in recent years and achieve significant empirical success. While effective and prevalent, contrastive learning has been less explored for time series data. A key component of contrastive learning ...
- 6Citation
MetricsTotal Citations6
- Dongsheng Luo
- research-articlePublic AccessPublished By ACMPublished By ACM
Towards Learning Disentangled Representations for Time Series
- Yuening Li
Texas A&M University & NEC Labs America, College Station, TX, USA
, - Zhengzhang Chen
NEC Labs America, Princeton, NJ, USA
, - Daochen Zha
Rice University, Houston, TX, USA
, - Mengnan Du
Texas A&M University, College Station, TX, USA
, - Jingchao Ni
NEC Labs America, Princeton, NJ, USA
, - Denghui Zhang
NEC Labs America, Princeton, NJ, USA
, - Haifeng Chen
NEC Labs America, Princeton, NJ, USA
, - Xia Hu
Rice University, Houston, TX, USA
KDD '22: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining•August 2022, pp 3270-3278• https://doi.org/10.1145/3534678.3539140Promising progress has been made toward learning efficient time series representations in recent years, but the learned representations often lack interpretability and do not encode semantic meanings by the complex interactions of many latent factors. ...
- 13Citation
- 1,810
- Downloads
MetricsTotal Citations13Total Downloads1,810Last 12 Months835Last 6 weeks110- 1
Supplementary MaterialKDD22-apfp1823.mp4
- Yuening Li
- research-articlePublished By ACMPublished By ACM
Interpreting Convolutional Sequence Model by Learning Local Prototypes with Adaptation Regularization
- Jingchao Ni
NEC Laboratories America, Princeton, NJ, USA
, - Zhengzhang Chen
NEC Laboratories America, Princeton, NJ, USA
, - Wei Cheng
NEC Laboratories America, Princeton, NJ, USA
, - Bo Zong
Salesforce, Seattle, WA, USA
, - Dongjin Song
University of Connecticut, Storrs, CT, USA
, - Yanchi Liu
NEC Laboratories America, Princeton, NJ, USA
, - Xuchao Zhang
NEC Laboratories America, Princeton, NJ, USA
, - Haifeng Chen
NEC Laboratories America, Princeton, NJ, USA
CIKM '21: Proceedings of the 30th ACM International Conference on Information & Knowledge Management•October 2021, pp 1366-1375• https://doi.org/10.1145/3459637.3482355In many high-stakes applications of machine learning models, outputting only predictions or providing statistical confidence is usually insufficient to gain trust from end users, who often prefer a transparent reasoning paradigm. Despite the recent ...
- 4Citation
- 245
- Downloads
MetricsTotal Citations4Total Downloads245Last 12 Months74Last 6 weeks1
- Jingchao Ni
- research-articlePublished By ACMPublished By ACM
Structural Temporal Graph Neural Networks for Anomaly Detection in Dynamic Graphs
- Lei Cai
Washington State University, Pullman, WA, USA
, - Zhengzhang Chen
NEC Laboratories America, Inc., Princeton, NJ, USA
, - Chen Luo
Amazon, Inc., Palo Alto, CA, USA
, - Jiaping Gui
Stellar Cyber, Inc., Santa Clara, CA, USA
, - Jingchao Ni
NEC Laboratories America, Inc., Princeton, NJ, USA
, - Ding Li
Peking University, Beijing, China
, - Haifeng Chen
NEC Laboratories America, Inc., Princeton, NJ, USA
CIKM '21: Proceedings of the 30th ACM International Conference on Information & Knowledge Management•October 2021, pp 3747-3756• https://doi.org/10.1145/3459637.3481955Detecting anomalies in dynamic graphs is a vital task, with numerous practical applications in areas such as security, finance, and social media. Existing network embedding based methods have mostly focused on learning good node representations, whereas ...
- 56Citation
- 1,773
- Downloads
MetricsTotal Citations56Total Downloads1,773Last 12 Months540Last 6 weeks46
- Lei Cai
- research-articlePublished By ACMPublished By ACM
Convolutional Transformer based Dual Discriminator Generative Adversarial Networks for Video Anomaly Detection
- Xinyang Feng
Columbia University, New York, NY, USA
, - Dongjin Song
University of Connecticut, Storrs, CT, USA
, - Yuncong Chen
NEC Laboratories America, Inc., Princeton, NJ, USA
, - Zhengzhang Chen
NEC Laboratories America, Inc., Princeton, NJ, USA
, - Jingchao Ni
NEC Laboratories America, Inc., Princeton, NJ, USA
, - Haifeng Chen
NEC Laboratories America, Inc., Princeton, NJ, USA
MM '21: Proceedings of the 29th ACM International Conference on Multimedia•October 2021, pp 5546-5554• https://doi.org/10.1145/3474085.3475693Detecting abnormal activities in real-world surveillance videos is an important yet challenging task as the prior knowledge about video anomalies is usually limited or unavailable. Despite that many approaches have been developed to resolve this problem,...
- 42Citation
- 649
- Downloads
MetricsTotal Citations42Total Downloads649Last 12 Months112Last 6 weeks6- 1
Supplementary Materialct-d2gan-presentation.mp4
- Xinyang Feng
- research-articlePublic AccessPublished By ACMPublished By ACM
Multi-Scale One-Class Recurrent Neural Networks for Discrete Event Sequence Anomaly Detection
- Zhiwei Wang
Michigan State University, East Lansing, MI, USA
, - Zhengzhang Chen
NEC Laboratories America, Inc., Princeton, NJ, USA
, - Jingchao Ni
NEC Laboratories America, Inc., Princeton, NJ, USA
, - Hui Liu
Michigan State University, East Lansing, MI, USA
, - Haifeng Chen
NEC Laboratories America, Inc., Princeton, NJ, 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 3726-3734• https://doi.org/10.1145/3447548.3467125Discrete event sequences are ubiquitous, such as an ordered event series of process interactions in Information and Communication Technology systems. Recent years have witnessed increasing efforts in detecting anomalies with discrete event sequences. ...
- 31Citation
- 1,295
- Downloads
MetricsTotal Citations31Total Downloads1,295Last 12 Months387Last 6 weeks66
- Zhiwei Wang
- research-articlePublic AccessPublished By ACMPublished By ACM
Learning to Drop: Robust Graph Neural Network via Topological Denoising
- Dongsheng Luo
Pennsylvania State University, State College, PA, USA
, - Wei Cheng
NEC Laboratories America, Princeton, NJ, USA
, - Wenchao Yu
NEC Laboratories America, Princeton, NJ, USA
, - Bo Zong
NEC Laboratories America, Princeton, NJ, USA
, - Jingchao Ni
NEC Laboratories America, Princeton, NJ, USA
, - Haifeng Chen
NEC Laboratories America, Princeton, NJ, USA
, - Xiang Zhang
Pennsylvania State University, State College, PA, USA
WSDM '21: Proceedings of the 14th ACM International Conference on Web Search and Data Mining•March 2021, pp 779-787• https://doi.org/10.1145/3437963.3441734Graph Neural Networks (GNNs) have shown to be powerful tools for graph analytics. The key idea is to recursively propagate and aggregate information along the edges of the given graph. Despite their success, however, the existing GNNs are usually ...
- 122Citation
- 3,140
- Downloads
MetricsTotal Citations122Total Downloads3,140Last 12 Months874Last 6 weeks104
- Dongsheng Luo
- Article
Node Classification in Temporal Graphs Through Stochastic Sparsification and Temporal Structural Convolution
- Cheng Zheng
Department of Computer Science, University of California, Los Angeles, CA, USA
, - Bo Zong
NEC Laboratories America, Princeton, NJ, USA
, - Wei Cheng
NEC Laboratories America, Princeton, NJ, USA
, - Dongjin Song
NEC Laboratories America, Princeton, NJ, USA
, - Jingchao Ni
NEC Laboratories America, Princeton, NJ, USA
, - Wenchao Yu
NEC Laboratories America, Princeton, NJ, USA
, - Haifeng Chen
NEC Laboratories America, Princeton, NJ, USA
, - Wei Wang
Department of Computer Science, University of California, Los Angeles, CA, USA
Machine Learning and Knowledge Discovery in Databases•September 2020, pp 330-346• https://doi.org/10.1007/978-3-030-67664-3_20AbstractNode classification in temporal graphs aims to predict node labels based on historical observations. In real-world applications, temporal graphs are complex with both graph topology and node attributes evolving rapidly, which poses a high ...
- 0Citation
MetricsTotal Citations0
- Cheng Zheng
- research-articlefree
Robust graph representation learning via neural sparsification
- Cheng Zheng
Department of Computer Science, University of California, Los Angeles, CA
, - Bo Zong
NEC Laboratories America, Princeton, NJ
, - Wei Cheng
NEC Laboratories America, Princeton, NJ
, - Dongjin Song
NEC Laboratories America, Princeton, NJ
, - Jingchao Ni
NEC Laboratories America, Princeton, NJ
, - Wenchao Yu
NEC Laboratories America, Princeton, NJ
, - Haifeng Chen
NEC Laboratories America, Princeton, NJ
, - Wei Wang
Department of Computer Science, University of California, Los Angeles, CA
ICML'20: Proceedings of the 37th International Conference on Machine Learning•July 2020, Article No.: 1062, pp 11458-11468Graph representation learning serves as the core of important prediction tasks, ranging from product recommendation to fraud detection. Reallife graphs usually have complex information in the local neighborhood, where each node is described by a rich set ...
- 1Citation
- 290
- Downloads
MetricsTotal Citations1Total Downloads290Last 12 Months208Last 6 weeks23- 1
Supplementary Material3524938.3526000_supp.pdf
- Cheng Zheng
- research-articlePublic AccessPublished By ACMPublished By ACM
Deep Multi-Graph Clustering via Attentive Cross-Graph Association
- Dongsheng Luo
Pennsylvania State University, State College, PA, USA
, - Jingchao Ni
NEC Laboratories America, Princeton, NJ, USA
, - Suhang Wang
Pennsylvania State University, State College, PA, USA
, - Yuchen Bian
Baidu Research, Sunnyvale, CA, USA
, - Xiong Yu
Case Western Reserve University, Cleveland, OH, USA
, - Xiang Zhang
Pennsylvania State University, State College, PA, USA
WSDM '20: Proceedings of the 13th International Conference on Web Search and Data Mining•January 2020, pp 393-401• https://doi.org/10.1145/3336191.3371806Multi-graph clustering aims to improve clustering accuracy by leveraging information from different domains, which has been shown to be extremely effective for achieving better clustering results than single graph based clustering algorithms. Despite ...
- 18Citation
- 1,746
- Downloads
MetricsTotal Citations18Total Downloads1,746Last 12 Months327Last 6 weeks35
- Dongsheng Luo
- research-article
The multi-walker chain and its application in local community detection
- Yuchen Bian
College of Information Sciences and Technology, The Pennsylvania State University, University Park, USA 16802
, - Jingchao Ni
College of Information Sciences and Technology, The Pennsylvania State University, University Park, USA 16802
, - Wei Cheng
NEC Laboratories America, Princeton, USA
, - Xiang Zhang
College of Information Sciences and Technology, The Pennsylvania State University, University Park, USA 16802
Knowledge and Information Systems, Volume 60, Issue 3•Sep 2019, pp 1663-1691 • https://doi.org/10.1007/s10115-018-1247-1AbstractLocal community detection (or local clustering) is of fundamental importance in large network analysis. Random walk-based methods have been routinely used in this task. Most existing random walk methods are based on the single-walker model. ...
- 3Citation
MetricsTotal Citations3
- Yuchen Bian
- Article
Heterogeneous graph matching networks for unknown malware detection
- Shen Wang
University of Illinois at Chicago and NEC Laboratories America
, - Zhengzhang Chen
NEC Laboratories America
, - Xiao Yu
NEC Laboratories America
, - Ding Li
NEC Laboratories America
, - Jingchao Ni
NEC Laboratories America
, - Lu-An Tang
NEC Laboratories America
, - Jiaping Gui
NEC Laboratories America
, - Zhichun Li
NEC Laboratories America
, - Haifeng Chen
NEC Laboratories America
, - Philip S. Yu
University of Illinois at Chicago and Tsinghua University, China
IJCAI'19: Proceedings of the 28th International Joint Conference on Artificial Intelligence•August 2019, pp 3762-3770Information systems have widely been the target of malware attacks. Traditional signature-based malicious program detection algorithms can only detect known malware and are prone to evasion techniques such as binary obfuscation, while behavior-based ...
- 2Citation
MetricsTotal Citations2
- Shen Wang
- research-articlefree
A deep neural network for unsupervised anomaly detection and diagnosis in multivariate time series data
- Chuxu Zhang
University of Notre Dame, IN
, - Dongjin Song
NEC Laboratories America, Inc., NJ
, - Yuncong Chen
NEC Laboratories America, Inc., NJ
, - Xinyang Feng
Columbia University, NY
, - Cristian Lumezanu
NEC Laboratories America, Inc., NJ
, - Wei Cheng
NEC Laboratories America, Inc., NJ
, - Jingchao Ni
NEC Laboratories America, Inc., NJ
, - Bo Zong
NEC Laboratories America, Inc., NJ
, - Haifeng Chen
NEC Laboratories America, Inc., NJ
, - Nitesh V. Chawla
University of Notre Dame, IN
AAAI'19/IAAI'19/EAAI'19: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial Intelligence•January 2019, Article No.: 174, pp 1409-1416• https://doi.org/10.1609/aaai.v33i01.33011409Nowadays, multivariate time series data are increasingly collected in various real world systems, e.g., power plants, wearable devices, etc. Anomaly detection and diagnosis in multi-variate time series refer to identifying abnormal status in certain time ...
- 79Citation
- 584
- Downloads
MetricsTotal Citations79Total Downloads584Last 12 Months235Last 6 weeks58
- Chuxu Zhang
- research-articlePublic Access
Co-Regularized Deep Multi-Network Embedding
- Jingchao Ni
Pennsylvania State University, University Park, PA, USA
, - Shiyu Chang
IBM T. J. Watson Research Center, New York, NY, USA
, - Xiao Liu
Pennsylvania State University, University Park, PA, USA
, - Wei Cheng
NEC Laboratories America, Princeton, NJ, USA
, - Haifeng Chen
NEC Laboratories America, Princeton, NJ, USA
, - Dongkuan Xu
Pennsylvania State University, University Park, PA, USA
, - Xiang Zhang
Pennsylvania State University, University Park, PA, USA
WWW '18: Proceedings of the 2018 World Wide Web Conference•April 2018, pp 469-478• https://doi.org/10.1145/3178876.3186113Network embedding aims to learn a low-dimensional vector representation for each node in the social and information networks, with the constraint to preserve network structures. Most existing methods focus on single network embedding, ignoring the ...
- 42Citation
- 2,232
- Downloads
MetricsTotal Citations42Total Downloads2,232Last 12 Months183Last 6 weeks14
- Jingchao Ni
- research-articlePublic AccessPublished By ACMPublished By ACM
Ranking Causal Anomalies for System Fault Diagnosis via Temporal and Dynamical Analysis on Vanishing Correlations
- Wei Cheng
NEC Laboratories America, Princeton, NJ
, - Jingchao Ni
Pennsylvania State University, University Park, PA
, - Kai Zhang
NEC Laboratories America, Princeton, NJ
, - Haifeng Chen
NEC Laboratories America, Princeton, NJ
, - Guofei Jiang
NEC Laboratories America, Princeton, NJ
, - Yu Shi
University of Illinois at Urbana-Champaign, Urbana, IL
, - Xiang Zhang
Pennsylvania State University, University Park, PA
, - Wei Wang
University of California, Los Angeles, Los Angeles, CA
ACM Transactions on Knowledge Discovery from Data, Volume 11, Issue 4•November 2017, Article No.: 40, pp 1-28 • https://doi.org/10.1145/3046946Detecting system anomalies is an important problem in many fields such as security, fault management, and industrial optimization. Recently, invariant network has shown to be powerful in characterizing complex system behaviours. In the invariant network,...
- 3Citation
- 639
- Downloads
MetricsTotal Citations3Total Downloads639Last 12 Months91Last 6 weeks8
- Wei Cheng
- research-articlePublished By ACMPublished By ACM
Flexible and Robust Multi-Network Clustering
- Jingchao Ni
Case Western Reserve University, Cleveland, OH, USA
, - Hanghang Tong
Arizona State University, Tempe, AZ, USA
, - Wei Fan
Baidu Research Big Data Lab, Sunnyvale, CA, USA
, - Xiang Zhang
Case Western Reserve University, Cleveland, OH, USA
KDD '15: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining•August 2015, pp 835-844• https://doi.org/10.1145/2783258.2783262Integrating multiple graphs (or networks) has been shown to be a promising approach to improve the graph clustering accuracy. Various multi-view and multi-domain graph clustering methods have recently been developed to integrate multiple networks. In ...
- 39Citation
- 976
- Downloads
MetricsTotal Citations39Total Downloads976Last 12 Months19Last 6 weeks1- 1
Supplementary Materialp835.mp4
- Jingchao Ni
- research-articlePublished By ACMPublished By ACM
Inside the atoms: ranking on a network of networks
- Jingchao Ni
Case Western Reserve University, Cleveland, OH, USA
, - Hanghang Tong
Arizona State University, Tempe, AZ, USA
, - Wei Fan
Huawei Noahs Ark Lab, Hong Kong, Hong Kong
, - Xiang Zhang
Case Western Reserve University, Cleveland, OH, USA
KDD '14: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining•August 2014, pp 1356-1365• https://doi.org/10.1145/2623330.2623643Networks are prevalent and have posed many fascinating research questions. How can we spot similar users, e.g., virtual identical twins, in Cleveland for a New Yorker? Given a query disease, how can we prioritize its candidate genes by incorporating the ...
- 52Citation
- 736
- Downloads
MetricsTotal Citations52Total Downloads736Last 12 Months49Last 6 weeks4- 1
Supplementary Materialp1356-sidebyside.mp4
- Jingchao Ni
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