202
Bibliography
[38] L. Hagen and A.B. Kahng. New spectral methods for ratio cut partitioning
and clustering. IEEE Transactions on Computer-Aided Design of Integrated
Circuits and Systems, 11(9):1074–1085, 1992.
[39] C. Hilgetag, M.A. O’Neill, and M.P. Young. Hierarchical organization of
macaque and cat cortical sensory systems explored with a novel network processor. Philosophical Transactions of the Royal Society B: Biological Sciences, 355(1393):71–89, 2000.
[40] J. Huang, T. Zhu, and D. Schuurmans. Web communities identification from
random walks. In Knowledge Discovery in Databases: PKDD 2006, pages
187–198. Springer, 2006.
[41] M.S.T. Jaakkola and M. Szummer. Partially labeled classification with
Markov random walks. Advances in Neural Information Processing Systems
(NIPS), 14:945–952, 2002.
[42] T. Joachims. Transductive learning via spectral graph partitioning. In Proceedings of the 20th International Conference on Machine Learning, volume 3, pages 290–297, 2003.
[43] R. Kannan, S. Vempala, and A. Vetta. On clusterings: Good, bad and spectral.
Journal of the ACM (JACM), 51(3):497–515, 2004.
[44] M. Kas, K.M. Carley, and L. R. Carley. Incremental closeness centrality for
dynamically changing social networks. In Advances in Social Networks Analysis and Mining, 2013 IEEE/ACM International Conference on, pages 1250–
1258. IEEE, 2013.
[45] D.J. Klein and M. Randi´ c. Resistance distance. Journal of Mathematical
Chemistry, 12(1):81–95, 1993.
[46] A. Kumar and H. Daum. Co-training approach for multi-view spectral clustering. Computer, 94(5):393–400, 2011.
[47] A. Kumar, P. Rai, and H. Daume. Co-regularized multi-view spectral clustering. In Advances in Neural Information Processing Systems, pages 1413–
1421, 2011.
[48] J. Kunegis, S. Schmidt, A. Lommatzsch, J. Lerner, E.W. De Luca, and S. Albayrak. Spectral analysis of signed graphs for clustering, prediction and visualization. In SIAM International Conference on Data Mining, volume 10,
pages 559–559. SIAM, 2010.
[49] E.A. Leicht and M.E. Newman. Community structure in directed networks.
Physical Review Letters, 100(11):118703, 2008.
[50] J. Leskovec and C. Faloutsos. Sampling from large graphs. In Proceedings
of the 12th ACM SIGKDD International Conference on Knowledge Discovery
and Data Mining, pages 631–636. ACM, 2006.
Bibliography
[38] L. Hagen and A.B. Kahng. New spectral methods for ratio cut partitioning
and clustering. IEEE Transactions on Computer-Aided Design of Integrated
Circuits and Systems, 11(9):1074–1085, 1992.
[39] C. Hilgetag, M.A. O’Neill, and M.P. Young. Hierarchical organization of
macaque and cat cortical sensory systems explored with a novel network processor. Philosophical Transactions of the Royal Society B: Biological Sciences, 355(1393):71–89, 2000.
[40] J. Huang, T. Zhu, and D. Schuurmans. Web communities identification from
random walks. In Knowledge Discovery in Databases: PKDD 2006, pages
187–198. Springer, 2006.
[41] M.S.T. Jaakkola and M. Szummer. Partially labeled classification with
Markov random walks. Advances in Neural Information Processing Systems
(NIPS), 14:945–952, 2002.
[42] T. Joachims. Transductive learning via spectral graph partitioning. In Proceedings of the 20th International Conference on Machine Learning, volume 3, pages 290–297, 2003.
[43] R. Kannan, S. Vempala, and A. Vetta. On clusterings: Good, bad and spectral.
Journal of the ACM (JACM), 51(3):497–515, 2004.
[44] M. Kas, K.M. Carley, and L. R. Carley. Incremental closeness centrality for
dynamically changing social networks. In Advances in Social Networks Analysis and Mining, 2013 IEEE/ACM International Conference on, pages 1250–
1258. IEEE, 2013.
[45] D.J. Klein and M. Randi´ c. Resistance distance. Journal of Mathematical
Chemistry, 12(1):81–95, 1993.
[46] A. Kumar and H. Daum. Co-training approach for multi-view spectral clustering. Computer, 94(5):393–400, 2011.
[47] A. Kumar, P. Rai, and H. Daume. Co-regularized multi-view spectral clustering. In Advances in Neural Information Processing Systems, pages 1413–
1421, 2011.
[48] J. Kunegis, S. Schmidt, A. Lommatzsch, J. Lerner, E.W. De Luca, and S. Albayrak. Spectral analysis of signed graphs for clustering, prediction and visualization. In SIAM International Conference on Data Mining, volume 10,
pages 559–559. SIAM, 2010.
[49] E.A. Leicht and M.E. Newman. Community structure in directed networks.
Physical Review Letters, 100(11):118703, 2008.
[50] J. Leskovec and C. Faloutsos. Sampling from large graphs. In Proceedings
of the 12th ACM SIGKDD International Conference on Knowledge Discovery
and Data Mining, pages 631–636. ACM, 2006.