A combination of genetic algorithm and simulated evolution techniques for clustering

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A combination of genetic algorithm and simulated evolution techniques for clustering

Full text

Pdf (851 KB)

Source

ACM Annual Computer Science Conference archive
Proceedings of the 1995 ACM 23rd annual conference on Computer science table of contents

Nashville, Tennessee, United States

Pages: 127 - 134

Year of Publication: 1995

ISBN:0-89791-737-5

Author

Jay Bhuyan

Department of Computer Science, Tuskegee University, Tuskegee, AL

Sponsor

ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 36, Citation Count: 0

Additional Information:

references index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/259526.259547 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	W.L.G. Koonz, P.M. Nafendra, and K. Fukunga. A Branch and Bound Clustering Algorithm. IEEE Trans. on Computers, Vol. C-24, No.9, September 1975.
	2	R.E. Jensen. A Dynamic Programming Algorithm for Cluster Analysis. Journal of Op. Res. Society, Vo\| 7, pp I034-I057,1969.
	3	R. Dubes and A. K. Jain. Clustering Methodologies in Exploratory Data Analysis. ,4~A,. Comput., 19, pp 213-228, 1980.
	4	R. Dubes and A. K. Jmn. Clustering Techniques: the User Dilemma. Pattern Recognition, 8, pp 247-268, 1976.
	5	J. Tou and R. Gonzalez. Pattern Recognition. Reading, MA: Addison-Wesley, 1974.
	6	R.W. Klein and R. C. Dubes. Experiments in Projection and Clustering by Simulated Annealing. Pattern Recognition, Vol. 22, pp 213- 220, 1989.
	7	A.D. Gordon and J. T. Henderson. An Algorithm for Euclidean Sum of Square Classification. Biometr~c, 33, pp 355-362, 1977.
	8	W.D. Fisher. On Grouping for Maximum Homogeneity. Journal of American Stat. Asoc., 53, pp 789,798, 1958.
	9	John A. Hartigan, Clustering Algorithms, John Wiley & Sons, Inc., New York, NY, 1975
	10	J.P. Coohen and W.D. Paris. Genetic Placement. 1EEE Trans. on Computer-Aided Design, Vol. 6, pp 956-964, Nov 1987.
	11	M. A. Ismail , M. S. Kamel, Multidimensional data clustering utilizing hybrid search strategies, Pattern Recognition, v.22 n.1, p.75-89, January 1989 [doi>10.1016/0031-3203(89)90040-X]
	12	J.J. Grefenstette. Incorporating Problem Specific Knowledge into Genetic Algorithms. Genetic Algorithms and Simulated Annealing. Morgan Katffmaa Publishers, pp 42-60, 1987.
	13	John H. Holland, Adaptation in natural and artificial systems, MIT Press, Cambridge, MA, 1992
	14	Donald E. Brown , Christopher L. Huntley , Andrew R. Spillane, A parallel genetic heuristic for the quadratic assignment problem, Proceedings of the third international conference on Genetic algorithms, p.406-415, December 1989, George Mason University, United States
	15	Darrell Whitley , Timothy Starkweather , D'Ann Fuquay, Scheduling problems and traveling salesman: the genetic edge recombination, Proceedings of the third international conference on Genetic algorithms, p.133-140, December 1989, George Mason University, United States
	16	John J. Grefenstette , Rajeev Gopal , Brian J. Rosmaita , Dirk Van Gucht, Genetic Algorithms for the Traveling Salesman Problem, Proceedings of the 1st International Conference on Genetic Algorithms, p.160-168, July 01, 1985
	17	S. Kirkpatrick, C.D. Gelau, and M.P. Vecchi. Optimization by Simulated Annealing. Science, 220, pp 671-680.
	18	David E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1989
	19	H. Spath. Cluster Analysis Algorithm. John Wiley & Sons, 1980.
	20	D.R. Jones and Mark A. Beltramo. Solving Partitioning Problems with Genetic Algorithms. Proceedings of Fourth International Conference on Genetic Algorithms, 1991.
	21	R.M. King and P. Banerjee. ESP: Placement by Simulated Evolution. 1EEE Trans on Computer- Aided Design, Voi. 8, No.3, pp 245-256, March 1989.
	22	Y. Lin, Y.C. Hat, and F.S. Tsai. SILK: A simulated Evolution Router. IEEE Trans. on Computer-Aided Design, Vol 8, No. 10, October 1989.
	23	J.N. Bhuyan, V.V. Raghavan, and V.K. Elayavalli. Genetic Algorithm for Clustering with an Ordered Representation. Proceedings of Fourth International Conference on Genetic Algorithms, 1991.

INDEX TERMS

Primary Classification:
I. Computing Methodologies
I.5 PATTERN RECOGNITION
I.5.3 Clustering
Subjects: Algorithms

Additional Classification:
G. Mathematics of Computing
G.3 PROBABILITY AND STATISTICS
Subjects: Probabilistic algorithms (including Monte Carlo)

J. Computer Applications
J.3 LIFE AND MEDICAL SCIENCES
Subjects: Biology and genetics

General Terms:
Algorithms, Experimentation

Collaborative Colleagues:

Jay Bhuyan: colleagues

Peer to Peer - Readers of this Article have also read:

Constructing reality Proceedings of the 11th annual international conference on Systems documentation
Douglas A. Powell , Norman R. Ball , Mansel W. Griffiths
Data structures for quadtree approximation and compression Communications of the ACM 28, 9
Hanan Samet
A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee , Huizhu Lu , D. D. Fisher
An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen , Daniel D. Gajski
Putting innovation to work: adoption strategies for multimedia communication systems Communications of the ACM 34, 12
Ellen Francik , Susan Ehrlich Rudman , Donna Cooper , Stephen Levine

Adobe Acrobat

QuickTime

Windows Media Player

Real Player