IDEAS home Printed from https://ideas.repec.org/a/ids/injdan/v4y2012i2p115-133.html
   My bibliography  Save this article

A machine learning algorithm for classification under extremely scarce information

Author

Listed:
  • Lev V. Utkin
  • Yulia A. Zhuk

Abstract

When it is difficult to get learning data during the training time, we have to classify objects by having extremely small information about their feature. It is assumed in the paper that only some average or mean value of every feature and the lower and upper bounds of a set of its values are known. The main idea for constructing new classification models taking into account this information is to form a set of probability distributions bounded by some lower and upper probability distribution functions (a p-box). A discriminant function is derived in order to maximise the risk measure over the set of distributions and to minimise it over a set of classification parameters. The algorithm for classification is reduced to a parametric linear programming problem.

Suggested Citation

  • Lev V. Utkin & Yulia A. Zhuk, 2012. "A machine learning algorithm for classification under extremely scarce information," International Journal of Data Analysis Techniques and Strategies, Inderscience Enterprises Ltd, vol. 4(2), pages 115-133.
    • Handle: RePEc:ids:injdan:v:4:y:2012:i:2:p:115-133
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=46788
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:injdan:v:4:y:2012:i:2:p:115-133. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=282 .

    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.