IDEAS home Printed from https://ideas.repec.org/a/igg/jcini0/v18y2024i1p1-9.html
   My bibliography  Save this article

A Classification Algorithm Based on Improved Locally Linear Embedding

Author

Listed:
  • Hui Wang

    (Shenzhen Institute of Information Technology, China)

  • Tie Cai

    (Shenzhen Institute of Information Technology, China)

  • Dongsheng Cheng

    (Shenzhen Institute of Information Technology, China)

  • Kangshun Li

    (Dongguan City University, China)

  • Ying Zhou

    (Shenzhen Institute of Information Technology, China)

Abstract

The current classification is difficult to overcome the high-dimension classification problems. So, we will design the decreasing dimension method. Locally linear embedding is that the local optimum gradually approaches the global optimum, especially the complicated manifold learning problem used in big data dimensionality reduction needs to find an optimization method to adjust k-nearest neighbors and extract dimensionality. Therefore, we intend to use orthogonal mapping to find the optimization closest neighbors k, and the design is based on the Lebesgue measure constraint processing technology particle swarm locally linear embedding to improve the calculation accuracy of popular learning algorithms. So, we propose classification algorithm based on improved locally linear embedding. The experiment results show that the performance of proposed classification algorithm is best compared with the other algorithm.

Suggested Citation

  • Hui Wang & Tie Cai & Dongsheng Cheng & Kangshun Li & Ying Zhou, 2024. "A Classification Algorithm Based on Improved Locally Linear Embedding," International Journal of Cognitive Informatics and Natural Intelligence (IJCINI), IGI Global, vol. 18(1), pages 1-9, January.
    • Handle: RePEc:igg:jcini0:v:18:y:2024:i:1:p:1-9
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJCINI.344020
    Download Restriction: no
    ---><---

    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:igg:jcini0:v:18:y:2024:i:1:p:1-9. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.