Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Performance Evaluation Of Clustering Algorithms With Constraints And Parameters

Version 1 : Received: 14 September 2023 / Approved: 14 September 2023 / Online: 15 September 2023 (04:24:59 CEST)

How to cite: PRASAD, M.; T, S. Performance Evaluation Of Clustering Algorithms With Constraints And Parameters. Preprints 2023, 2023091006. https://doi.org/10.20944/preprints202309.1006.v1 PRASAD, M.; T, S. Performance Evaluation Of Clustering Algorithms With Constraints And Parameters. Preprints 2023, 2023091006. https://doi.org/10.20944/preprints202309.1006.v1

Abstract

Data Extraction is a technique is called as clustering which is used to retrieve data either from the files or data bases or both. This paper focuses on the performance evaluation parameters of the clustering algorithms based on different parameters or conditions or constraints and parameters which are used to perform the clustering process to get the clusters on the data sets. Therefore best clusters are retrieved when best parameters or conditions or constraints or preferences which are applied on the data sources for the clustering process. These parameters or conditions or constraints are opted by the user called as user preferences.

Keywords

clustering; machine learning; clustering algorithms; conditions; similarity functions; clustering process; types of learning; data dimensions

Subject

Computer Science and Mathematics, Computer Science

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.