IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i11p2007-d442962.html
   My bibliography  Save this article

Update-Based Machine Learning Classification of Hierarchical Symbols in a Slowly Varying Two-Way Relay Channel

Author

Listed:
  • Jakub Kolář

    (Department of radio engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Technická 2, 160 00 Prague, Czech Republic)

  • Jan Sýkora

    (Department of radio engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Technická 2, 160 00 Prague, Czech Republic)

  • Petr Hron

    (Department of radio engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Technická 2, 160 00 Prague, Czech Republic)

Abstract

This paper presents a stochastic inference problem suited to a classification approach in a time-varying observation model with continuous-valued unknown parameterization. The utilization of an artificial neural network (ANN)-based classifier is considered, and the concept of a training process via the backpropagation algorithm is used. The main objective is the minimization of resources required for the training of the classifier in the parametric observation model. To reach this, it is proposed that the weights of the ANN classifier vary continuously with the change of the observation model parameters. This behavior is then used in an update-based backpropagation algorithm. This proposed idea is demonstrated on several procedures, which re-use previously trained weights as prior information when updating the classifier after a channel phase change. This approach successfully saves resources needed for re-training the ANN. The new approach is verified via a simulation on an example communication system with the two-way relay slowly fading channel.

Suggested Citation

  • Jakub Kolář & Jan Sýkora & Petr Hron, 2020. "Update-Based Machine Learning Classification of Hierarchical Symbols in a Slowly Varying Two-Way Relay Channel," Mathematics, MDPI, vol. 8(11), pages 1-11, November.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:11:p:2007-:d:442962
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/11/2007/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/11/2007/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:8:y:2020:i:11:p:2007-:d:442962. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.