Less-is-Better Protection (LBP) for memory errors in kNNs classifiers

e-Archivo Repository

Show simple item record

dc.contributor.author Liu, Shanshan
dc.contributor.author Reviriego Vasallo, Pedro
dc.contributor.author Montuschi, Paolo
dc.contributor.author Lombardi, Fabrizio
dc.date.accessioned 2021-05-19T11:52:24Z
dc.date.issued 2021-04
dc.identifier.bibliographicCitation Liu, S., Reviriego, P., Montuschi, P. & Lombardi, F. (2021). Less-is-Better Protection (LBP) for memory errors in kNNs classifiers. Future Generation Computer Systems, vol. 117, pp. 401–411.
dc.identifier.issn 0167-739X
dc.identifier.uri http://hdl.handle.net/10016/32685
dc.description.abstract Classification is used in a wide range of applications to determine the class of a new element; for example, it can be used to determine whether an object is a pedestrian based on images captured by the safety sensors of a vehicle. Classifiers are commonly implemented using electronic components and thus, they are subject to errors in memories and combinational logic. In some cases, classifiers are used in safety critical applications and thus, they must operate reliably. Therefore, there is a need to protect classifiers against errors. The k Nearest Neighbors (kNNs) classifier is a simple, yet powerful algorithm that is widely used; its protection against errors in the neighbor computations has been recently studied. This paper considers the protection of kNNs classifiers against errors in the memory that stores the dataset used to select the neighbors. Initially, the effects of errors in the most common memory configurations (unprotected, Parity-Check protected and Single Error Correction-Double Error Detection (SEC-DED) protected) are assessed. The results show that surprisingly, for most datasets, it is better to leave the memory unprotected than to use error detection codes to discard the element affected by an error in terms of tolerance. This observation is then leveraged to develop Less-is-Better Protection (LBP), a technique that does not require any additional parity bits and achieves better error tolerance than Parity-Check for single bit errors (reducing the classification errors by 59% for the Iris dataset) and SEC-DED codes for double bit errors (reducing the classification errors by 42% for the Iris dataset).
dc.description.sponsorship S. Liu and F. Lombardi would like to acknowledge the support of National Science Foundation, USA grants CCF-1953961 and 1812467, and P. Reviriego would like to acknowledge the support of the ACHILLES project PID2019-104207RB-I00 and the Go2Edge network RED2018-102585-T funded by the Spanish Ministry of Science and Innovation and by the Madrid Community research project TAPIR-CM P2018/TCS-4496.
dc.format.extent 11
dc.language.iso eng
dc.publisher Elsevier
dc.rights © 2020 Elsevier B.V.
dc.rights Atribución-NoComercial-SinDerivadas 3.0 España
dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject.other Classification
dc.subject.other Memories
dc.subject.other Error tolerance
dc.subject.other K nearest neighbors
dc.subject.other Error control codes
dc.title Less-is-Better Protection (LBP) for memory errors in kNNs classifiers
dc.type article
dc.subject.eciencia Informática
dc.identifier.doi https://doi.org/10.1016/j.future.2020.12.015
dc.rights.accessRights embargoedAccess
dc.relation.projectID Gobierno de España. PID2019-104207RB-I00
dc.relation.projectID Gobierno de España. RED2018-102585-T
dc.relation.projectID Comunidad de Madrid. P2018/TCS-4496
dc.type.version acceptedVersion
dc.identifier.publicationfirstpage 401
dc.identifier.publicationlastpage 411
dc.identifier.publicationtitle Future Generation Computer Systems
dc.identifier.publicationvolume 117
dc.identifier.uxxi AR/0000027531
carlosiii.embargo.liftdate 2023-04-01
carlosiii.embargo.terms 2023-04-01
dc.contributor.funder Ministerio de Economía y Competitividad (España)
dc.contributor.funder Comunidad de Madrid
 Find Full text

Files in this item

*Click on file's image for preview. (Embargoed files's preview is not supported)


The following license files are associated with this item:

This item appears in the following Collection(s)

Show simple item record