Abstract

Forest fires are the most common cause of deforestation in Indonesia. This condition has a negative impact on the survival of living things. Of course, this has received special attention from various parties. One effort that can be made for prevention is to group these points into areas with the potential for fire using the clustering method. In this research, a comparative study of the clustering algorithm between K-Means and K-Medoids was conducted on hotspot location data obtained from Global Forest Watch (GFW). Besides that, important variables that affect the clustering process are also analyzed in terms of feature importance. There are nine important variables used in the clustering process, of which the Acq_time variable is the most important. The cluster quality of both algorithms is evaluated using the silhouette coefficient (SC). Both algorithms are capable of producing strong clusters. The best number of clusters is six clusters. The K-medoids algorithm is better at grouping data than K-means.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.