O(log n) bimodality analysis

作者:

Highlights:

摘要

The bimodality of a population P can be measured by dividing its range into two intervals so as to maximize the Fisher distance between the resulting two subpopulations P1 and P2. If P is a mixture of two (approximately) Gaussian subpopulations, then P1 and P2 are good approximations to the original Gaussians, if their Fisher distance is great enough. Moreover, good approximations to P1 and P2 can be obtained by dividing P into small parts; finding the maximum-distance (MD) subdivision of each part; combining small groups of these subdivisions into (approximate) MD subdivisions of larger parts; and so on. This divide-and-conquer approach yields an approximate MD subdivision of P in O(log n) computational steps using O(n) processors, where n is the size of P.

论文关键词:Histograms,Bimodality,Fisher distance,Divide-and-conquer,Tree algorithms,Pyramid algorithms

论文评审过程:Received 10 August 1988, Revised 17 November 1988, Accepted 8 December 1988, Available online 19 May 2003.

论文官网地址:https://doi.org/10.1016/0031-3203(89)90010-1