Fetching the paper…
Reading the bibliography…
Directed graphs have asymmetric connections, yet the current graph clustering methodologies cannot identify the potentially global structure of these asymmetries.
Spectral clustering and the high-dimensional stochastic blockmodel
Rohe, K., Chatterjee, S., and Yu, B. (2011) · 1915
Earlier work this paper cites.
A connection between correlation and contingency
Hirschfeld, H. (1935) · 1935
Earlier work this paper cites.
Sur la division des corp materiels en parties
Steinhaus, H. (1956) · 1956
Earlier work this paper cites.
Metricizing rank-ordered or unordered data for a linear factor analysis
Guttman, L. (1959) · 1960
Earlier work this paper cites.
Direct clustering of a data matrix
Hartigan, J. (1972) · 1972
Earlier work this paper cites.
Algebraic connectivity of graphs
Fiedler, M. (1973) · 1973
Earlier work this paper cites.
Social structure from multiple networks. I. Blockmodels of roles and positions
White, H., Boorman, S., and Breiger, R. (1976) · 1976
Earlier work this paper cites.
Stochastic blockmodels: Some first steps
Holland, P., Laskey, K., and Leinhardt, S. (1983) · 1983
Earlier work this paper cites.
Some useful extensions of the usual correspondence analysis approach and the usual log-linear models approach in the analysis of contingency tables
Goodman, L. A. (1986) · 1986
Earlier work this paper cites.
The structure of the nervous system of the nematode caenorhabditis elegans
White, J. G., Southgate, E., Thomson, J. N., and Brenner, S. (1986) · 1986
Earlier work this paper cites.
Stochastic blockmodels for directed graphs
Wang, Y. and Wong, G. (1987) · 1987
Earlier work this paper cites.
Correspondence and canonical analysis of relational data
Wasserman, S., Faust, K., and Galaskiewicz, J. (1990) · 1990
Earlier work this paper cites.
Building stochastic blockmodels
Anderson, C. J., Wasserman, S., and Faust, K. (1992) · 1992
Earlier work this paper cites.
Spectral graph theory
Chung, F. (1997) · 1997
Earlier work this paper cites.
Authoritative sources in a hyperlinked environment
Kleinberg, J. (1999) · 1999
Earlier work this paper cites.
The pagerank citation ranking: Bringing order to the web
Page, L., Brin, S., Motwani, R., and Winograd, T. (1999) · 1999
Earlier work this paper cites.
Random matrix approximation of spectra of integral operators
Koltchinskii, V. and Giné, E. (2000) · 2000
Earlier work this paper cites.
Co-clustering documents and words using bipartite spectral graph partitioning
Dhillon, I. (2001) · 2001
Earlier work this paper cites.
Spectral partitioning of random graphs
McSherry, F. (2001) · 2001
Earlier work this paper cites.
Latent space approaches to social network analysis
Hoff, P., Raftery, A., and Handcock, M. (2002) · 2002
Earlier work this paper cites.
The political blogosphere and the 2004 us election: divided they blog
Adamic, L. A. and Glance, N. (2005) · 2004
Earlier work this paper cites.
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Banerjee, A., Dhillon, I., Ghosh, J., Merugu, S., and Modha, D. (2004) · 2004
Earlier work this paper cites.
Spectral analysis of random graphs with skewed degree distributions
Dasgupta, A., Hopcroft, J. E., and McSherry, F. (2004) · 2004
Earlier work this paper cites.
Trained named entity recognition using distributional clusters
Freitag, D. (2004) · 2004
Earlier work this paper cites.
A simple linear time (1+ ε \varepsilon )-approximation algorithm for geometric k-means clustering in any dimensions
Kumar, A., Sabharwal, Y., and Sen, S. (2004) · 2004
Cited alongside, same era.
Biclustering algorithms for biological data analysis: a survey
Madeira, S. and Oliveira, A. (2004) · 2004
Cited alongside, same era.
Towards full automation of lexicon construction
Rohwer, R. and Freitag, D. (2004) · 2004
Cited alongside, same era.
Revealing modularity and organization in the yeast molecular network by integrated analysis of highly heterogeneous genomewide data
Tanay, A., Sharan, R., Kupiec, M., and Shamir, R. (2004) · 2004
Cited alongside, same era.
Matrix analysis
Horn, R. and Johnson, C. (2005) · 2005
Cited alongside, same era.
Biclustering algorithms: A survey
Tanay, A., Sharan, R., and Shamir, R. (2005) · 2005
[r] k-means++. https://stat.ethz.ch/pipermail/r-help/2012-January/300051.html
Borchers, H. W. (2012) · 2012
Closest in time.
Spectral clustering of graphs with general degrees in the extended planted partition model
Chaudhuri, K., Graham, F. C., and Tsiatas, A. (2012) · 2012
Closest in time.
Fitting community models to large sparse networks
Chen, A., Amini, A. A., Bickel, P. J., and Levina, E. (2012) · 2012
Closest in time.
Stochastic blockmodels with growing number of classes
Choi, D., Wolfe, P., and Airoldi, E. (2012) · 2012
Closest in time.
Flynn, C. J. and Perry, P. O. (2012) · 2012
Closest in time.
The connectome of a decision-making neural network
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Local graph partitioning using pagerank vectors
Andersen, R., Chung, F., and Lang, K. (2006) · 2006
Cited alongside, same era.
Complex graphs and networks
Chung, F. R. K. and Lu, L. (2006) · 2006
Cited alongside, same era.
Multivariate analysis: The french way
Holmes, S. (2006) · 2006
Cited alongside, same era.
Graph limits and exchangeable random graphs
Diaconis, P. and Janson, S. (2007) · 2007
Cited alongside, same era.
A tutorial on spectral clustering
von Luxburg, U. (2007) · 2007
Cited alongside, same era.
Strategies for cleaning organizational emails with an application to enron email dataset
Zhou, Y., Goldberg, M., Magdon-Ismail, M., and Wallace, W. (2007) · 2007
Cited alongside, same era.
Jarrell, T. A., Wang, Y., Bloniarz, A. E., Brittin, C. A., Xu, M., Thomson, J. N., Albertson, D. G., Hall, D. H., and Emmons, S. W. (2012) · 2012
Closest in time.
Co-clustering for directed graphs; the stochastic co-blockmodel and a spectral algorithm
Rohe, K. and Yu, B. (2012) · 2012
Closest in time.
The highest dimensional stochastic blockmodel with a regularized estimator
Rohe, K., Qin, T., and Fan, H. (2012) · 2012
Closest in time.
A consistent adjacency spectral embedding for stochastic blockmodel graphs
Sussman, D. L., Tang, M., Fishkind, D. E., and Priebe, C. E. (2012) · 2012
Closest in time.
Consistency of community detection in networks under degree-corrected stochastic block models
Zhao, Y., Levina, E., and Zhu, J. (2012) · 2012
Closest in time.
Tapes reveal enron took a role in crisis
Egan, T. (2005) · 2013
Closest in time.
Spectral redemption in clustering sparse networks
Krzakala, F., Moore, C., Mossel, E., Neeman, J., Sly, A., Zdeborová, L., and Zhang, P. (2013) · 2013
Closest in time.
Point process modelling for directed interaction networks
Perry, P. O. and Wolfe, P. J. (2013) · 2013
Closest in time.
Regularized spectral clustering under the degree-corrected stochastic blockmodel
Qin, T. and Rohe, K. (2013) · 2013
Closest in time.
Role of normalization in spectral clustering for stochastic blockmodels
Sarkar, P. and Bickel, P. J. (2013) · 2013
Closest in time.
Enron — Wikipedia, the free encyclopedia
Wikipedia (2013) · 2013
Closest in time.
Community detection in networks using graph distance
Bhattacharyya, S. and Bickel, P. J. (2014) · 2014
Closest in time.
Impact of regularization on spectral clustering
Joseph, A. and Yu, B. (2014) · 2014
Closest in time.
Co-clustering separately exchangeable network data
Wolfe, P. and Choi, D. (2014) · 2014
Closest in time.
Fast community detection by score
Jin, J. (2015) · 2015
Closest in time.
Consistency of spectral clustering in stochastic block models
Lei, J. and Rinaldo, A. (2015) · 2015
Closest in time.
Consistency of spectral clustering in sparse stochastic block models
Lei, J. and Rinaldo, A. (2013) · 2050
Closest in time.
Pseudo-likelihood methods for community detection in large sparse networks
Amini, A. A., Chen, A., Bickel, P. J., Levina, E., et al · 2097
Closest in time.