Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Maloney, Laurence T
1983.
Nearest neighbor analysis of point processes: Simulations and evaluations.
Journal of Mathematical Psychology,
Vol. 27,
Issue. 3,
p.
251.
Tversky, Amos
Rinott, Yosef
and
Newman, Charles M
1983.
Nearest neighbor analysis of point processes: Applications to multidimensional scaling.
Journal of Mathematical Psychology,
Vol. 27,
Issue. 3,
p.
235.
Newman, Charles M.
and
Rinott, Yosef
1985.
Nearest neighbors and Voronoi volumes in high-dimensional point processes with various distance functions.
Advances in Applied Probability,
Vol. 17,
Issue. 04,
p.
794.
Schilling, M. F.
1986.
Mutual and shared neighbor probabilities: finite- and infinite-dimensional results.
Advances in Applied Probability,
Vol. 18,
Issue. 2,
p.
388.
Faris, William G.
and
Maier, Robert S.
1988.
Probabilistic analysis of a learning matrix.
Advances in Applied Probability,
Vol. 20,
Issue. 4,
p.
695.
De Wet, Tertius
Fresen, John
and
Fresen, Jill
1989.
The test for logical order in English language testing.
Journal of Applied Statistics,
Vol. 16,
Issue. 1,
p.
47.
Aurenhammer, Franz
1991.
Voronoi diagrams—a survey of a fundamental geometric data structure.
ACM Computing Surveys,
Vol. 23,
Issue. 3,
p.
345.
Newman, Charles M.
1992.
Chain Lengths in Certain Random Directed Graphs.
Random Structures & Algorithms,
Vol. 3,
Issue. 3,
p.
243.
Srinivasan, M.
and
Sarwate, D.V.
1994.
Malfunction in the Peterson-Gorenstein-Zierler decoder.
IEEE Transactions on Information Theory,
Vol. 40,
Issue. 5,
p.
1649.
Zeger, K.
and
Gersho, A.
1994.
Number of nearest neighbors in a Euclidean code.
IEEE Transactions on Information Theory,
Vol. 40,
Issue. 5,
p.
1647.
Zeger, K.
and
Gersho, A.
1994.
How many points in Euclidean space can have a common nearest neighbor?.
p.
109.
Yao, Yi-Ching
and
Simons, Gordon
1996.
A large-dimensional independent and identically distributed property for nearest neighbor counts in Poisson processes.
The Annals of Applied Probability,
Vol. 6,
Issue. 2,
Penrose, Mathew D.
1996.
The random minimal spanning tree in high dimensions.
The Annals of Probability,
Vol. 24,
Issue. 4,
Enns, E. G.
Ehlers, P. F.
and
Misi, T.
1999.
A cluster problem as defined by nearest neighbours.
Canadian Journal of Statistics,
Vol. 27,
Issue. 4,
p.
843.
Dedecker, Jérôme
and
Louhichi, Sana
2005.
Convergence to infinitely divisible distributions with finite variance for some weakly dependent sequences.
ESAIM: Probability and Statistics,
Vol. 9,
Issue. ,
p.
38.
Radovanović, Miloš
Nanopoulos, Alexandros
and
Ivanović, Mirjana
2009.
Nearest neighbors in high-dimensional data.
p.
865.
Yao, Yi-Ching
2010.
On variances of partial volumes of the typical cell of a Poisson-Voronoi tessellation and large-dimensional volume degeneracy.
Advances in Applied Probability,
Vol. 42,
Issue. 2,
p.
359.
Yao, Yi-Ching
2014.
Rate of Poisson approximation for nearest neighbor counts in large-dimensional Poisson point processes.
Statistics & Probability Letters,
Vol. 92,
Issue. ,
p.
143.
Hörrmann, Julia
and
Hug, Daniel
2014.
On the Volume of the Zero Cell of a Class of Isotropic Poisson Hyperplane Tessellations.
Advances in Applied Probability,
Vol. 46,
Issue. 03,
p.
622.
Radovanovic, Milos
Nanopoulos, Alexandros
and
Ivanovic, Mirjana
2015.
Reverse Nearest Neighbors in Unsupervised Distance-Based Outlier Detection.
IEEE Transactions on Knowledge and Data Engineering,
Vol. 27,
Issue. 5,
p.
1369.