Nikhil Rao
Applied Filters
- Nikhil Rao
- AuthorRemove filter
People
Colleagues
- Nikhil Rao (23)
- Karthik Subbian (14)
- Chandan K. Reddy (9)
- Sumeet Katariya (7)
- Nurendra Choudhary (6)
- Edward W Huang (3)
- Aman Ahuja (2)
- Danai Koutra (2)
- Inderjit Singh Dhillon (2)
- Jure Leskovec (2)
- Srinivasan H Sengamedu (2)
- Weicong Ding (2)
- Xianfeng Tang (2)
- Yifan Sun (2)
- Dimitris Sacharidis (1)
- Graham Cormode (1)
- Lise Carol Getoor (1)
- Manik Varma (1)
- Nick Craswell (1)
- Preslav Nakov (1)
Publication
Proceedings/Book Names
- KDD '22: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (3)
- KDD '21: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining (2)
- NIPS '22: Proceedings of the 36th International Conference on Neural Information Processing Systems (2)
- CIKM '19: Proceedings of the 28th ACM International Conference on Information and Knowledge Management (1)
- KDD '16: Proceedings of the 22nd ACM SIGKDD International 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)
- NIPS'16: Proceedings of the 30th International Conference on Neural Information Processing Systems (1)
- SIGIR '21: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval (1)
- WSDM '18: Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining (1)
- WSDM '20: Proceedings of the 13th International Conference on Web Search and Data Mining (1)
- WSDM '22: Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining (1)
- WSDM '23: Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining (1)
- WWW '18: Proceedings of the 2018 World Wide Web Conference (1)
- WWW '21: Proceedings of the Web Conference 2021 (1)
- WWW '22: Companion Proceedings of the Web Conference 2022 (1)
- WWW '22: Proceedings of the ACM Web Conference 2022 (1)
- WWW '24: Companion 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-articlePublished By ACMPublished By ACM
Simplifying Distributed Neural Network Training on Massive Graphs: Randomized Partitions Improve Model Aggregation
- Jiong Zhu
Amazon, Palo Alto, CA, USA and University of Michigan, Ann Arbor, MI, USA
, - Aishwarya Reganti
Amazon, Palo Alto, CA, USA
, - Edward W. Huang
Amazon, Palo Alto, CA, USA
, - Charles Dickens
University of California, Santa Cruz, CA, USA
, - Nikhil Rao
Microsoft, Redmond, WA, USA
, - Karthik Subbian
Amazon, Palo Alto, CA, USA
, - Danai Koutra
Amazon, Palo Alto, CA, USA and University of Michigan, Ann Arbor, MI, USA
ACM Transactions on Knowledge Discovery from Data, Volume 19, Issue 1•January 2025, Article No.: 23, pp 1-26 • https://doi.org/10.1145/3701563Distributed graph neural network (GNN) training facilitates learning on massive graphs that surpass the storage and computational capabilities of a single machine. Traditional distributed frameworks strive for performance parity with centralized training ...
- 0Citation
- 115
- Downloads
MetricsTotal Citations0Total Downloads115Last 12 Months115Last 6 weeks41
- Jiong Zhu
- research-article
Probabilistic entity representation model for reasoning over knowledge graphs
- Nurendra Choudhary
Department of Computer Science, Virginia Tech, Arlington, VA
, - Nikhil Rao
Amazon, Palo Alto, CA
, - Sumeet Katariya
Amazon, Palo Alto, CA
, - Karthik Subbian
Amazon, Palo Alto, CA
, - Chandan K. Reddy
Department of Computer Science, Virginia Tech, Arlington, VA and Amazon, Palo Alto, CA
NIPS '21: Proceedings of the 35th International Conference on Neural Information Processing Systems•December 2021, Article No.: 1795, pp 23440-23451Logical reasoning over Knowledge Graphs (KGs) is a fundamental technique that can provide efficient querying mechanism over large and incomplete databases. Current approaches employ spatial geometries such as boxes to learn query representations that ...
- 0Citation
MetricsTotal Citations0- 1
Supplementary Material3540261.3542056_supp.pdf
- Nurendra Choudhary
- research-article
Hyperbolic graph neural networks at scale: a meta learning approach
- Nurendra Choudhary
Virginia Tech, Arlington, VA
, - Nikhil Rao
Microsoft, Sunnyvale, CA
, - Chandan K. Reddy
Virginia Tech, Arlington, VA
NIPS '23: Proceedings of the 37th International Conference on Neural Information Processing Systems•December 2023, Article No.: 1926, pp 44488-44501The progress in hyperbolic neural networks (HNNs) research is hindered by their absence of inductive bias mechanisms, which are essential for generalizing to new tasks and facilitating scalable learning over large datasets. In this paper, we aim to ...
- 0Citation
MetricsTotal Citations0- 1
Supplementary Material3666122.3668048_supp.pdf
- Nurendra Choudhary
- research-articleOpen AccessPublished By ACMPublished By ACM
MS MARCO Web Search: A Large-scale Information-rich Web Dataset with Millions of Real Click Labels
- Qi Chen
Microsoft, Beijing, China
, - Xiubo Geng
Microsoft, Beijing, China
, - Corby Rosset
Microsoft, Redmond, USA
, - Carolyn Buractaon
Microsoft, Redmond, USA
, - Jingwen Lu
Microsoft, Redmond, USA
, - Tao Shen
University of Technology Sydney, Sydney, Australia
, - Kun Zhou
Microsoft, Beijing, China
, - Chenyan Xiong
Carnegie Mellon University, Pittsburgh, USA
, - Yeyun Gong
Microsoft, Beijing, China
, - Paul Bennett
Spotify, New York, USA
, - Nick Craswell
Microsoft, Redmond, USA
, - Xing Xie
Microsoft, Beijing, China
, - Fan Yang
Microsoft, Beijing, China
, - Bryan Tower
Microsoft, Redmond, USA
, - Nikhil Rao
Microsoft, Mountain View, USA
, - Anlei Dong
Microsoft, Mountain View, USA
, - Wenqi Jiang
ETH Zurich, Zürich, Switzerland
, - Zheng Liu
Microsoft, Beijing, China
, - Mingqin Li
Microsoft, Redmond, USA
, - Chuanjie Liu
Microsoft, Beijing, China
, - Zengzhong Li
Microsoft, Redmond, USA
, - Rangan Majumder
Microsoft, Redmond, USA
, - Jennifer Neville
Microsoft, Redmond, USA
, - Andy Oakley
Microsoft, Redmond, USA
, - Knut Magne Risvik
Microsoft, Oslo, Norway
, - Harsha Vardhan Simhadri
Microsoft, Redmond, USA
, - Manik Varma
Microsoft, Bengaluru, India
, - Yujing Wang
Microsoft, Beijing, China
, - Linjun Yang
Microsoft, Redmond, USA
, - Mao Yang
Microsoft, Beijing, China
, - Ce Zhang
ETH Zürich, Zürich, Switzerland
WWW '24: Companion Proceedings of the ACM Web Conference 2024•May 2024, pp 292-301• https://doi.org/10.1145/3589335.3648327Recent breakthroughs in large models have highlighted the critical significance of data scale, labels and modals. In this paper, we introduce MS MARCO Web Search, the first large-scale information-rich web dataset, featuring millions of real clicked ...
- 0Citation
- 894
- Downloads
MetricsTotal Citations0Total Downloads894Last 12 Months894Last 6 weeks116- 1
Supplementary Materialip6166.mp4
- Qi Chen
- research-article
Task-agnostic graph explanations
- Yaochen Xie
Texas A & M University, College Station, TX
, - Sumeet Katariya
Amazon Search, Palo Alto, CA
, - Xianfeng Tang
Amazon Search, Palo Alto, CA
, - Edward Huang
Amazon Search, Palo Alto, CA
, - Nikhil Rao
Amazon Search, Palo Alto, CA
, - Karthik Subbian
Amazon Search, Palo Alto, CA
, - Shuiwang Ji
Texas A & M University, College Station, TX
NIPS '22: Proceedings of the 36th International Conference on Neural Information Processing Systems•November 2022, Article No.: 874, pp 12027-12039Graph Neural Networks (GNNs) have emerged as powerful tools to encode graph-structured data. Due to their broad applications, there is an increasing need to develop tools to explain how GNNs make decisions given graph-structured data. Existing learning-...
- 0Citation
MetricsTotal Citations0- 1
Supplementary Material3600270.3601144_supp.pdf
- Yaochen Xie
- research-article
Maximizing and satisficing in multi-armed bandits with graph information
- Parth K. Thaker
Arizona State University
, - Mohit Malu
Arizona State University
, - Nikhil Rao
Microsoft
, - Gautam Dasarathy
Arizona State University
NIPS '22: Proceedings of the 36th International Conference on Neural Information Processing Systems•November 2022, Article No.: 147, pp 2019-2032Pure exploration in multi-armed bandits has emerged as an important framework for modeling decision making and search under uncertainty. In modern applications however, one is often faced with a tremendously large number of options and even obtaining one ...
- 0Citation
MetricsTotal Citations0- 1
Supplementary Material3600270.3600417_supp.pdf
- Parth K. Thaker
- research-articleOpen AccessPublished By ACMPublished By ACM
Search Behavior Prediction: A Hypergraph Perspective
- Yan Han
University of Texas at Austin, Austin, TX, USA
, - Edward W. Huang
Amazon, Palo Alto, CA, USA
, - Wenqing Zheng
University of Texas at Austin, Austin, TX, USA
, - Nikhil Rao
Amazon, Palo Alto, CA, USA
, - Zhangyang Wang
University of Texas at Austin, Austin, TX, USA
, - Karthik Subbian
Amazon, Palo Alto, CA, USA
WSDM '23: Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining•February 2023, pp 697-705• https://doi.org/10.1145/3539597.3570403At E-Commerce stores such as Amazon, eBay, and Taobao, the shopping items and the query words that customers use to search for the items form a bipartite graph that captures search behavior. Such a query-item graph can be used to forecast search trends ...
- 6Citation
- 516
- Downloads
MetricsTotal Citations6Total Downloads516Last 12 Months260Last 6 weeks26- 1
Supplementary MaterialWSDM23-fp0263.mp4
- Yan Han
- 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
- 213
- Downloads
MetricsTotal Citations0Total Downloads213Last 12 Months44Last 6 weeks3
- Riccardo Tommasini
- abstractPublished By ACMPublished By ACM
Hyperbolic Neural Networks: Theory, Architectures and Applications
- Nurendra Choudhary
Virginia Tech, Arlington, VA, USA
, - Nikhil Rao
Amazon, Palo Alto, CA, USA
, - Karthik Subbian
Amazon, Palo Alto, CA, USA
, - Srinivasan H. Sengamedu
Amazon, Seattle, WA, USA
, - Chandan K. Reddy
Virginia Tech, Arlington, VA, USA
KDD '22: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining•August 2022, pp 4778-4779• https://doi.org/10.1145/3534678.3542613Recent studies have revealed important properties that are unique to graph datasets such as hierarchies and global structures. This has driven research into hyperbolic space due to their ability to effectively encode the inherent hierarchy present in ...
- 2Citation
- 298
- Downloads
MetricsTotal Citations2Total Downloads298Last 12 Months53Last 6 weeks8
- Nurendra Choudhary
- research-articlePublished By ACMPublished By ACM
Learning Backward Compatible Embeddings
- Weihua Hu
Stanford University, Stanford, CA, USA
, - Rajas Bansal
Stanford University, Stanford, CA, USA
, - Kaidi Cao
Stanford University, Stanford, CA, USA
, - Nikhil Rao
Amazon, Palo Alto, CA, USA
, - Karthik Subbian
Amazon, Palo Alto, CA, USA
, - Jure Leskovec
Stanford University, Stanford, CA, USA
KDD '22: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining•August 2022, pp 3018-3028• https://doi.org/10.1145/3534678.3539194Embeddings, low-dimensional vector representation of objects, are fundamental in building modern machine learning systems. In industrial settings, there is usually an embedding team that trains an embedding model to solve intended tasks (e.g., product ...
- 7Citation
- 275
- Downloads
MetricsTotal Citations7Total Downloads275Last 12 Months46Last 6 weeks2
- Weihua Hu
- research-articleOpen AccessPublished By ACMPublished By ACM
Graph-based Multilingual Language Model: Leveraging Product Relations for Search Relevance
- Nurendra Choudhary
Virginia Tech, Arlington, VA, USA
, - Nikhil Rao
Amazon, Palo Alto, CA, USA
, - Karthik Subbian
Amazon, Palo Alto, CA, USA
, - Chandan K. Reddy
Virginia Tech, Arlington, VA, USA
KDD '22: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining•August 2022, pp 2789-2799• https://doi.org/10.1145/3534678.3539158The large-scale nature of product catalog and the changing demands of customer queries makes product search a challenging problem. The customer queries are ambiguous and implicit. They may be looking for an exact match of their query, or a functional ...
- 3Citation
- 736
- Downloads
MetricsTotal Citations3Total Downloads736Last 12 Months292Last 6 weeks33- 1
Supplementary MaterialKDD2022_SALAM.mp4
- Nurendra Choudhary
- research-articlePublic AccessPublished By ACMPublished By ACM
ALLIE: Active Learning on Large-scale Imbalanced Graphs
- Limeng Cui
The Pennsylvania State University, USA
, - Xianfeng Tang
Amazon.com, USA
, - Sumeet Katariya
Amazon.com, USA
, - Nikhil Rao
Amazon.com, USA
, - Pallav Agrawal
Amazon.com, USA
, - Karthik Subbian
Amazon.com, USA
, - Dongwon Lee
The Pennsylvania State University, USA
WWW '22: Proceedings of the ACM Web Conference 2022•April 2022, pp 690-698• https://doi.org/10.1145/3485447.3512229Human labeling is time-consuming and costly. This problem is further exacerbated in extremely imbalanced class label scenarios, such as detecting fraudsters in online websites. Active learning selects the most relevant example for human labelers to ...
- 9Citation
- 884
- Downloads
MetricsTotal Citations9Total Downloads884Last 12 Months329Last 6 weeks41
- Limeng Cui
- research-articleOpen AccessPublished By ACMPublished By ACM
ANTHEM: Attentive Hyperbolic Entity Model for Product Search
- Nurendra Choudhary
Virginia Tech, Arlington, VA, USA
, - Nikhil Rao
Amazon, Palo Alto, CA, USA
, - Sumeet Katariya
Amazon, Palo Alto, CA, USA
, - Karthik Subbian
Amazon, Palo Alto, CA, USA
, - Chandan K. Reddy
Virginia Tech & Amazon, Arlington, VA, USA
WSDM '22: Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining•February 2022, pp 161-171• https://doi.org/10.1145/3488560.3498456Product search is a fundamentally challenging problem due to the large-size of product catalogues and the complexity of extracting semantic information from products. In addition to this, the black-box nature of most search systems also hamper a smooth ...
- 2Citation
- 557
- Downloads
MetricsTotal Citations2Total Downloads557Last 12 Months284Last 6 weeks26- 1
Supplementary MaterialWSDM22-fp442.mp4
- Nurendra Choudhary
- abstractPublished By ACMPublished By ACM
Workshop on Data-Efficient Machine Learning (DeMaL)
- Sumeet Katariya
Amazon, Palo Alto, CA, USA
, - Nikhil Rao
Amazon, Palo Alto, CA, USA
, - Chandan K. Reddy
Virginia Tech, Arlington, VA, USA
KDD '21: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining•August 2021, pp 4135-4136• https://doi.org/10.1145/3447548.3469451The recent increase in the size of neural networks has led to a proportional increase in the demands for high-quality human-annotated data. Labeling data is a costly and time-consuming endeavor, and the need for large data is often satiated through ...
- 0Citation
- 84
- Downloads
MetricsTotal Citations0Total Downloads84Last 12 Months7
- Sumeet Katariya
- research-articlePublic AccessPublished By ACMPublished By ACM
Bipartite Dynamic Representations for Abuse Detection
- Andrew Z. Wang
Stanford University, Stanford, CA, USA
, - Rex Ying
Stanford University, Stanford, CA, USA
, - Pan Li
Purdue University, West Lafayette, IN, USA
, - Nikhil Rao
Amazon, Palo Alto, CA, USA
, - Karthik Subbian
Amazon, Palo Alto, CA, USA
, - Jure Leskovec
Stanford University, Stanford, CA, USA
KDD '21: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining•August 2021, pp 3638-3648• https://doi.org/10.1145/3447548.3467141Abusive behavior in online retail websites and communities threatens the experience of regular community members. Such behavior often takes place within a complex, dynamic, and large-scale network of users interacting with items. Detecting abuse is ...
- 15Citation
- 1,235
- Downloads
MetricsTotal Citations15Total Downloads1,235Last 12 Months228Last 6 weeks34
- Andrew Z. Wang
- abstractPublished By ACMPublished By ACM
Learning with Little Data: Industry Challenges and Innovations
- Nikhil Rao
Amazon, Palo Alto, CA, USA
SIGIR '21: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval•July 2021, pp 2625-2626• https://doi.org/10.1145/3404835.3464925In e-commerce applications, customers search and discover one or more products using queries. Some of these queries are broad and diverse, with multiple intents. Therefore, relying purely on the anonymized and aggregated customer historical behavioral ...
- 0Citation
- 107
- Downloads
MetricsTotal Citations0Total Downloads107Last 12 Months8Last 6 weeks1
- Nikhil Rao
- research-articlePublished By ACMPublished By ACM
Self-Supervised Hyperboloid Representations from Logical Queries over Knowledge Graphs
- Nurendra Choudhary
Department of Computer Science, Virginia Tech, Arlington, VA, USA
, - Nikhil Rao
Amazon, Palo Alto, CA, USA
, - Sumeet Katariya
Amazon, Palo Alto, CA, USA
, - Karthik Subbian
Amazon, Palo Alto, CA, USA
, - Chandan K. Reddy
Department of Computer Science, Virginia Tech, Arlington, VA and Amazon, Palo Alto, CA, USA
WWW '21: Proceedings of the Web Conference 2021•April 2021, pp 1373-1384• https://doi.org/10.1145/3442381.3449974Knowledge Graphs (KGs) are ubiquitous structures for information storage in several real-world applications such as web search, e-commerce, social networks, and biology. Querying KGs remains a foundational and challenging problem due to their size and ...
- 20Citation
- 448
- Downloads
MetricsTotal Citations20Total Downloads448Last 12 Months50Last 6 weeks4
- Nurendra Choudhary
- research-articlePublished By ACMPublished By ACM
Language-Agnostic Representation Learning for Product Search on E-Commerce Platforms
- Aman Ahuja
Virginia Tech, Arlington, VA, USA
, - Nikhil Rao
Amazon, Palo Alto, CA, USA
, - Sumeet Katariya
Amazon, Palo Alto, CA, USA
, - Karthik Subbian
Amazon, Palo Alto, CA, USA
, - Chandan K. Reddy
Virginia Tech, Arlington, VA, USA
WSDM '20: Proceedings of the 13th International Conference on Web Search and Data Mining•January 2020, pp 7-15• https://doi.org/10.1145/3336191.3371852Product search forms an indispensable component of any e-commerce service, and helps customers find products of their interest from a large catalog on these websites. When products that are irrelevant to the search query are surfaced, it leads to a poor ...
- 14Citation
- 541
- Downloads
MetricsTotal Citations14Total Downloads541Last 12 Months46Last 6 weeks4
- Aman Ahuja
- research-articleOpen AccessPublished By ACMPublished By ACM
Identifying Facet Mismatches In Search Via Micrographs
- Sriram Srinivasan
University of California, Santa Cruz, Santa Cruz, CA, USA
, - Nikhil S. Rao
Amazon Inc., Palo Alto, CA, USA
, - Karthik Subbian
Amazon Inc., Palo Alto, CA, USA
, - Lise Getoor
University of California, Santa Cruz, Santa Cruz, CA, USA
CIKM '19: Proceedings of the 28th ACM International Conference on Information and Knowledge Management•November 2019, pp 1663-1672• https://doi.org/10.1145/3357384.3357911E-commerce search engines are the primary means by which customers shop for products online. Each customer query contains multiple facets such as product type, color, brand, etc. A successful search engine retrieves products that are relevant to the ...
- 2Citation
- 362
- Downloads
MetricsTotal Citations2Total Downloads362Last 12 Months75Last 6 weeks12
- Sriram Srinivasan
- research-articlefree
A Sparse Topic Model for Extracting Aspect-Specific Summaries from Online Reviews
- Vineeth Rakesh
Arizona State University, Tempe, AZ, USA
, - Weicong Ding
Amazon, Seattle, WA, USA
, - Aman Ahuja
Virginia Tech, Arlington, VA, USA
, - Nikhil Rao
Amazon, San Franscisco, CA, USA
, - Yifan Sun
Technicolor, Los Altos, CA, USA
, - Chandan K. Reddy
Virginia Tech, Arlington, VA, USA
WWW '18: Proceedings of the 2018 World Wide Web Conference•April 2018, pp 1573-1582• https://doi.org/10.1145/3178876.3186069Online reviews have become an inevitable part of a consumer's decision making process, where the likelihood of purchase not only depends on the product's overall rating, but also on the description of its aspects. Therefore, e-commerce websites such as ...
- 15Citation
- 1,188
- Downloads
MetricsTotal Citations15Total Downloads1,188Last 12 Months153Last 6 weeks23
- Vineeth Rakesh
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