IDEAS home Printed from https://ideas.repec.org/a/wsi/ijitdm/v10y2011i06ns0219622011004671.html
   My bibliography  Save this article

Unsupervised Feature Selection Using Incremental Least Squares

Author

Listed:
  • RONG LIU

    (Center for the Environmental Implications of Nanotechnology and Chemical and Biomolecular Engineering Department, University of California, Los Angeles, CA 90095, USA)

  • ROBERT RALLO

    (Center for the Environmental Implications of Nanotechnology and Chemical and Biomolecular Engineering Department, University of California, Los Angeles, CA 90095, USA;
    Departament d'Enginyeria Informatica i Matematiques, Universitat Rovira i Virgili, Av. Paisos Catalans, 26. 43007 Tarrragona, Catalunya, Spain)

  • YORAM COHEN

    (Center for the Environmental Implications of Nanotechnology and Chemical and Biomolecular Engineering Department, University of California, Los Angeles, CA 90095, USA)

Abstract

An unsupervised feature selection method is proposed for analysis of datasets of high dimensionality. The least square error (LSE) of approximating the complete dataset via a reduced feature subset is proposed as the quality measure for feature selection. Guided by the minimization of the LSE, a kernel least squares forward selection algorithm (KLS-FS) is developed that is capable of both linear and non-linear feature selection. An incremental LSE computation is designed to accelerate the selection process and, therefore, enhances the scalability of KLS-FS to high-dimensional datasets. The superiority of the proposed feature selection algorithm, in terms of keeping principal data structures, learning performances in classification and clustering applications, and robustness, is demonstrated using various real-life datasets of different sizes and dimensions.

Suggested Citation

  • Rong Liu & Robert Rallo & Yoram Cohen, 2011. "Unsupervised Feature Selection Using Incremental Least Squares," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 10(06), pages 967-987.
    • Handle: RePEc:wsi:ijitdm:v:10:y:2011:i:06:n:s0219622011004671
    DOI: 10.1142/S0219622011004671
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219622011004671
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0219622011004671?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.

    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:wsi:ijitdm:v:10:y:2011:i:06:n:s0219622011004671. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijitdm/ijitdm.shtml .

    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.