Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Remarks on some statistical properties of the minimum spanning forest
Dubes R., Hoffman R. Pattern Recognition19 (1):49-53,1986.Type:Article
Date Reviewed: Dec 1 1987

The authors point out errors in an earlier paper by Di Gesu` and Sacco [1] in which a statistic to test for degree of departure from a uniform distribution of points in a finite region of a multidimensional space was proposed. The primary flaw in [1] is the assumption that lengths of edges in a minimum spanning tree will be independent under randomness; this assumption is systematically violated and thus the proposed statistic is invalid. The Di Gesu` and Sacco paper also contains other errors and misleading statements. Researchers interested in tests for uniformity vs. clustering would do well to consult recent statistical work in the classification literature, such as that of Hartigan [2].

Reviewer:  R. L. Stout Review #: CR111666
1) Di Gesu:9aa, V.; and Sacco, B.Some statistical properties of the minimum spanning forest, Pattern Recogn. 16 (1983), 525–531.
2) Hartigan, J. A.Statistical theory in clustering, J. Classif. 2 (1985), 63–76.
Bookmark and Share
 
Statistical (I.5.1 ... )
 
 
Clustering (I.5.3 )
 
 
Graph Theory (G.2.2 )
 
Would you recommend this review?
yes
no
Other reviews under "Statistical": Date
A formulation and comparison of two linear feature selection techniques applicable to statistical classification
Young D., Odell P. Pattern Recognition 17(3): 331-337, 1984. Type: Article
Mar 1 1985
Statistical pattern recognition--early development and recent progress
Chen C. International Journal of Pattern Recognition and Artificial Intelligence 1(1): 43-51, 1987. Type: Article
May 1 1988
Decision estimation and classification: an introduction to pattern recognition and related topics
Therrien C., John Wiley & Sons, Inc., New York, NY, 1989. Type: Book (9789780471831020)
Dec 1 1989
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy