Dynamic and optimized prototype clustering for relational data based on multiple prototypes

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In artificial intelligence related applications such as bio-medical, bio-informatics, data clustering is an important and complex task with different situations. Prototype based clustering is the reasonable and simplicity to describe and evaluate data which can be treated as non-vertical representation of relational data. Because of Barycentric space present in prototype clustering, maintain and update the structure of the cluster with different data points is still challenging task for different data points in bio-medical relational data. So that in this paper we propose and introduce A Novel Optimized Evidential C-Medoids (NOEC) which is relates to family o prototype based clustering approach for update and proximity of medical relational data. We use Ant Colony Optimization approach to enable the services of similarity with different features for relational update cluster medical data. Perform our approach on different bio-medical related synthetic data sets. Experimental results of proposed approach give better and efficient results with comparison of different parameters in terms of accuracy and time with processing of medical relational data sets.

Cite

CITATION STYLE

APA

Suryanarayana Raju, A. V., & Varma, B. S. (2019). Dynamic and optimized prototype clustering for relational data based on multiple prototypes. International Journal of Recent Technology and Engineering, 8(3), 5630–5634. https://doi.org/10.35940/ijrte.L2795.098319

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free