Citation: | CHEN Jian-bin, WANG Shu-jing, SONG Han-tao. New Clustering Method in High-Di mensional Space Based on Hypergraph-Models[J].JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 2006, 15(2): 156-161. |
[1] |
Han E H, Karypis G, Kumar V, et al. Clustering in ahigh-dimensional space using hypergraph models [R]. TR-97-063, Minneapolis: Department of Computer Sci-ence, University of Minnesota, 1997.
|
[2] |
Jackson J E. A user’s guide to principal components[M]. New York: John Wiley & Sons Inc, 1991.
|
[3] |
Jain A K, Dubes R C. Algorithms for clustering data[M]. Engle Wood Cliffs, NJ: Prentice Hall, 1988.
|
[4] |
Kohonen T. Self-organization and associated memory[M]. Heidelberg: Springer-Verlag, 1989.
|
[5] |
Berry M W, Dumais S T, O’Brien G W. Using linearalgebra for intelligent information retrieval [J]. SIAMRevies, 1995, 37: 573- 595.
|
[6] |
Karypis G, Aggarwal R, Kumar V, et al. Multilevel hy-pergraph partitioning application in VLSI design [A]. Proceedings of the ACM/ IEEE Design Automation Con-ference [c]. Anaheim, CA: ACM Press, 1997. 526-529.
|
[7] |
Zhang Rong, Peng Hong. Method for data clustering in ahigh dimensional space based on a hypergraph model [J]. Computer Engineering, 2002, 28 (7): 54- 55.
|