We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Mathematics/A novel approach of unsupervised feature selection using iterative shrinking and expansion algorithm
PeriodicalsMathematics

A novel approach of unsupervised feature selection using iterative shrinking and expansion algorithm

Checking your access to this record.

Abstract & Overview

An major constraint in the realm of feature selection is that users choose the ideal number of characteristics that must be picked. In this article, an effort is made to automate the process of determining a suitable value for the appropriate the quantity of characteristics that must be chosen for better recognition tasks. To estimate the ideal amount of features that should be maintained for properly describing the data, we use the dense subgraph discovery approach for this goal. Notably, the existing methods uses a similar kind of approach called the dense subgraph finding. But the earlier approach obtains a single dense subgraph, while the task of dense subgraphs finding obtains a number of dense subgraphs that are important for learning the internal structure of any network. Thus, dense subgraphs finding is likely to be adopted as a natural choice for realizing the complex relations among the nodes of massive real-life networks, such as biological networks, social networks.

Cite this record

Dankan Gowda V, Avinash Sharma, S. Kumaraswamy, Parismita Sarma, Naziya Hussain, Santosh Kumar Dixit, et al. (2023). A novel approach of unsupervised feature selection using iterative shrinking and expansion algorithm. Journal of Interdisciplinary Mathematics, 26(3), 519–530. https://doi.org/10.47974/jim-1678

Copy in another style

V, D. G., Sharma, A., Kumaraswamy, S., Sarma, P., Hussain, N., Dixit, S. K., & Gupta, A. K. (2023). A novel approach of unsupervised feature selection using iterative shrinking and expansion algorithm. Journal of Interdisciplinary Mathematics, 26(3), 519–530. https://doi.org/10.47974/jim-1678
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.