IDEAS home Printed from https://ideas.repec.org/a/ids/ijnvor/v17y2017i2-3p252-267.html
   My bibliography  Save this article

A novel high-dimensional data dimension reduction algorithm based on ameliorated supportive vector machine

Author

Listed:
  • Weiting Yue
  • Qiaolian Shen

Abstract

Along with the rapid advancement of computer science and data engineering, the complexity and dimension of the data considered are bursting. With the increase of the data dimension, the performance of high dimensional index structure drops rapidly. And these high-dimensional data usually contains many redundant, its essence dimension often is much smaller than the original data, so the high-dimensional data processing question boils down to the related dimension reduction method to cut some less relevant data and reduce its dimension. This paper integrates the ameliorated supportive vector machine to propose the novel high-dimensional data dimension reduction algorithm. Our algorithm optimises the traditional methodologies from the three layers: 1) data cleaning and pre-processing steps are added to enhance the feasibility of the captured data; 2) SVM is modified to hold the feature of higher robustness; 3) application scenarios are built to test the performance. The experimental result proves that the proposed method outperforms compared with other state-of-theart algorithms theoretically and numerically.

Suggested Citation

  • Weiting Yue & Qiaolian Shen, 2017. "A novel high-dimensional data dimension reduction algorithm based on ameliorated supportive vector machine," International Journal of Networking and Virtual Organisations, Inderscience Enterprises Ltd, vol. 17(2/3), pages 252-267.
  • Handle: RePEc:ids:ijnvor:v:17:y:2017:i:2/3:p:252-267
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=85538
    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:ijnvor:v:17:y:2017:i:2/3:p:252-267. 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=22 .

    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.