Fredrik D Johansson
Applied Filters
- Fredrik D Johansson
- AuthorRemove filter
People
Colleagues
- Devdatt Padmakar Dubhashi (7)
- David Alexander Sontag (5)
- Vinay Jethava (4)
- Chiranjib Bhattacharyya (3)
- Uri Shalit (3)
- Ashkan Panahi (2)
- Gabriele Capannini (1)
- Gerhard Gossen (1)
- John Vogel Guttag (1)
- Lars Borin (1)
- Markus Forsberg (1)
- Nina Tahmasebi (1)
- Peter Exner (1)
- Pierre M Nugues (1)
- Richard Johansson (1)
- Sławomir Nowaczyk (1)
- Svetoslav Marinov (1)
- Thomas Risse (1)
- Tobias Färdig (1)
Publication
Proceedings/Book Names
- ICML'17: Proceedings of the 34th International Conference on Machine Learning - Volume 70 (2)
- 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)
- CIKM '13: Proceedings of the 22nd ACM international conference on Information & Knowledge Management (1)
- Global Geometric Graph Kernels and Applications (1)
- ICDMW '13: Proceedings of the 2013 IEEE 13th International Conference on Data Mining Workshops (1)
- ICML'14: Proceedings of the 31st International Conference on International Conference on Machine Learning - Volume 32 (1)
- ICML'16: Proceedings of the 33rd International Conference on International Conference on Machine Learning - Volume 48 (1)
- ICML'20: Proceedings of the 37th International Conference on Machine Learning (1)
- IJCAI '23: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (1)
- IMMS '20: Proceedings of the 3rd International Conference on Information Management and Management Science (1)
- KDD '15: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (1)
- NIPS '20: Proceedings of the 34th International Conference on Neural Information Processing Systems (1)
- NIPS'15: Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 1 (1)
- NIPS'18: Proceedings of the 32nd International Conference on Neural Information Processing Systems (1)
- PIKM '12: Proceedings of the 5th Ph.D. workshop on Information and knowledge (1)
Publication Date
Export Citations
Publications
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-article
Time series of satellite imagery improve deep learning estimates of neighborhood-level poverty in africa
- Markus B. Pettersson
Data Science and AI Division, Chalmers University of Technology, Sweden and The AI and Global Development Lab
, - Mohammad Kakooei
Data Science and AI Division, Chalmers University of Technology, Sweden and The AI and Global Development Lab
, - Julia Ortheden
Data Science and AI Division, Chalmers University of Technology, Sweden
, - Fredrik D. Johansson
Data Science and AI Division, Chalmers University of Technology, Sweden
, - Adel Daoud
Data Science and AI Division, Chalmers University of Technology, Sweden and Institute for Analytical Sociology, Linköping University, Sweden and Center for Advanced Study in the Behavioral Sciences, Stanford University and The AI and Global Development Lab
IJCAI '23: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence•August 2023, Article No.: 684, pp 6165-6173• https://doi.org/10.24963/ijcai.2023/684To combat poor health and living conditions, policymakers in Africa require temporally and geographically granular data measuring economic well-being. Machine learning (ML) offers a promising alternative to expensive and time-consuming survey measurements ...
- 0Citation
MetricsTotal Citations0
- Markus B. Pettersson
- research-article
Sharing pattern submodels for prediction with missing values
- Lena Stempfle
Chalmers University of Technology, Department of Computer Science and Engineering, Gothenburg, Sweden
, - Ashkan Panahi
Chalmers University of Technology, Department of Computer Science and Engineering, Gothenburg, Sweden
, - Fredrik D. Johansson
Chalmers University of Technology, Department of Computer Science and Engineering, Gothenburg, Sweden
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.: 1110, pp 9882-9890• https://doi.org/10.1609/aaai.v37i8.26179Missing values are unavoidable in many applications of machine learning and present challenges both during training and at test time. When variables are missing in recurring patterns, fitting separate pattern submodels have been proposed as a solution. ...
- 1Citation
MetricsTotal Citations1
- Lena Stempfle
- research-articlefree
Generalization bounds and representation learning for estimation of potential outcomes and causal effects
- Fredrik D. Johansson
Chalmers University of Technology, Göteborg, Sweden
, - Uri Shalit
Technion - Israel Institute of Technology, Haifa, Israel
, - Nathan Kallus
Cornell University, New York, NY
, - David Sontag
Massachusetts Institute of Technology, Cambridge, MA
Practitioners in diverse fields such as healthcare, economics and education are eager to apply machine learning to improve decision making. The cost and impracticality of performing experiments and a recent monumental increase in electronic record keeping ...
- 1Citation
- 311
- Downloads
MetricsTotal Citations1Total Downloads311Last 12 Months174Last 6 weeks14
- Fredrik D. Johansson
- research-articlefree
Learning to search efficiently for causally near-optimal treatments
- Samuel Håkansson
University of Gothenburg
, - Viktor Lindblom
Chalmers University of Technology
, - Omer Gottesman
Brown University
, - Fredrik D. Johansson
Chalmers University of Technology
NIPS '20: Proceedings of the 34th International Conference on Neural Information Processing Systems•December 2020, Article No.: 113, pp 1333-1344Finding an effective medical treatment often requires a search by trial and error. Making this search more efficient by minimizing the number of unnecessary trials could lower both costs and patient suffering. We formalize this problem as learning a ...
- 0Citation
- 13
- Downloads
MetricsTotal Citations0Total Downloads13Last 12 Months11Last 6 weeks6- 1
Supplementary Material3495724.3495837_supp.pdf
- Samuel Håkansson
- research-articlePublished By ACMPublished By ACM
Understanding Association Between Logged Vehicle Data and Vehicle Marketing Parameters: Using Clustering and Rule-Based Machine Learning
- Oskar Dahl
Halmstad University, CAISR, Halmstad, Sweden
, - Fredrik Johansson
Halmstad University, CAISR, Halmstad, Sweden
, - Reza Khoshkangini
Halmstad University, CAISR, Halmstad, Sweden
, - Sepideh Pashami
Halmstad University, CAISR, Halmstad, Sweden
, - Sławomir Nowaczyk
Halmstad University, CAISR, Halmstad, Sweden
, - Pihl Claes
Volvo Group, Q&CS, Gothenburg, Sweden
IMMS '20: Proceedings of the 3rd International Conference on Information Management and Management Science•August 2020, pp 13-22• https://doi.org/10.1145/3416028.3417215Trucks are designed, configured and marketed for various working environments. There lies a concern whether trucks are used as intended by the manufacturer, as usage may impact the longevity, efficiency and productivity of the trucks. In this paper we ...
- 2Citation
- 65
- Downloads
MetricsTotal Citations2Total Downloads65Last 12 Months8
- Oskar Dahl
- research-articlefree
Estimation of bounds on potential outcomes for decision making
- Maggie Makar
CSAIL, MIT
, - Fredrik Johansson
Chalmers University of Technology
, - John Guttag
CSAIL, MIT
, - David Sontag
CSAIL, MIT
ICML'20: Proceedings of the 37th International Conference on Machine Learning•July 2020, Article No.: 618, pp 6661-6671Estimation of individual treatment effects is commonly used as the basis for contextual decision making in fields such as healthcare, education, and economics. However, it is often sufficient for the decision maker to have estimates of upper and lower ...
- 0Citation
- 17
- Downloads
MetricsTotal Citations0Total Downloads17Last 12 Months12Last 6 weeks3- 1
Supplementary Material3524938.3525556_supp.pdf
- Maggie Makar
- Articlefree
Why is my classifier discriminatory?
NIPS'18: Proceedings of the 32nd International Conference on Neural Information Processing Systems•December 2018, pp 3543-3554Recent attempts to achieve fairness in predictive models focus on the balance between fairness and accuracy. In sensitive applications such as healthcare or criminal justice, this trade-off is often undesirable as any increase in prediction error could ...
- 26Citation
- 566
- Downloads
MetricsTotal Citations26Total Downloads566Last 12 Months338Last 6 weeks41
- Articlefree
Estimating individual treatment effect: generalization bounds and algorithms
- Uri Shalit
CIMS, New York University, New York, NY
, - Fredrik D. Johansson
CIMS, New York University, New York, NY and IMES, MIT, Cambridge, MA
, - David Sontag
IMES, MIT, Cambridge, MA and CSAIL, MIT, Cambridge, MA
ICML'17: Proceedings of the 34th International Conference on Machine Learning - Volume 70•August 2017, pp 3076-3085There is intense interest in applying machine learning to problems of causal inference in fields such as healthcare, economics and education. In particular, individual-level causal inference has important applications such as precision medicine. We give ...
- 50Citation
- 667
- Downloads
MetricsTotal Citations50Total Downloads667Last 12 Months121Last 6 weeks23
- Uri Shalit
- Articlefree
Clustering by sum of norms: stochastic incremental algorithm, convergence and cluster recovery
- Ashkan Panahi
ECE, North Carolina State University, Raleigh, NC
, - Devdatt Dubhashi
CSE, Chalmers University of Technology, Göteborg, Sweden
, - Fredrik D. Johansson
IMES, MIT, Cambridge, MA
, - Chiranjib Bhattacharyya
CSA, IISc, Bangalore, India
ICML'17: Proceedings of the 34th International Conference on Machine Learning - Volume 70•August 2017, pp 2769-2777Standard clustering methods such as K-means, Gaussian mixture models, and hierarchical clustering, are beset by local minima, which are sometimes drastically suboptimal. Moreover the number of clusters K must be known in advance. The recently introduced ...
- 0Citation
- 55
- Downloads
MetricsTotal Citations0Total Downloads55Last 12 Months20Last 6 weeks7
- Ashkan Panahi
- Article
Learning representations for counterfactual inference
- Fredrik D. Johansson
CSE, Chalmers University of Technology, Göteborg, Sweden
, - Uri Shalit
CIMS, New York University, New York, NY
, - David Sontag
CIMS, New York University, New York, NY
ICML'16: Proceedings of the 33rd International Conference on International Conference on Machine Learning - Volume 48•June 2016, pp 3020-3029Observational studies are rising in importance due to the widespread accumulation of data in fields such as healthcare, education, employment and ecology. We consider the task of answering counterfactual questions such as, "Would this patient have lower ...
- 62Citation
MetricsTotal Citations62
- Fredrik D. Johansson
- Article
Weighted theta functions and embeddings with applications to Max-Cut, clustering and summarization
- Fredrik D. Johansson
Computer Science & Engineering, Chalmers University of Technology, Göteborg, Sweden
, - Ankani Chattoraj
Brain & Cognitive Sciences, University of Rochester, Rochester, NY
, - Chiranjib Bhattacharyya
Computer Science and Automation, Indian Institute of Science, Bangalore, Karnataka, India
, - Devdatt Dubhashi
Computer Science & Engineering, Chalmers University of Technology, Göteborg, Sweden
NIPS'15: Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 1•December 2015, pp 1018-1026We introduce a unifying generalization of the Lovasz theta function, and the associated geometric embedding, for graphs with weights on both nodes and edges. We show how it can be computed exactly by semidefinite programming, and how to approximate it ...
- 0Citation
MetricsTotal Citations0
- Fredrik D. Johansson
- research-articlePublished By ACMPublished By ACM
Learning with Similarity Functions on Graphs using Matchings of Geometric Embeddings
- Fredrik D. Johansson
Chalmers University of Technology, Göteborg, Sweden
, - Devdatt Dubhashi
Chalmers University of Technology, Göteborg, Sweden
KDD '15: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining•August 2015, pp 467-476• https://doi.org/10.1145/2783258.2783341We develop and apply the Balcan-Blum-Srebro (BBS) theory of classification via similarity functions (which are not necessarily kernels) to the problem of graph classification. First we place the BBS theory into the unifying framework of optimal ...
- 20Citation
- 1,056
- Downloads
MetricsTotal Citations20Total Downloads1,056Last 12 Months21Last 6 weeks4- 1
Supplementary Materialp467.mp4
- Fredrik D. Johansson
- article
Visions and open challenges for a knowledge-based culturomics
- Nina Tahmasebi
Språkbanken, University of Gothenburg, Gothenburg, Sweden
, - Lars Borin
Språkbanken, University of Gothenburg, Gothenburg, Sweden
, - Gabriele Capannini
Chalmers University of Technology, Gothenburg, Sweden
, - Devdatt Dubhashi
Chalmers University of Technology, Gothenburg, Sweden
, - Peter Exner
Lund University, Lund, Sweden
, - Markus Forsberg
Språkbanken, University of Gothenburg, Gothenburg, Sweden
, - Gerhard Gossen
L3S Research Center, Hannover, Germany
, - Fredrik D. Johansson
Chalmers University of Technology, Gothenburg, Sweden
, - Richard Johansson
Språkbanken, University of Gothenburg, Gothenburg, Sweden
, - Mikael Kågebäck
Chalmers University of Technology, Gothenburg, Sweden
, - Olof Mogren
Chalmers University of Technology, Gothenburg, Sweden
, - Pierre Nugues
Lund University, Lund, Sweden
, - Thomas Risse
L3S Research Center, Hannover, Germany
International Journal on Digital Libraries, Volume 15, Issue 2-4•April 2015, pp 169-187 • https://doi.org/10.1007/s00799-015-0139-1The concept of culturomics was born out of the availability of massive amounts of textual data and the interest to make sense of cultural and language phenomena over time. Thus far however, culturomics has only made use of, and shown the great potential ...
- 0Citation
MetricsTotal Citations0
- Nina Tahmasebi
- Article
Global graph kernels using geometric embeddings
- Fredrik D. Johansson
Chalmers University of Technology, Gothenburg, Sweden
, - Vinay Jethava
Chalmers University of Technology, Gothenburg, Sweden
, - Devdatt Dubhashi
Chalmers University of Technology, Gothenburg, Sweden
, - Chiranjib Bhattacharyya
Indian Institute of Science, Bangalore, Karnataka, India
ICML'14: Proceedings of the 31st International Conference on International Conference on Machine Learning - Volume 32•June 2014, pp II-694-II-702Applications of machine learning methods increasingly deal with graph structured data through kernels. Most existing graph kernels compare graphs in terms of features defined on small subgraphs such as walks, paths or graphlets, adopting an inherently ...
- 6Citation
MetricsTotal Citations6
- Fredrik D. Johansson
- Doctoral Theses
Global Geometric Graph Kernels and Applications
- Fredrik D. Johansson
Chalmers Tekniska Hogskola (Sweden)
, - Dubhashi, Devdatt
Chalmers Tekniska Hogskola (Sweden)
AbstractThis thesis explores the topics of graph kernels and classification of graphs. Graph kernels have received considerable attention in the last decade, in part because of their value in many practical applications, such as chemo informatics and ...
- 0Citation
MetricsTotal Citations0
- Fredrik D. Johansson
- Article
DLOREAN: Dynamic Location-Aware Reconstruction of Multiway Networks
ICDMW '13: Proceedings of the 2013 IEEE 13th International Conference on Data Mining Workshops•December 2013, pp 1012-1019• https://doi.org/10.1109/ICDMW.2013.57This paper presents a method for learning time-varying higher-order interactions based on node observations, with application to short-term traffic forecasting based on traffic flow sensor measurements. We incorporate domain knowledge into the design of ...
- 0Citation
MetricsTotal Citations0
- research-articlePublished By ACMPublished By ACM
Entity disambiguation in anonymized graphs using graph kernels
- Linus Hermansson
Chalmers University of Technology, Gothenburg, Sweden
, - Tommi Kerola
Chalmers University of Technology, Gothenburg, Sweden
, - Fredrik Johansson
Chalmers University of Technology, Gothenburg, Sweden
, - Vinay Jethava
Chalmers University of Technology, Gothenburg, Sweden
, - Devdatt Dubhashi
Chalmers University of Technology, Gothenburg, Sweden
CIKM '13: Proceedings of the 22nd ACM international conference on Information & Knowledge Management•October 2013, pp 1037-1046• https://doi.org/10.1145/2505515.2505565This paper presents a novel method for entity disambiguation in anonymized graphs using local neighborhood structure. Most existing approaches leverage node information, which might not be available in several contexts due to privacy concerns, or ...
- 33Citation
- 351
- Downloads
MetricsTotal Citations33Total Downloads351Last 12 Months17Last 6 weeks1
- Linus Hermansson
- research-articlePublished By ACMPublished By ACM
Intent-aware temporal query modeling for keyword suggestion
- Fredrik Johansson
Chalmers University of Technology, Gothenburg, Sweden
, - Tobias Färdig
Chalmers University of Technology, Gothenburg, Sweden
, - Vinay Jethava
Chalmers University of Technology, Gothenburg, Sweden
, - Svetoslav Marinov
Findwise AB, Gothenburg, Sweden
PIKM '12: Proceedings of the 5th Ph.D. workshop on Information and knowledge•November 2012, pp 83-86• https://doi.org/10.1145/2389686.2389703This paper presents a data-driven approach for capturing the temporal variations in user search behaviour by modeling the dynamic query relationships using query-log data. The dependence between different queries (in terms of the query words and latent ...
- 1Citation
- 153
- Downloads
MetricsTotal Citations1Total Downloads153
- Fredrik Johansson
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