IDEAS home Printed from https://ideas.repec.org/a/taf/reroxx/v35y2022i1p38-59.html
   My bibliography  Save this article

Machine learning methods based on probabilistic decision tree under the multi-valued preference environment

Author

Listed:
  • Wei Zhou
  • Yi Lu
  • Man Liu
  • Keang Zhang

Abstract

In the classification calculation, the data are sometimes not unique and there are different values and probabilities. Then, it is meaningful to develop the appropriate methods to make classification decision. To solve this issue, this paper proposes the machine learning methods based on a probabilistic decision tree (DT) under the multi-valued preference environment and the probabilistic multi-valued preference environment respectively for the different classification aims. First, this paper develops a data pre-processing method to deal with the weight and quantity matching under the multi-valued preference environment. In this method, we use the least common multiple and weight assignments to balance the probability of each preference. Then, based on the training data, this paper introduces the entropy method to further optimize the DT model under the multi-valued preference environment. After that, the corresponding calculation rules and probability classifications are given. In addition, considering the different numbers and probabilities of the preferences, this paper also uses the entropy method to develop the DT model under the probabilistic multi-valued preference environment. Furthermore, the calculation rules and probability classifications are similarly derived. At last, we demonstrate the feasibility of the machine learning methods and the DT models under the above two preference environments based on the illustrated examples.

Suggested Citation

  • Wei Zhou & Yi Lu & Man Liu & Keang Zhang, 2022. "Machine learning methods based on probabilistic decision tree under the multi-valued preference environment," Economic Research-Ekonomska Istraživanja, Taylor & Francis Journals, vol. 35(1), pages 38-59, December.
  • Handle: RePEc:taf:reroxx:v:35:y:2022:i:1:p:38-59
    DOI: 10.1080/1331677X.2021.1875866
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/1331677X.2021.1875866
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/1331677X.2021.1875866?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    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:taf:reroxx:v:35:y:2022:i:1:p:38-59. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/rero .

    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.