Algorithms for optimal outlier removal

Atanassov, Rossen; Bose, Prosenjit; Couture, Mathieu; Maheshwari, Anil; Morin, Pat; Paquette, Michel; Smid, Michiel; Wuhrer, Stefanie

doi:10.1016/j.jda.2008.12.002

Atanassov, R. (Rossen), P. Bose (Prosenjit), Couture, M. (Mathieu), A. Maheshwari (Anil), P. Morin (Pat), Paquette, M. (Michel), M. Smid (Michiel) and Wuhrer, S. (Stefanie)

2009-06-01

Algorithms for optimal outlier removal

Journal of Discrete Algorithms , Volume 7 - Issue 2 p. 239- 248

We consider the problem of removing c points from a set S of n points so that the remaining point set is optimal in some sense. Definitions of optimality we consider include having minimum diameter, having minimum area (perimeter) bounding box, having minimum area (perimeter) convex hull. For constant values of c, all our algorithms run in O (n log n) time.

Additional Metadata
Keywords	Computational geometry, Computational statistics, Outlier removal
Persistent URL	doi.org/10.1016/j.jda.2008.12.002
Journal	Journal of Discrete Algorithms
Organisation	School of Computer Science
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Atanassov, R. (Rossen), Bose, P, Couture, M. (Mathieu), Maheshwari, A, Morin, P, Paquette, M. (Michel), … Wuhrer, S. (Stefanie). (2009). Algorithms for optimal outlier removal. Journal of Discrete Algorithms, 7(2), 239–248. doi:10.1016/j.jda.2008.12.002

Algorithms for optimal outlier removal

Publication

Publication

Algorithms for optimal outlier removal

Publication

Publication

Workflow

Workflow

Add Content