Biology Reference
In-Depth Information
[15]
J. C. Dunn. A fuzzy relative of the isodata process and its use in detecting compact
well-separated clusters. Journal of Cybernetics ,3:32-57, 1973.
[16]
J. C. Dunn. Well separated clusters and optimal fuzzy partitions. Journal of Cyber-
netics ,4:95-104, 1974.
[17]
M. A. Duran and P. L. Odell. Cluster Analysis: A Survey . Springer Verlag, 1974.
[18]
M. B. Eisen, P. T. Spellman, P. O. Brown, and D. Botstein. Cluster analysis
and display of genome-wide expression patterns. Proc. Nat. Acad. Sci. U.S.A. ,
95(25):14863-14868, 1998.
[19]
C. A. Floudas. Nonlinear and Mixed-Integer Optimization: Fundamentals and Ap-
plications . Oxford University Press, 1995.
[20]
C. A. Floudas. Deterministic Global Optimization: Theory, Algorithms, and Appli-
cations . Kluwer Academic Publishers, 2000.
[21]
C. A. Floudas, A. Aggarwal, and A. R. Ciric. Global optimum search for non convex
nlp and minlp problems. Comp. & Chem. Eng. , 13(10):1117-1132, 1989.
[22]
C. A. Floudas, I. G. Akrotirianakis, S. Caratzoulas, C. A. Meyer, and J. Kallrath.
Global optimization in the 21st century: Advances and challenges. Computers and
Chemical Engineering , 29:1185-2002, 2005.
[23]
C. A. Floudas and A. R. Ciric. Strategies for overcoming uncertainty in heat ex-
changer network synthesis. Computers & Chemical Engineering , 13(10):1133-1152,
1989.
[24]
G. Getz, E. Levine, and E. Domany. Coupled two-way clustering analysis of gene
microarray data. Proc. Nat. Acad. Sci. U.S.A. , 97:12079-12084, 2000.
[25]
L. Goodman and W. Kruskal. Measures of associations for cross-validations. J. Am.
Stat. Assoc. , 49:732-764, 1954.
[26]
J. C. Gower and G. J. S. Ross. Minimum spanning trees and single-linkage cluster
analysis. Appl. Stat. , 18:54-64, 1969.
[27]
M. Halkidi, Y. Batistakis, and M. Vazirgiannis. Cluster validity methods:
Part 1.
SIGMOD Record , 31(2):40-45, 2002.
[28]
P. Hansen and B. Jaumard. Cluster analysis and mathematical programming. Mathe-
matical Programming , 79:191-215, 1997.
[29]
J. A. Hartigan. Clustering Algorithms . John Wiley & Sons, 1975.
[30]
J. A. Hartigan and M. A. Wong. Algorithm AS 136: A k -means clustering algorithm.
Appl. Stat.-J. Roy. St. C. , 28:100-108, 1979.
[31]
J. Herrero, A. Valencia, and J. Dopazo. A hierarchical unsupervised growing neu-
ral network for clustering gene expression patterns. Bioinformatics , 17(2):126-136,
2001.
[32]
L. J. Heyer, S. Kruglyak, and S. Yooseph. Exploring expression data: Identification
and analysis of co-expressed genes. Genome Res. , 9:1106-1115, 1999.
[33]
L. Huber and J. Schultz. Quadratic assignment as a general data-analysis strategy.
British Journal of Mathematical and Statistical Psychologie , 29:190-241, 1976.
[34]
J. Ihmels, G. Friedlander, S. Bergmann, O. Sarig, Y. Ziv, and N. Barkai. Reveal-
ing modular organization in the yeast transcriptional network. Nature Genetics ,
31(4):370-377, 2002.
[35]
P. Jaccard. The distribution of flora in the alpine zone. New Phytologist , 11:37-50,
1912.
Search WWH ::




Custom Search