Alex Alves Freitas
Applied Filters
- Alex Alves Freitas
- AuthorRemove filter
People
Colleagues
- André Carlos Ponce Leon Leon Ferreira De Carvalho (12)
- Fernando E. B. Otero (12)
- Heitor Silvério Lopes (11)
- Rodrigo C. Barros (11)
- Gisele Lobo Pappa (10)
- Alexandre Plastino (9)
- Colin G Johnson (9)
- Márcio Porto Basgalupp (8)
- Deborah Ribeiro Carvalho (7)
- Khalid M Salama (6)
- Andrew Secker (5)
- Júlio César Nievola (5)
- Nicholas Paul Holden (5)
- Darren R Flower (4)
- Denisefukumi Tsunoda (4)
- Elon Santos Correa (4)
- Ricardo Cerri (4)
- Roberto Teixeira Alves (4)
- André Carlos Ponce Leon Ferreira Carvalho (3)
Roles
Publication
Journal/Magazine Names
- Intelligent Data Analysis (7)
- IEEE/ACM Transactions on Computational Biology and Bioinformatics (5)
- ACM SIGKDD Explorations Newsletter (4)
- Bioinformatics (4)
- IEEE Transactions on Evolutionary Computation (4)
- Applied Soft Computing (3)
- Artificial Intelligence Review (3)
- Information Sciences: an International Journal (3)
- Evolutionary Computation (2)
- Genetic Programming and Evolvable Machines (2)
- IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews (2)
- Journal of Artificial Evolution and Applications (2)
- Soft Computing - A Fusion of Foundations, Methodologies and Applications (2)
- Artificial Intelligence in Medicine (1)
- Computational Intelligence (1)
- Data Mining and Knowledge Discovery (1)
- Expert Systems with Applications: An International Journal (1)
Proceedings/Book Names
- GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computation (4)
- GECCO'01: Proceedings of the 3rd Annual Conference on Genetic and Evolutionary Computation (4)
- GECCO'02: Proceedings of the 4th Annual Conference on Genetic and Evolutionary Computation (4)
- SBIA '02: Proceedings of the 16th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence (3)
- ANTS'12: Proceedings of the 8th international conference on Swarm Intelligence (2)
- BSB '08: Proceedings of the 3rd Brazilian symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology (2)
- EuroGP'03: Proceedings of the 6th European conference on Genetic programming (2)
- EvoBIO'08: Proceedings of the 6th European conference on Evolutionary computation, machine learning and data mining in bioinformatics (2)
- GECCO '07: Proceedings of the 9th annual conference companion on Genetic and evolutionary computation (2)
- GECCO'00: Proceedings of the 2nd Annual Conference on Genetic and Evolutionary Computation (2)
- PKDD '98: Proceedings of the Second European Symposium on Principles of Data Mining and Knowledge Discovery (2)
- Artificial Evolution (1)
- Artificial Intelligence XXXVI (1)
- GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation (1)
- GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computation (1)
- Intelligent Systems (1)
- Machine Learning and Knowledge Discovery in Databases (1)
- Machine Learning, Optimization, and Data Science (1)
- SAC '09: Proceedings of the 2009 ACM symposium on Applied Computing (1)
- SAC '10: Proceedings of the 2010 ACM Symposium on Applied Computing (1)
Publisher
- Springer-Verlag (42)
- Association for Computing Machinery (28)
- Morgan Kaufmann Publishers Inc. (11)
- IEEE Press (9)
- IOS Press (8)
- Kluwer Academic Publishers (8)
- IEEE Computer Society (7)
- IEEE Computer Society Press (5)
- Oxford University Press, Inc. (5)
- Elsevier Science Publishers B. V. (4)
- Elsevier Science Inc. (3)
- Hindawi Limited (2)
- Inderscience Publishers (2)
- MIT Press (2)
- Blackwell Publishers, Inc. (1)
- Elsevier Science Publishers Ltd. (1)
- John Wiley & Sons, Inc. (1)
- Pergamon Press, Inc. (1)
- Springer Publishing Company, Incorporated (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
A Genetic Algorithm-based Auto-ML System for Survival Analysis
- Tossapol Pomsuwan
School of Computing, University of Kent, Canterbury, Kent, United Kingdom
Thailand Development Research Institute Foundation (TDRI), Bangkok, Thailand
, - Alex A. Freitas
School of Computing, University of Kent, Canterbury, Kent, United Kingdom
SAC '24: Proceedings of the 39th ACM/SIGAPP Symposium on Applied Computing•April 2024, pp 370-377• https://doi.org/10.1145/3605098.3635954Survival analysis methods aim to develop a model predicting the time passed until the occurrence of an event (e.g. death) for each subject. This requires coping with censored values of the target variable (time until the event), i.e., for some subjects, ...
- 0Citation
- 36
- Downloads
MetricsTotal Citations0Total Downloads36Last 12 Months36Last 6 weeks2
- Tossapol Pomsuwan
- Article
Evaluating a New Genetic Algorithm for Automated Machine Learning in Positive-Unlabelled Learning
- Jack D. Saunders
School of Computing, University of Kent, CT2 7NF, Canterbury, UK
, - Alex A. Freitas
School of Computing, University of Kent, CT2 7NF, Canterbury, UK
AbstractPositive-Unlabelled (PU) learning is a growing area of machine learning that aims to learn classifiers from data consisting of a set of labelled positive instances and a set of unlabelled instances, where the latter can be either positive or ...
- 0Citation
MetricsTotal Citations0
- Jack D. Saunders
- articlePublished By ACMPublished By ACM
Evaluating the Predictive Performance of Positive- Unlabelled Classifiers: a brief critical review and practical recommendations for improvement
- Jack D. Saunders
University of Kent, Canterbury, United Kingdom
, - Alex A. Freitas
University of Kent, Canterbury, United Kingdom
ACM SIGKDD Explorations Newsletter, Volume 24, Issue 2•December 2022, pp 5-11 • https://doi.org/10.1145/3575637.3575642Positive-Unlabelled (PU) learning is a growing area of machine learning that aims to learn classifiers from data consisting of labelled positive and unlabelled instances. Whilst much work has been done proposing methods for PU learning, little has been ...
- 3Citation
- 81
- Downloads
MetricsTotal Citations3Total Downloads81Last 12 Months36Last 6 weeks7
- Jack D. Saunders
- research-article
Interpretable Ensembles of Classifiers for Uncertain Data With Bioinformatics Applications
- Marcelo Rodrigues de Holanda Maia
Instituto de Computação, Universidade Federal Fluminense, Niterói, Brazil
, - Alexandre Plastino
Instituto de Computação, Universidade Federal Fluminense, Niterói, Brazil
, - Alex Freitas
School of Computing, University of Kent, Canterbury, U.K.
, - João Pedro de Magalhães
Genomics of Ageing and Rejuvenation Lab, University of Birmingham, Birmingham, U.K.
IEEE/ACM Transactions on Computational Biology and Bioinformatics, Volume 20, Issue 3•May-June 2023, pp 1829-1841 • https://doi.org/10.1109/TCBB.2022.3218588Data uncertainty remains a challenging issue in many applications, but few classification algorithms can effectively cope with it. An ensemble approach for uncertain categorical features has recently been proposed, achieving promising results. It consists ...
- 0Citation
- 4
- Downloads
MetricsTotal Citations0Total Downloads4Last 12 Months4
- Marcelo Rodrigues de Holanda Maia
- posterPublished By ACMPublished By ACM
GA-auto-PU: a genetic algorithm-based automated machine learning system for positive-unlabeled learning
- Jack D. Saunders
University of Kent, Canterbury, Kent, United Kingdom
, - Alex A. Freitas
University of Kent, Canterbury, Kent, United Kingdom
GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference Companion•July 2022, pp 288-291• https://doi.org/10.1145/3520304.3528932Positive-Unlabeled (PU) learning is a growing field of machine learning that now consists of numerous algorithms; the number is now so large that considering an extensive manual search to select the best algorithm for a given task is impractical. As such,...
- 2Citation
- 74
- Downloads
MetricsTotal Citations2Total Downloads74Last 12 Months22Last 6 weeks2
- Jack D. Saunders
- posterPublished By ACMPublished By ACM
Nested trees for longitudinal classification
- Sergey Ovchinnik
University of Kent, Canterbury, UK
, - Fernando Otero
University of Kent, Canterbury, UK
, - Alex A. Freitas
University of Kent, Canterbury, UK
SAC '22: Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing•April 2022, pp 441-444• https://doi.org/10.1145/3477314.3507240Longitudinal datasets contain repeated measurements of the same variables at different points in time. Longitudinal data mining algorithms aim to utilize such datasets to extract interesting knowledge and produce useful models. Many existing ...
- 1Citation
- 66
- Downloads
MetricsTotal Citations1Total Downloads66Last 12 Months17Last 6 weeks3
- Sergey Ovchinnik
- research-article
Prioritizing positive feature values: a new hierarchical feature selection method
- Pablo Nascimento da Silva
Institute of Computing, Fluminense Federal University (UFF), Niterói, RJ, Brazil
, - Alexandre Plastino
Institute of Computing, Fluminense Federal University (UFF), Niterói, RJ, Brazil
, - Alex A. Freitas
School of Computing, University of Kent, Canterbury, UK
Applied Intelligence, Volume 50, Issue 12•Dec 2020, pp 4412-4433 • https://doi.org/10.1007/s10489-020-01782-5AbstractIn this work we address the problem of feature selection for the classification task in hierarchical and sparse feature spaces, which characterize many real-world applications nowadays. A binary feature space is deemed hierarchical when its binary ...
- 1Citation
MetricsTotal Citations1
- Pablo Nascimento da Silva
- Article
An Evolutionary Algorithm for Learning Interpretable Ensembles of Classifiers
- Henry E. L. Cagnini
School of Technology, PUCRS, Porto Alegre, Brazil
, - Alex A. Freitas
Computing School, University of Kent, Canterbury, UK
, - Rodrigo C. Barros
School of Technology, PUCRS, Porto Alegre, Brazil
AbstractEnsembles of classifiers are a very popular type of method for performing classification, due to their usually high predictive accuracy. However, ensembles have two drawbacks. First, ensembles are usually considered a ‘black box’, non-...
- 1Citation
MetricsTotal Citations1
- Henry E. L. Cagnini
- research-articlePublished By ACMPublished By ACM
A robust experimental evaluation of automated multi-label classification methods
- Alex G. C. de Sá
Universidade Federal de Minas Gerais, Belo Horizonte, MG, Brazil
, - Cristiano G. Pimenta
Universidade Federal de Minas Gerais, Belo Horizonte, MG, Brazil
, - Gisele L. Pappa
Universidade Federal de Minas Gerais, Belo Horizonte, MG, Brazil
, - Alex A. Freitas
University of Kent, Canterbury, Kent, United Kingdom
GECCO '20: Proceedings of the 2020 Genetic and Evolutionary Computation Conference•June 2020, pp 175-183• https://doi.org/10.1145/3377930.3390231Automated Machine Learning (AutoML) has emerged to deal with the selection and configuration of algorithms for a given learning task. With the progression of AutoML, several effective methods were introduced, especially for traditional classification ...
- 6Citation
- 111
- Downloads
MetricsTotal Citations6Total Downloads111Last 12 Months10- 1
Supplementary Materialp175-de_sa-suppl.pdf
- Alex G. C. de Sá
- research-article
A Novel Feature Selection Method for Uncertain Features: An Application to the Prediction of Pro-/Anti-Longevity Genes
- Pablo Nascimento da Silva
Institute of Computing, Universidade Federal Fluminense, Niteroi - RJ, Brazil
, - Alexandre Plastino
Institute of Computing, Universidade Federal Fluminense, Niteroi - RJ, Brazil
, - Fabio Fabris
School of Computing, University of Kent, Canterbury, United Kingdom
, - Alex A. Freitas
School of Computing, University of Kent, Canterbury, United Kingdom
IEEE/ACM Transactions on Computational Biology and Bioinformatics, Volume 18, Issue 6•Nov.-Dec. 2021, pp 2230-2238 • https://doi.org/10.1109/TCBB.2020.2988450Understanding the ageing process is a very challenging problem for biologists. To help in this task, there has been a growing use of classification methods (from machine learning) to learn models that predict whether a gene influences the process of ...
- 1Citation
- 9
- Downloads
MetricsTotal Citations1Total Downloads9Last 12 Months3
- Pablo Nascimento da Silva
- Article
Monotonicity Detection and Enforcement in Longitudinal Classification
- Sergey Ovchinnik
School of Computing, University of Kent, Canterbury, UK
, - Fernando E. B. Otero
School of Computing, University of Kent, Canterbury, UK
, - Alex A. Freitas
School of Computing, University of Kent, Canterbury, UK
AbstractLongitudinal datasets contain repeated measurements of the same variables at different points in time, which can be used by researchers to discover useful knowledge based on the changes of the data over time. Monotonic relations often occur in ...
- 1Citation
MetricsTotal Citations1
- Sergey Ovchinnik
- Article
Analysing the Overfit of the Auto-sklearn Automated Machine Learning Tool
- Fabio Fabris
School of Computing, University of Kent, CT2 7NF, Canterbury, Kent, UK
, - Alex A. Freitas
School of Computing, University of Kent, CT2 7NF, Canterbury, Kent, UK
Machine Learning, Optimization, and Data Science•September 2019, pp 508-520• https://doi.org/10.1007/978-3-030-37599-7_42AbstractWith the ever-increasing number of pre-processing and classification algorithms, manually selecting the best algorithm and their best hyper-parameter settings (i.e. the best classification workflow) is a daunting task. Automated Machine Learning (...
- 2Citation
MetricsTotal Citations2
- Fabio Fabris
- article
An empirical evaluation of hierarchical feature selection methods for classification in bioinformatics datasets with gene ontology-based features
- Cen Wan
Department of Computer Science, University College London, London, UK and School of Computing, University of Kent, Canterbury, UK
, - Alex A. Freitas
School of Computing, University of Kent, Canterbury, UK
Artificial Intelligence Review, Volume 50, Issue 2•August 2018, pp 201-240 • https://doi.org/10.1007/s10462-017-9541-yHierarchical feature selection is a new research area in machine learning/data mining, which consists of performing feature selection by exploiting dependency relationships among hierarchically structured features. This paper evaluates four hierarchical ...
- 3Citation
MetricsTotal Citations3
- Cen Wan
- research-article
A Survey of Genetic Algorithms for Multi-Label Classification
- Eduardo Corrêa Gonçalves
Escola Nacional de Ciências Estatísticas, Inst. Brasileiro de Geografia e Estatística, Rio de Janeiro, Brazil
, - Alex A. Freitas
University of Kent, School of Computing, Canterbury, Kent, United Kingdom
, - Alexandre Plastino
Universidade Federal Fluminense, Instituto de Computação, Niterói, Brazil
2018 IEEE Congress on Evolutionary Computation (CEC)•July 2018, pp 1-8• https://doi.org/10.1109/CEC.2018.8477927In recent years, multi-label classification (MLC) has become an emerging research topic in big data analytics and machine learning. In this problem, each object of a dataset may belong to multiple class labels and the goal is to learn a classification ...
- 0Citation
MetricsTotal Citations0
- Eduardo Corrêa Gonçalves
- research-article
Multi-objective genetic algorithms in the study of the genetic codes adaptability
- Lariza Laura de Oliveira
Center of Health Informatics and Information, School of Medicine of Ribeiro Preto, University of So Paulo, Ribeiro Preto, Brazil
, - Alex A. Freitas
School of Computing, University of Kent, Canterbury, Kent, UK
, - Renato Tins
Department of Computing and Mathematics, University of So Paulo, Ribeiro Preto, Brazil
Information Sciences: an International Journal, Volume 425, Issue C•January 2018, pp 48-61 • https://doi.org/10.1016/j.ins.2017.10.022Using a robustness measure based on values of the polar requirement of amino acids, Freeland and Hurst (1998) showed that less than one in one million random hypothetical codes are better than the standard genetic code. In this paper, instead of ...
- 2Citation
MetricsTotal Citations2
- Lariza Laura de Oliveira
- research-article
An extensive evaluation of seven machine learning methods for rainfall prediction in weather derivatives
- Sam Cramer
School of Computing, University of Kent, Canterbury, CT2 7NZ UK
, - Michael Kampouridis
School of Computing, University of Kent, Canterbury, CT2 7NZ UK
, - Alex A. Freitas
School of Computing, University of Kent, Canterbury, CT2 7NZ UK
, - Antonis K. Alexandridis
Kent Business School, University of Kent, Canterbury, CT2 7NZ UK
Expert Systems with Applications: An International Journal, Volume 85, Issue C•November 2017, pp 169-181 • https://doi.org/10.1016/j.eswa.2017.05.029An extensive evaluation of machine learning methods.Predictive performance not affected between Europe and the USA.Some linear relationships exists between error and climate.Machine learning methods outperform state-of-the-art. Regression problems ...
- 13Citation
MetricsTotal Citations13
- Sam Cramer
- research-articlePublished By ACMPublished By ACM
Towards a method for automatically selecting and configuring multi-label classification algorithms
- Alex G. C. de Sá
Universidade Federal de Minas Gerais, Belo Horizonte, MG, Brazil
, - Gisele L. Pappa
Universidade Federal de Minas Gerais, Belo Horizonte, MG, Brazil
, - Alex A. Freitas
University of Kent, Canterbury, Kent, United Kingdom
GECCO '17: Proceedings of the Genetic and Evolutionary Computation Conference Companion•July 2017, pp 1125-1132• https://doi.org/10.1145/3067695.3082053Given a new dataset for classification in Machine Learning (ML), finding the best classification algorithm and the best configuration of its (hyper)-parameters for that particular dataset is an open issue. The Automatic ML (Auto-ML) area has emerged to ...
- 14Citation
- 214
- Downloads
MetricsTotal Citations14Total Downloads214Last 12 Months10
- Alex G. C. de Sá
- research-article
Instance-based classification with Ant Colony Optimization
- Khalid M. Salama
School of Computing, University of Kent, Canterbury, UK
, - Ashraf M. Abdelbar
Department of Mathematics & Computer Science, Brandon University, Brandon, MB, Canada
, - Ayah M. Helal
School of Computing, University of Kent, Chatham Maritime, UK
, - Alex A. Freitas
School of Computing, University of Kent, Canterbury, UK
Instance-based learning (IBL) methods predict the class label of a new instance based directly on the distance between the new unlabeled instance and each labeled instance in the training set, without constructing a classification model in the ...
- 1Citation
MetricsTotal Citations1
- Khalid M. Salama
- research-article
An Extensive Empirical Comparison of Probabilistic Hierarchical Classifiers in Datasets of Ageing-Related Genes
- Fabio Fabris
School of Computing, University of Kent, Canterbury, Kent, United Kingdom
, - Alex A. Freitas
School of Computing, University of Kent, Canterbury, Kent, United Kingdom
, - Jennifer M. A. Tullet
School of BioSciences, University of Kent, Canterbury, Kent, United Kingdom
IEEE/ACM Transactions on Computational Biology and Bioinformatics, Volume 13, Issue 6•November 2016, pp 1045-1058 • https://doi.org/10.1109/TCBB.2015.2505288This study comprehensively evaluates the performance of five types of probabilistic hierarchical classification methods used for predicting Gene Ontology GO terms related to ageing. Of those tested, a new hybrid of a Local Hierarchical Classifier LHC ...
- 2Citation
- 37
- Downloads
MetricsTotal Citations2Total Downloads37Last 12 Months3Last 6 weeks2
- Fabio Fabris
- article
Improving the interpretability of classification rules discovered by an ant colony algorithm: Extended results
Evolutionary Computation, Volume 24, Issue 3•Fall 2016, pp 385-409 • https://doi.org/10.1162/EVCO_a_00155Most ant colony optimization ACO algorithms for inducing classification rules use a ACO-based procedure to create a rule in a one-at-a-time fashion. An improved search strategy has been proposed in the cAnt-Miner<inline-formula><inline-graphic xlink="...
- 6Citation
- 69
- Downloads
MetricsTotal Citations6Total Downloads69Last 12 Months1
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