Simplicity and Explainability in Algorithms

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (15 November 2022) | Viewed by 378

Special Issue Editors


E-Mail Website
Guest Editor
Department of Mathematics and Computer Science, University of Catania, I-95125 Catania, Italy
Interests: algorithms on strings; algorithms on graphs; bioinformatics
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Department of Cognitive Science, University of Messina, 1-98122 Messina, Italy
Interests: cognitive science; philosophy of science; natural language processing; text processing
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

This Special Issue is devoted to research on algorithmics, in all areas of computer science, but with specific attention to the more philosophical aspects related to their simplicity, elegance, and explainability, with respect not only to their design but also to their analysis.

Simplicity in design and presentation is a fundamental aspect of the success of an algorithm or computational model. Indeed, simpler algorithms, which consequently are easily understood and explained, allow a better understanding of the problem addressed, are easier to implement, and for this reason are more likely to be used by professionals and enjoy their trust.

However, the aspect of explainability, closely related to simplicity, is a multifaceted topic that in recent years has concerned the field of algorithms implemented in neural network models. In this context, explainability refers not only to the possibility of interpreting the decisions a model produces, but also to the possibility of accounting for the entire process and intention surrounding the model. In other words, we refer to the cogency of the data being used, the mathematical adequacy with respect to the task at hand, and the validity and determinability of the goal of the system itself.

Prof. Dr. Simone Faro
Dr. Arianna Pavone
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • algorithmic simplicity, explainability, and elegance
  • algorithm design and implementation
  • neural network moderation
  • simplified algorithmic analysis

Published Papers

There is no accepted submissions to this special issue at this moment.
Back to TopTop