<p>This work discusses weighted kernel point projection (WKPP), a new method for embedding metric space or kernel data. WKPP is based on an iteratively weighted generalization of multidimensional scaling and kernel principal component analysis, and one of its main uses is outlier detection. After a detailed derivation of the method and its algorithm, we give theoretical guarantees regarding its convergence and outlier detection capabilities. Additionally, as one of our mathematical contributions, we give a novel characterization of kernelizability, connecting it also to the classical kernel literature. In our empirical examples, WKPP is benchmarked with respect to several competing outlier detection methods, using various different datasets. The obtained results show that WKPP is computationally fast, while simultaneously achieving performance comparable to state-of-the-art methods.</p>