Bilgin, Turgay TugayCamurcu, Ali Yilmaz2024-07-122024-07-1220101088-467X10.3233/IDA-2010-04492-s2.0-78650350251https://dx.doi.org/10.3233/IDA-2010-0449https://hdl.handle.net/20.500.12415/8073The goal of this study was to develop an efficient clustering framework for processing high-dimensional datasets with reasonable memory and computing power requirements. Strehl and Ghosh proposed a novel clustering approach and developed a framework which is called "relationship-based clustering framework" [1]. In this study, a preprocessing system has been implemented on top of their approach and it has been integrated into the relationship-based clustering framework. Three different benchmark datasets were used to evaluate its efficiency. The results are presented in various tables and charts, and in addition CLUSION graphs are plotted to enable visual evaluation of cluster quality. It is demonstrated that CPU and memory usage has been substantially decreased compared with Strehl and Ghosh's framework 1, without any noticeable decrease in clustering quality. This fact enables the use of the relationship-based clustering framework for much larger datasets than was heretofore possible, and also increases its scalability with respect to number of dimensions.eninfo:eu-repo/semantics/closedAccessData miningclusteringhigh dimensional datastratified samplingArticle7486Q373114WOS:000284213700008Q4