Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
A parallel nonlinear mapping algorithm
Shen C., Lee R., Chin Y. International Journal of Pattern Recognition and Artificial Intelligence1 (1):53-69,1987.Type:Article
Date Reviewed: Jun 1 1988

The authors present a parallel algorithm to perform nonlinear mapping that they claim is useful for pattern recognition and clustering analysis. They transform the nonlinear mapping algorithm proposed in [1] into a parallel version and show that the nonlinear mapping algorithm is quite similar to a sorting algorithm. They provide a useful account of the algorithm in pseudocode and give several examples. The examples have to do with sorter chips.

Reviewer:  Lou Agosta Review #: CR112173
1) Chang, C. L., and Lee, R. C. T.A heuristic relaxation method for nonlinear mapping in clustering analysis, IEEE Trans. Syst., Man and Cybern., 30, 3 (1978) 197–200.
Bookmark and Share
Algorithms (I.5.3 ... )
Parallel Algorithms (G.1.0 ... )
Would you recommend this review?
Other reviews under "Algorithms": Date
Monte Carlo comparison of six hierarchical clustering methods on random data
Jain N., Indrayan A., Goel L. Pattern Recognition 19(1): 95-99, 1986. Type: Article
Nov 1 1987
Algorithms for clustering data
Jain A., Dubes R., Prentice-Hall, Inc., Upper Saddle River, NJ, 1988. Type: Book (9780130222787)
Jun 1 1989
An algorithm for multidimensional data clustering
Wan S., Wong S., Prusinkiewicz P. ACM Transactions on Mathematical Software 14(2): 153-162, 1988. Type: Article
Dec 1 1989

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