Scalable unsupervised feature selection via matrix learning and bipartite graph theory

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Negin Daneshpour Negin Daneshpour; Daneshpour Negin

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF IRANIAN ASSOCIATION OF ELECTRICAL AND ELECTRONICS ENGINEERS Year:2023 | Volume:20 | Issue:3 Page(s): 135-148

Download Full-Text

Persian Verion

View:

Download:

Cites:

Information Journal Paper

Title

Scalable unsupervised feature selection via matrix learning and bipartite graph theory

Author(s)

Negin Daneshpour Negin Daneshpour | Daneshpour Negin | Issue Writer Certificate

Keywords

Data mining

Preprocessing

Feature selection

Unsupervised method

Graph

Abstract

With the rapid spread of technology, large volumes of unlabeled data with large dimensions needed to be processed. To reduce the dimensions, unsupervised Feature selection is known as an important pre-step before machine learning tasks. In this paper, an unsupervised Feature selection method is proposed. The method works dynamically and is scalable based on matrix Graphs and weighted matrices. To improve the performance of this method, instead of using the Lagrange function to construct a weight matrix, a bipartite Graph theory is applied. Feature selection is done on the matrix Graph. This Graph is constructed using k nearest neighbors, which makes the method more robust to noise. The global structure of the original data is also preserved by constructing a Reconstruction Weight Matrix with low-rank constraint. In addition, the feature score, which explicitly reflects the strength of the features, is modeled using the Frobenius norm function. The proposed method is compared with similar methods in three criteria of classification accuracy, parameter sensitivity and complexity. Experiments show that the classification accuracy of the method presented in this paper has improved by an average of 2.83%. Its complexity has also been reduced to max{O(n2d),O(nm)}, where n is the number of samples, d is the number of features and m is the number of anchor points.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans