A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://www.ijrte.org/wp-content/uploads/papers/v8i2/B1022078219.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="Blue Eyes Intelligence Engineering and Sciences Engineering and Sciences Publication - BEIESP">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3sfifsouvjgadp4gfj54u3z2ku" style="color: black;">International journal of recent technology and engineering</a>
Clustering has been used for data interpretation when dealing with large database in the fields of medicines, business, engineering etc. for the recent years. Its existence paved way on the development of data mining techniques like CLARANS (Clustering Large Applications based on Randomized Search) Algorithm. It is the most efficient k-medoids technique that uses randomized strategy to identify the best medoids in a large dataset. Likewise, it surpasses the clustering performance of both PAM<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.35940/ijrte.b1022.078219">doi:10.35940/ijrte.b1022.078219</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7hejlbmpgzgptohhfbpagpazaa">fatcat:7hejlbmpgzgptohhfbpagpazaa</a> </span>
more »... rtitioning Around Medoids) and CLARA (Clustering Large Applications) in terms of time. This paper addresses the task of integrating Slim-tree method to CLARANS for the development of the proposed Slim-tree Clustering Large Applications based on Randomized Search (STCLARanS) Algorithm and an experimental evaluation was prepared using synthetic and real datasets for the comparison of the quality of the clustered output of the CLARANS and the proposed STCLARanS algorithms. The Slim-tree method is used for pre-clustering of the objects in the dataset in identifying the objects in the middle level as the sample objects used to start the clustering process. The proposed Algorithm assumes that with the new sampling strategy to draw the initial cluster centers to start the clustering process may yield to better quality of the clustered outputs as compared to the clustered output of the CLARANS algorithm. The quality of the clustered output is measured on the accumulated distances of the objects to their cluster centers.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200216223310/https://www.ijrte.org/wp-content/uploads/papers/v8i2/B1022078219.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7b/40/7b4087dfc56310501f90914f02ebf3e1640d2ea4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.35940/ijrte.b1022.078219"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>