Clustering Incomplete Spectral Data with Robust Methods
Äyrämö, S., Pölönen, I., & Eskelinen, M. (2017). Clustering Incomplete Spectral Data with Robust Methods. In E. Honkavaara, B. Hu, K. Karantzalos, X. Liang, R. Müller, E. Nocerino, I. Pölönen, & P. Rönnholm (Eds.), ISPRS SPEC3D 2017 : Frontiers in Spectral imaging and 3D Technologies for Geospatial Solutions (pp. 13-17). International Society for Photogrammetry and Remote Sensing. International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, Volume XLII-3/W3. https://doi.org/10.5194/isprs-archives-XLII-3-W3-13-2017
Published inInternational Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
Hu, B. |
© Authors 2017. This is an open access article distributed under the terms of a Creative Commons License.
Missing value imputation is a common approach for preprocessing incomplete data sets. In case of data clustering, imputation methods may cause unexpected bias because they may change the underlying structure of the data. In order to avoid prior imputation of missing values the computational operations must be projected on the available data values. In this paper, we apply a robust nan-K-spatmed algorithm to the clustering problem on hyperspectral image data. Robust statistics, such as multivariate medians, are more insensitive to outliers than classical statistics relying on the Gaussian assumptions. They are, however, computationally more intractable due to the lack of closed-form solutions. We will compare robust clustering methods on the bands incomplete data cubes to standard K-means with full data cubes.
PublisherInternational Society for Photogrammetry and Remote Sensing
ConferenceCongress of the International Society for Photogrammetry and Remote Sensing
Is part of publicationISPRS SPEC3D 2017 : Frontiers in Spectral imaging and 3D Technologies for Geospatial Solutions
Publication in research information system
MetadataShow full item record
Except where otherwise noted, this item's license is described as © Authors 2017. This is an open access article distributed under the terms of a Creative Commons License.
Showing items with similar title or keywords.
Hämäläinen, Joonas; Jauhiainen, Susanne; Kärkkäinen, Tommi (MDPI, 2017)Clustering is an unsupervised machine learning and pattern recognition method. In general, in addition to revealing hidden groups of similar observations and clusters, their number needs to be determined. Internal ...
Hämäläinen, Joonas; Alencar, Alisson S. C.; Kärkkäinen, Tommi; Mattos, César L. C.; Souza Júnior, Amauri H.; Gomes, João P. P. (JMLR, 2020)The Minimal Learning Machine (MLM) is a nonlinear, supervised approach based on learning linear mapping between distance matrices computed in input and output data spaces, where distances are calculated using a subset of ...
Application of a Knowledge Discovery Process to Study Instances of Capacitated Vehicle Routing Problems Kärkkäinen, Tommi; Rasku, Jussi (Springer, 2020)Vehicle Routing Problems (VRP) are computationally challenging, constrained optimization problems, which have central role in logistics management. Usually different solvers are being developed and applied for different ...
Kärkkäinen, Tommi; Saarela, Mirka (Springer International Publishing, 2015)Principal component analysis is one of the most popular machine learning and data mining techniques. Having its origins in statistics, principal component analysis is used in numerous applications. However, there seems ...
Student agency analytics : learning analytics as a tool for analysing student agency in higher education Jääskelä, Päivikki; Heilala, Ville; Kärkkäinen, Tommi; Häkkinen, Päivi (Taylor & Francis, 2021)This paper presents a novel approach and a method of learning analytics to study student agency in higher education. Agency is a concept that holistically depicts important constituents of intentional, purposeful, and ...