### Constructing Minimum Spanning Tree Based on Hierarchical Clustering

#### Abstract

#### Keywords

#### Full Text:

PDF#### References

M.F. Jiang, S.S. Tseng, and C.M. Su, ―Two-Phase Clustering Process for Outliers Detection,‖ Pattern Recognition Letters, vol. 22, pp. 691-700, 2001.

J. Lin, D. Ye, C. Chen, and M. Gao, ―Minimum Spanning Tree-Based Spatial Outlier Mining and Its Applications,‖ Lecture Notes in Computer Science, vol. 5009/2008, pp. 508-515, Springer-Verlag, 2008.

J. Kruskal, ―On the Shortest Spanning Subtree and the Traveling Salesman Problem,‖ Proc. Am. Math. Soc., pp. 48-50, 1956.

L. Caccetta and S.P. Hill, ―A Branch and Cut Method for the Degree-Constrained Minimum Spanning Tree Problem,‖ Networks, vol. 37, no. 2, pp. 74-83, 2001.

N. Paivinen, ―Clustering with a Minimum Spanning Tree of Scale- Free-Like Structure,‖ Pattern Recognition Letters, vol. 26, no. 7, pp. 921-930, Elsevier, 2005.

J.L. Bentley and J.H. Friedman, ―Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces,‖ IEEE Trans. Computers, vol. 27, no. 2, pp. 97-105, Feb. 1978.

S.D. Bay and M. Schwabacher, ―Mining Distance-Based Outliers in Near Linear Time with Randomization and a Simple Pruning Rule,‖ Proc. Ninth ACM SIGKDD Int‘l Conf. Knowledge Discovery and Data Mining, pp. 29-38, 2003.

H.V. Jagadish, B.C. Ooi, K.L. Tan, C. Yu, and R. Zhang, ―iDistance: An Adaptive B+-Tree Based Indexing Method for Nearest Neighbor Search,‖ ACM Trans. Database System (TODS), vol. 30, no. 2, pp. 364-397, 2005.

Xiaochun Wang, Xiali Wang, and D.Mitchell Wilkes, ― A Divide –and – Conquer Approach for Minimum Spanning Tree-Based Clustering, IEEE Transaction on Knowledge and Data Engineering, Vol 21, No.7, july 2009

### Refbacks

- There are currently no refbacks.

This work is licensed under a Creative Commons Attribution 3.0 License.