Optimisation of sub-space clustering in a high dimension data using Laplacian graph and machine learning
by P.R. Ambika; A. Bharathi Malakreddy
International Journal of Bioinformatics Research and Applications (IJBRA), Vol. 18, No. 1/2, 2022

Abstract: There are many applications like business analytics, computer vision and medical data analytics, where an unsupervised approach of learning is used for the high-dimension data (HDD) clustering. The problem of the subspace clustering is modelled as a graph problem which has to retain the critical features from the N-dimension while applying a dimension reduction technique to maintain a higher accuracy and lower computational overhead trade-off. Most of the traditional approaches suffer from the efficiency degradation when applied to HDD. An optimisation of sub-space clustering is proposed in this paper for learning models using Laplacian graph on a HDD. The proposed model addresses the curse of dimensionality problem through Laplacian matrix function to minimise the data redundancy within sub-space. The traditional K-nearest neighbour (KNN) algorithm is improvised for the non-linear classification of subspace clustering on HDD clinical importance. The proposed system offers significant increment of 99% of accuracy in clustering operation.

Online publication date: Thu, 07-Apr-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bioinformatics Research and Applications (IJBRA):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com