@InProceedings{Mills_DMESS2018_20181117, author = {Richard Tran Mills and Vamsi Sripathi and Jitendra Kumar and Sarat Sreepathi and Forrest M. Hoffman and William W. Hargrove}, title = {Parallel $k$-means Clustering of Geospatial Data Sets Using {M}anycore {CPU} Architectures}, booktitle = {Proceedings of the 2018 {IEEE} International Conference on Data Mining Workshops ({ICDMW} 2018)}, organization = {Institute of Electrical and Electronics Engineers (IEEE)}, publisher = {Conference Publishing Services (CPS)}, doi = {10.1109/ICDMW.2018.00118}, day = 17, month = nov, year = 2018, abstract = {The increasing availability of high-resolution geospatiotemporal data sets from sources such as observatory networks, remote sensing platforms, and computational Earth system models has opened new possibilities for knowledge discovery and mining of weather, climate, ecological, and other geoscientific data sets fused from disparate sources. Many of the standard tools used on individual workstations are impractical for the analysis and synthesis of data sets of this size; however, new algorithmic approaches that can effectively utilize the complex memory hierarchies and the extremely high levels of parallelism available in state-of-the-art high-performance computing platforms can enable such analysis. Here, we describe \textit{pKluster}, an open-source tool we have developed for accelerated $k$-means clustering of geospatial and geospatiotemporal data, and discuss algorithmic modifications and code optimizations we have made to enable it to effectively use parallel machines based on novel CPU architectures---such as the Intel Knights Landing Xeon Phi and Skylake Xeon processors---with many cores and hardware threads, and employing significant single instruction, multiple data (SIMD) parallelism. We outline some applications of the code in ecology and climate science contexts and present a detailed discussion of the performance of the code for one such application, LiDAR-derived vertical vegetation structure classification.} }