| 000 | 01826nam a22001697a 4500 | ||
|---|---|---|---|
| 003 | FT8918 | ||
| 005 | 20260107163511.0 | ||
| 050 | _aQA76.9 A43 T36 2025 | ||
| 100 | 1 | _a Tan, Kim Emerson M.; Tiangco, Arwin B. | |
| 245 | _aEnhanced macqueen’s algorithm for identifying diverse crime patterns in the City of Manila | ||
| 264 | 1 | _cc2025 | |
| 336 |
_2text _atext _btext |
||
| 337 |
_2unmediated _aunmediated _bunmediated |
||
| 338 |
_2volume _avolume _bvolume |
||
| 505 | _aABSTRACT: MacQueen’s algorithm is a variant of the k-means algorithm used to determine clusters. However, the algorithm has its limitations that impact its necessary and efficiency, resulting in suboptimal clustering. This study aimed to enhance MacQueen’s algorithm for analyzing diverse crime patterns in the City of Manila by addressing these limitations using Isolation Forest for outliers, Adaptive K-Means++ for algorithm initialization, and Gap Statistics to determine the optimal number of clusters. Isolation Forest was employed to detect and remove outliers from the dataset, as they significantly impact clustering results. Adaptive K-means++ improved the initialization process by optimizing the placement of initial centroids, reducing the sensitivity of the algorithm to poor starting conditions. Gap Statistics was utilized to determine the optimal number of clusters, greatly enhancing the algorithm’s accuracy. The enhanced MacQueen’s algorithm demonstrated a significant overall improvement in clustering performance, resulting in more accurate and distinct clusters. The proposed enhancements effectively addressed the limitations of the traditional MacQueen’s algorithm, improving its accuracy and efficiency. This makes the enhanced algorithm highly applicable to real-world problems involving clustering. | ||
| 942 |
_2lcc _cMS |
||
| 999 |
_c37406 _d37406 |
||