David P. Hofmeyr
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
David P. Hofmeyr has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Nicos G. Pavlidis
Lancaster University, Lancaster, United Kingdom
5 shared publications - Idris A. Eckley
Department of Mathematics and Statistics, Lancaster University, Lancaster, United Kingdom
2 shared publications - Stephan van der Westhuizen
Stellenbosch University
2 shared publications - Francois Kamper
Swiss Data Science Center
1 shared publication - Gerard B. M. Heuvelink
ISRIC—World Soil Information Wageningen The Netherlands
1 shared publication Gerard B.M. Heuvelink
1 shared publication
Latest Publications
- 12 March 2023
- Published by Elsevier in Pattern Recognition
- Vol. 139
Incremental estimation of low-density separating hyperplanes for clustering large data sets
- 12 March 2023
- Published by Elsevier in Pattern Recognition
- Vol. 139
Incremental estimation of low-density separating hyperplanes for clustering large data sets
- Top Cited PapersOpen Access
Multivariate random forest for digital soil mapping
- Open Access
- 1 March 2022
- Published by Elsevier in Spatial Statistics
- Vol. 47
Measurement error-filtered machine learning in digital soil mapping
- 1 March 2022
- Published by Elsevier in Spatial Statistics
- Vol. 47
Open AccessMeasurement error-filtered machine learning in digital soil mapping
- 4 January 2022
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 17 (1) , 43-73
Optimal projections for Gaussian discriminants
- 4 January 2022
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 17 (1) , 43-73
Optimal projections for Gaussian discriminants
- Open Access
- 1 January 2022
- Published by Foundation for Open Access Statistic in Journal of Statistical Software
- Vol. 101 (3) , 1-33
Fast Kernel Smoothing in R with Applications to Projection Pursuit
This paper introduces the R package FKSUM, which offers fast and exact evaluation of univariate kernel smoothers. The main kernel computations are implemented in C++, and are wrapped in simple, intuitive and versatile R functions. The fast kernel computations are based on recursive expressions involving the order statistics, which allows for exact evaluation of kernel smoothers at all sample points in log-linear time. In addition to general purpose kernel smoothing functions, the package offers purpose built and readyto-use implementations of popular kernel-type estimators. On top of these basic smoothing problems, this paper focuses on projection pursuit problems in which the projection index is based on kernel-type estimators of functionals of the projected density.
- 1 January 2022
- Published by Foundation for Open Access Statistic in Journal of Statistical Software
- Vol. 101 (3) , 1-33
Open AccessFast Kernel Smoothing in R with Applications to Projection Pursuit
This paper introduces the R package FKSUM, which offers fast and exact evaluation of univariate kernel smoothers. The main kernel computations are implemented in C++, and are wrapped in simple, intuitive and versatile R functions. The fast kernel computations are based on recursive expressions involving the order statistics, which allows for exact evaluation of kernel smoothers at all sample points in log-linear time. In addition to general purpose kernel smoothing functions, the package offers purpose built and readyto-use implementations of popular kernel-type estimators. On top of these basic smoothing problems, this paper focuses on projection pursuit problems in which the projection index is based on kernel-type estimators of functionals of the projected density.
- 1 September 2020
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 149
Degrees of freedom and model selection for -means clustering- 1 September 2020
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 149
Degrees of freedom and model selection for -means clustering- 23 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 43 (2) , 447-458
Fast Exact Evaluation of Univariate Kernel Sums
This paper presents new methodology for computationally efficient evaluation of univariate kernel sums. It is shown that a rich class of kernels allows for exact evaluation of functions expressed as a sum of kernels using simple recursions. Given an ordered sample the computational complexity is linear in the sample size. Direct applications to the estimation of denisties and their derivatives shows that the proposed approach is competitive with the state-of-the-art. Extensions to multivariate problems including independent component analysis and spatial smoothing illustrate the versatility of univariate kernel estimators, and highlight the efficiency and accuracy of the proposed approach. Multiple applications in image processing, including image deconvolution; denoising; and reconstruction are considered, showing that the proposed approach offers very promising potential in these fields.
- 23 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 43 (2) , 447-458
Fast Exact Evaluation of Univariate Kernel Sums
This paper presents new methodology for computationally efficient evaluation of univariate kernel sums. It is shown that a rich class of kernels allows for exact evaluation of functions expressed as a sum of kernels using simple recursions. Given an ordered sample the computational complexity is linear in the sample size. Direct applications to the estimation of denisties and their derivatives shows that the proposed approach is competitive with the state-of-the-art. Extensions to multivariate problems including independent component analysis and spatial smoothing illustrate the versatility of univariate kernel estimators, and highlight the efficiency and accuracy of the proposed approach. Multiple applications in image processing, including image deconvolution; denoising; and reconstruction are considered, showing that the proposed approach offers very promising potential in these fields.
- 20 May 2019
- Published by Taylor & Francis in Journal of Computational and Graphical Statistics
- Vol. 28 (4) , 980-992
Improving Spectral Clustering Using the Asymptotic Value of the Normalized Cut
Spectral clustering is a popular and versatile clustering method based on a relaxation of the normalised graph cut objective. Despite its popularity, selecting the number of clusters and tuning the important scaling parameter remain challenging problems in practical applications of spectral clustering. Popular heuristics have been proposed, but corresponding theoretical results are scarce. In this paper we investigate the asymptotic value of the normalised cut for an increasing sample assumed to arise from an underlying probability distribution. Based on this, we find strong connections between spectral and density clustering. This enables us to provide recommendations for selecting the number of clusters and setting the scaling parameter in a data driven manner. An algorithm inspired by these recommendations is proposed, which we have found to exhibit strong performance in a range of applied domains. An R implementation of the algorithm is available from https://github.com/DavidHofmeyr/spuds.
- 20 May 2019
- Published by Taylor & Francis in Journal of Computational and Graphical Statistics
- Vol. 28 (4) , 980-992
Improving Spectral Clustering Using the Asymptotic Value of the Normalized Cut
Spectral clustering is a popular and versatile clustering method based on a relaxation of the normalised graph cut objective. Despite its popularity, selecting the number of clusters and tuning the important scaling parameter remain challenging problems in practical applications of spectral clustering. Popular heuristics have been proposed, but corresponding theoretical results are scarce. In this paper we investigate the asymptotic value of the normalised cut for an increasing sample assumed to arise from an underlying probability distribution. Based on this, we find strong connections between spectral and density clustering. This enables us to provide recommendations for selecting the number of clusters and setting the scaling parameter in a data driven manner. An algorithm inspired by these recommendations is proposed, which we have found to exhibit strong performance in a range of applied domains. An R implementation of the algorithm is available from https://github.com/DavidHofmeyr/spuds.
- 4 May 2018
- Published by Springer Nature in Statistics and Computing
- Vol. 29 (2) , 391-414
Minimum spectral connectivity projection pursuit
- 4 May 2018
- Published by Springer Nature in Statistics and Computing
- Vol. 29 (2) , 391-414
Minimum spectral connectivity projection pursuit
- Open Access
Minimum Density Hyperplanes
Associating distinct groups of objects (clusters) with contiguous regions of high probability density (high-density clusters), is central to many statistical and machine learning approaches to the classification of unlabelled data. We propose a novel hyperplane classifier for clustering and semi-supervised classification which is motivated by this objective. The proposed minimum density hyperplane minimises the integral of the empirical probability density function along it, thereby avoiding intersection with high density clusters. We show that the minimum density and the maximum margin hyperplanes are asymptotically equivalent, thus linking this approach to maximum margin clustering and semi-supervised support vector classifiers. We propose a projection pursuit formulation of the associated optimisation problem which allows us to find minimum density hyperplanes efficiently in practice, and evaluate its performance on a range of benchmark datasets. The proposed approach is found to be very competitive with state of the art methods for clustering and semi-supervised classification.
Open AccessMinimum Density Hyperplanes
Associating distinct groups of objects (clusters) with contiguous regions of high probability density (high-density clusters), is central to many statistical and machine learning approaches to the classification of unlabelled data. We propose a novel hyperplane classifier for clustering and semi-supervised classification which is motivated by this objective. The proposed minimum density hyperplane minimises the integral of the empirical probability density function along it, thereby avoiding intersection with high density clusters. We show that the minimum density and the maximum margin hyperplanes are asymptotically equivalent, thus linking this approach to maximum margin clustering and semi-supervised support vector classifiers. We propose a projection pursuit formulation of the associated optimisation problem which allows us to find minimum density hyperplanes efficiently in practice, and evaluate its performance on a range of benchmark datasets. The proposed approach is found to be very competitive with state of the art methods for clustering and semi-supervised classification.