Summary
The estimation of convex sets when inside and outside observations are available is often needed in current research applications. The key idea in this presentation is to try to identify a convex domain through random observations which turn to belong or not to the convex. We can think here to oil fields detection, to population polls, to pattern recognition, etc.
The solution proposed here is based on a criterion from discriminant analysis. This criterion, for deciding whether a further observation [for which we do not know if it is inside or outside the original convex set], was first proposed by Baufays and Rasson (1984), (1985). Its application here gives a robust and practical estimate of the unknown domain D.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
BAUFAYS, P., and RASSON, J.P. (1985): A new geometric discriminant rule. Computational Statistics Quaterly, vol 2, issue 1, 15–30.
BAUFAYS, P., and RASSON, J.P. (1984): Une nouvelle règle de classement utilisant l’enveloppe convexe et la mesure de Lebesgue. Statistique et Analyse des Données, vol 9, no 2, 31–47.
GRENANDER, U. (1973): Statistical geometry: a tool for pattern analysis. Bulletin of the American Mathematical Society, vol. 79, 829–856.
HACHTEL, G.D., MEILIJSON, I. and NADAS, A. (1981): The estimation of a convex subset of IRk and its probability content. IBM research report, Yorktown Heights N.Y.
HAND, D.J. (1982): Kernel Discriminant Analysis. Research studies press, England.
MOORE, M., LEMAY, Y. and ARCHAMBAULT, S. (1988): Algorithms to reconstruct a convex set from sample points. Computing Science and Statistics: Proceedings of the 20th Symposium on the Interface, Eds. E J. Wegman, D.T. Gantz and J.J. Miller, ASA, Virginia, 553–558.
RASSON, J.P., REMON, M. and KUBUSHISHI, T. (1993): Finding the edge of a Poisson forest with inside and outside observations. Internal report 93/14, Dept. of Mathematics, FUNDP, Namur.
REMON, M. (1994): The estimation of a convex domain when inside and outside observations are available. Supplemento ai Rendiconti del Circolo Matematico di Palermo, serie II no 35, 227–235.
RIPLEY, B.D., and RASSON, J.P. (1977): Finding the edge of a Poisson forest. Journal of Applied Probability, 14, 483–491.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Rasson, J.P., Rémon, M., Henry, F. (1996). Finding the Edge of a Poisson Forest with Inside and Outside Observations: The Discriminant Analysis Point of View. In: Gaul, W., Pfeifer, D. (eds) From Data to Knowledge. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-79999-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-79999-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60354-2
Online ISBN: 978-3-642-79999-0
eBook Packages: Springer Book Archive