| 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 |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 28, Citation Count: 0
|
|
|
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
|
|
| |
10
|
J.P. Coohen and W.D. Paris. Genetic Placement. 1EEE Trans. on Computer-Aided Design, Vol. 6, pp 956-964, Nov 1987.
|
| |
11
|
|
| |
12
|
J.J. Grefenstette. Incorporating Problem Specific Knowledge into Genetic Algorithms. Genetic Algorithms and Simulated Annealing. Morgan Katffmaa Publishers, pp 42-60, 1987.
|
| |
13
|
|
| |
14
|
|
| |
15
|
|
| |
16
|
|
| |
17
|
S. Kirkpatrick, C.D. Gelau, and M.P. Vecchi. Optimization by Simulated Annealing. Science, 220, pp 671-680.
|
| |
18
|
|
| |
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.
|
|