Literature Database Entry

torres-gomez2023explainability


Jorge Torres Gómez, Pit Hofmann, Frank H. P. Fitzek and Falko Dressler, "Explainability of Neural Networks for Symbol Detection in Molecular Communication Channels," IEEE Transactions on Molecular, Biological and Multi-Scale Communications, vol. 9 (3), pp. 323–328, September 2023.


Abstract

Recent research in molecular communication (MC) suggests machine learning (ML) models for symbol detection, avoiding the unfeasibility of end-to-end channel models. However, ML models are applied as black boxes, lacking proof of correctness of the underlying neural networks (NNs) to detect incoming symbols. This paper studies approaches to the explainability of NNs for symbol detection in MC channels. Based on MC channel models and real testbed measurements, we generate synthesized data and train a neural network (NN) model for the detection of binary transmissions in MC channels. Using the local interpretable model-agnostic explanation (LIME) method and the individual conditional expectation (ICE), the findings in this paper demonstrate the analogy between the trained NN and the standard peak and slope detectors.

Quick access

Original Version DOI (at publishers web site)
Authors' Version PDF (PDF on this web site)
BibTeX BibTeX

Contact

Jorge Torres Gómez
Pit Hofmann
Frank H. P. Fitzek
Falko Dressler

BibTeX reference

@article{torres-gomez2023explainability,
    author = {Torres G{\'{o}}mez, Jorge and Hofmann, Pit and Fitzek, Frank H. P. and Dressler, Falko},
    doi = {10.1109/TMBMC.2023.3297135},
    title = {{Explainability of Neural Networks for Symbol Detection in Molecular Communication Channels}},
    pages = {323--328},
    journal = {IEEE Transactions on Molecular, Biological and Multi-Scale Communications},
    issn = {2332-7804},
    publisher = {IEEE},
    month = {9},
    number = {3},
    volume = {9},
    year = {2023},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.