Chapter 25 References

[1]
H. F. Kaiser, “An index of factorial simplicity,” Psychometrika, 1974.
[2]
C. D. Meyer and D. J. Hartfiel, “On the structure of stochastic matrices with a subdominant eigenvalue near 1,” Linear Algebra and its Applications, 1998.
[3]
J. Hopcroft and R. Tarjan, “Efficient algorithms for graph manipulation,” Communications of the ACM, vol. 16, no. 6, pp. 372–378, 1973.
[4]
D. Zeimpekis and E. Gallopoulos, “Principal direction divisive partitioning with kernels and k-means steering,” in Survey of text mining II, Springer London, 2008, pp. 45–64.
[5]
A. D. Gordon, Classification, 2nd ed. Chapman & Hall/CRC Monographs on Statistics; Applied Probability, 1999.
[6]
W.-L. Cao and W. J. Stewart, “Iterative aggregation/disaggregation techniques for nearly uncoupled markov chains,” Journal of the ACM, vol. 32, no. 2, pp. 702–719, 1985.
[7]
M. W. Berry, Ed., Survey of text mining i: Clustering, classification and retrieval volume i. Springer, 2004.
[8]
R. Tibshiram, G. Walther, and T. Hastie, “Estimating the number of clusters via the gap statistic,” Journal of the Royal Statistical Society. Series B (Statistical Methodology)., vol. 63, no. 2, pp. 411–423, 2001.
[9]
M. Authors, Handbook of graph drawing and visualization. http://cs.brown.edu/ rt/gdhandbook/: CRC Press, 2013.
[10]
H. Gibson, J. Faith, and P. Vickers, “A survey of two-dimensional graph layout techniques for information visualization,” Information Visualization (SAGE), 2012.
[11]
P. Deuflhard and M. Webber, “Robust peron cluster analysis in conformation dynamics,” Linear Algebra and its Applications, vol. 398, 2004.
[12]
C. D. Meyer, “Stochastic complementation, uncoupling markov chains, and the theory of nearly reducible systems,” SIAM Review, vol. 31, no. 2, 1989.
[13]
T. Kato, Perturbation theory for linear operators. Springer, 1995.
[14]
G. W. Milligan and M. C. Cooper, “An examination of procedures for determining the number of clusters in a data set,” Psychometrika, vol. 50, no. 2, pp. 159–179, 1985.
[15]
S. Ray and R. Turi, “Determination of the number of clustersin k-means clustering and apllication in colour image segmentation,” 1999.
[16]
G. Gan, C. Ma, and J. Wu, Data clustering: Theory, algorithms and applications. American Statistical Association; the Society for Industrial; Applied Mathematics, 2007.
[17]
D. Ruiz, “A scaling algorithm to equilibrate both rows and columns norm in matrices,” Rutherfod Appleton Lab., Oxon, UK, RAL-TR-2001-034, 2001.
[18]
M. Ester, H.-P. Kriegel, J. Sander, and X. Xu, “A density-based algorithm for discovering clusters in large spatial databases with noise,” in Proceedings of the 2nd international conference on knowledge discovery and data mining, 1996, pp. 226–231.
[19]
J. L. Chandon and S. Pinson, Analyse typologique: Theories et applications. Masson, Paris, 1981.
[20]
D. Wishart, “Mode analysis: A generalization of nearest neighbor which reduces chaining effects,” Numerical Taxonomy, vol. 76, pp. 282–311, 1969.
[21]
J. W. Carmichael and P. H. A. Sneath, “Taxometric maps,” Systematic Biology, vol. 18, no. 4, pp. 402–415, 1969.
[22]
J. W. Carmichael and R. S. Julius, “Finding natural clusters,” Systematic Biology, vol. 17, no. 2, pp. 144–150, 1968.
[23]
B. S. Everitt, S. Landau, and M. Leese, Cluster analysis, 4th ed. Arnold, 2001.
[24]
L. Hagen and A. Kahng, “New spectral methods for ratio cut partitioning and clustering,” IEEE Transactions on Computer-Aided Design, vol. 11, no. 9, pp. 1074–1085, 1992.
[25]
H.-H. Bock, “Origins and extensions of the k-means algorithm in cluster analysis,” Electronic Journal for History of Probability and Statistics, vol. 4, no. 2, 2008.
[26]
A. Pothen, H. D. Simon, and K.-P. Liou, “Partitioning sparse matrices with eigenvectors of graphs,” SIAM Journal on Matrix Analysis and Applications, vol. 11, no. 3, pp. 430–452, 1990.
[27]
C. Ding, X. He, H. Zha, M. Gu, and H. D. Simon, “A min-max cut algorithm for graph partitioning and data clustering,” 2001.
[28]
P. Drineas, A. Frieze, R. Kanna, S. Vempala, and V. Vinay, “Clustering large graphs via the singular value decomposition,” Machine Learning, vol. 56, no. 1, pp. 9–33, 2004.
[29]
M. A. Porter, J.-P. Onnela, and P. J. Mucha, “Communities in networks,” Notices of the AMS, vol. 56, no. 9, pp. 1082–1097, 2009.
[30]
M. E. Newman, “Modularity and community structure in networks,” in Proceedings of the national academy of sciences, 2006, vol. 103.
[31]
M. Fielder, “A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory,” Czechoslovak Mathematical Journal, vol. 25, no. 4, pp. 619–633, 1975.
[32]
M. Fielder, “Algebraic connectivity of graphs,” Czechoslovak Mathematical Journal, vol. 23, no. 2, pp. 298–305, 1973.
[33]
G. Celeux and G. Govaert, “A classification EM algorithm for clustering and two stochastic versions,” Computational Statistics and Data Analysis, vol. 14, pp. 315–332, 1992.
[34]
N. M. L. A. P. Dempster and D. B. Rubin, “Maximum likelihood from incomplete data via the EM algorithm,” Journal of the Royal Statistical Society. Series B., vol. 39, no. 1, pp. 1–38, 1977.
[35]
L. Kaufman and P. J. Rousseeuw, Finding groups in data: An introduction to cluster analysis. John Wiley & Sons, 1990.
[36]
S. Guha, R. Rastogi, and K. Shim, “CURE: An efficient clustering algorithm for large databases,” ACM SIGMOD Record, vol. 27, no. 2, pp. 73–84, 1998.
[37]
M. L. Tian Zhang Raghu Ramakrishnan, “BIRCH: An efficient data clustering method for very large databases,” in ACM SIGMOD international conference on management of data, 1996, vol. 1, pp. 103–114.
[38]
R. C. Jancey, “Multidimensional group analysis,” Australian Journal of Botany, vol. 14, no. 1, pp. 127–130, 1966.
[39]
J. B. MacQueen, “Some methods for classification and analysis of multivariate observation,” in Proceedings of the fifth symposium of math, statistics, and probability. berkeley., 1967, pp. 281–297.
[40]
E. W. Forgy, “Cluster analysis of multivariate data: Efficiency versus interpretability of classifications.” 1965.
[41]
S. C. Johnson, “Hierarchical clustering schemes,” Psychometrika, vol. 32, no. 3, pp. 241–254, 1967.
[42]
A. K. Jain and R. C. Dubes, Algorithms for clustering data. Prentice Hall, 1988.
[43]
M. R. Anderberg, Cluster analysis for applications. Academic Press, 1973.
[44]
Cluster analysis: Correlation profile and orthometric (factor) analysis for the isolation of unities in mind and personality. Edwards Brothers: Ann Arbor, Michigan, 1939.
[45]
J. A. Zubin, “A technique for measuring likemindedness,” Journal of Abnormal and Social Psychology, vol. 33, pp. 508–516, 1938.
[46]
H. E. Driver and A. L. Kroeber, “Quantitative expression of cultural relationships,” University of California Publications in American Archaeology and Ethnology, vol. 31, no. 211–256, 1932.
[47]
C. J. Adcock, “A note on cluster-directed analysis,” Psychometrika, vol. 17, no. 3, pp. 249–253, 1952.
[48]
L. L. Thomas, “A cluster analysis of office operations,” Journal of Applied Psychology, vol. 36, no. 4, pp. 238–242, 1952.
[49]
F. E. Clements, “Use of cluster analysis with anthropological data,” American Anthropologist, vol. 56, no. 2, pp. 190–199, 1954.
[50]
A. K. Jain, “Data clustering: 50 years beyond k-means,” Pattern Recognition Letters, 2009.
[51]
Robert R. Sokal and P. H. A. Sneath, Principals of numerical taxonomy. W.H. Freeman; Company, 1963.
[52]
U. von Luxburg, “A tutorial on spectral clustering,” Statistics and Computing, vol. 17, p. 4, 2007, [Online]. Available: http://www.citebase.org/abstract?id=oai:arXiv.org:0711.0189.
[53]
J. Munkres, “Algorithms for the assignment and transportation problems,” Journal of the Society for Industrial and Applied Mathematics, vol. 5, no. 1, pp. 32–38, 1957.
[54]
P.-N. Tan, M. Steinbach, and V. Kumar, “Introduction to data mining,” Addison Wesley, 2005.
[55]
D. D. Lee and H. S. Seung, “Learning the parts of objects by non-negative matrix factorization,” Nature, vol. 401, no. 6755, pp. 788–91, 1999.
[56]
C. D. Meyer, “Matrix analysis and applied linear algebra,” 2nd ed., SIAM, 2001.
[57]
J. Shi and J. Malik, “Normalized cuts and image segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 8, pp. 888–905, 2000.
[58]
A. Ng, M. Jordan, and Y. Weiss, “On spectral clustering: Analysis and an algorithm.” 2001, [Online]. Available: citeseer.ist.psu.edu/ng01spectral.html.
[59]
D. Ziempekis and E. Gallopoulos, “PDDP(l): Towards a flexible principal direction divisive partitioning clustering,” in In proc. IEEE ICDM workshop on clustering large data sets, Nov. 2003, pp. 26–35.
[60]
D. Boley, “Principal direction divisive partitioning,” Data Mining and Knowledge Discovery, vol. 2, no. 4, pp. 325–344, 1998.
[61]
F. Chung, Spectral graph theory. American Mathematical Society, 1997.
[62]
H. W. Kuhn, “The hungarian method for the assignment problem,” Naval Research Logistics Quarterly, vol. 2, pp. 83–97, 1955.
[63]
M. W. Mahoney, “Randomized algorithms for matrices and data,” Foundations and Trends in Machine Learning, 2011.
[64]
M. Meila and J. Shi, “A random walks view of spectral segmentation,” 2001.
[65]
C. D. Meyer and C. D. Wessell, “Stochastic Data Clustering,” SIAM Journal on Matrix Analysis and Applications, vol. 33, no. 4, pp. 1214–1236, 2012, [Online]. Available: http://arxiv.org/abs/1008.1758.
[66]
C. Wessell, “Stochastic data clustering,” PhD thesis, North Carolina State University, 2011.
[67]
V. K. Pang-Ning Tan Michael Steinbach, Introduction to data mining. Pearson, 2006.
[68]
A. F. P. Deuflhard W. Huisinga, “Identification of almost invariant aggregates in reversible nearly uncoupled markov chains,” Linear Algebra and its Applications, vol. 315, pp. 39–59, 2000.
[69]
J. L. S. John G. Kemeny, Finite markov chains. Springer, 1976.
[70]
J. Kogan, “Introduction to clustering large and high-dimensional data,” Cambridge, New York: Cambridge University Press, 2007.
[71]
W. W. C. F. Lin, “Power iteration clustering,” Proceedings of the 27th International Conference of Machine Learning, 2010.
[72]
U. von Luxburg, “A tutorial on spectral clustering,” Statistics and Computing, vol. 17, p. 4, 2007, [Online]. Available: http://www.citebase.org/abstract?id=oai:arXiv.org:0711.0189.
[73]
W. J. Stewart, Probability, markov chains, queues, and simulation: The mathematical basis of performance modeling. Princeton University Press, 2009.