what-when-how
In Depth Tutorials and Information
20. Jon M. Kleinberg. Authoritative sources in a hyperlinked environment.
J. ACM
,
46(5):604-632, 1999.
21. Jon M. Kleinberg. Challenges in mining social network data: processes, privacy, and
paradoxes. In
KDD'07
, pp. 4-5, 2007.
22. Yehuda Koren, Stephen C. North, and Chris Volinsky. Measuring and extracting prox-
imity in networks. In
KDD'06
, pp. 245-255, 2006.
23. V. Krebs. http://www.orgnet.com/. 2006.
24. Ravi Kumar, Jasmine Novak, and Andrew Tomkins. Structure and evolution of online
social networks. In
KDD
, pages 611-617, 2006.
25. Vito Latora and Massimo Marchiori. Efficient behavior of small-world networks.
Phys.
Rev.Lett.
, 87, 2001.
26. K. Liu and E Terzi. Towards identity anonymization on graphs. In
Proceedingsofthe
ACMSIGMODConference
, Vancouver, Canada, 2008, ACM Press.
27. L. Lovasz. Random walks on graphs.
Combinatorics
, 2:1-46, 1993.
28. M. Newman. Detecting community structure in networks.
Eur.Phys.J.B—Condensed
Matter
, 38(2):321-330, March 2004.
29. Marcello Pelillo, Kaleem Siddiqi, and Steven W. Zucker. Matching hierarchical struc-
tures using association graphs.
IEEETrans.PatternAnal.Mach.Intell.
, 21(11):1105-
1120, 1999.
30. A.J. Seary and W.D. Richards. Spectral methods for analyzing and visualizing net-
works: an introduction.
NationalResearchCouncil,DynamicSocialNetworkModelling
andAnalysis:WorkshopSummaryandPapers
, pp. 209-228, 2003.
31. J. Shetty and J. Adibi. he Enron email dataset database schema and brief statistical
report.
InformationSciencesInstituteTechnicalReport,
University of Southern California,
2004.
32. Jianbo Shi and Jitendra Malik. Normalized cuts and image segmentation. In
Proceedings
of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
,.
Washington, DC, p. 731, IEEE Computer Society, 1997.
33. Motoki Shiga, Ichigaku Takigawa, and Hiroshi Mamitsuka. A spectral clustering
approach to optimally combining numerical vectors with a modular network. In
KDD'07
, pp. 647-656, 2007.
34. Ellen Spertus, Mehran Sahami, and Orkut Buyukkokten. Evaluating similarity mea-
sures: a large-scale study in the orkut social network. In
KDD'05
, pp. 678-684, 2005.
35. G. W. Stewart and Ji guang Sun.
Matrix Perturbation heory
. Academic Press, San
Diego, CA, 1990.
36. Chayant Tantipathananandh, Tanya Y. Berger-Wolf, and David Kempe. A framework for
community identification in dynamic social networks. In
KDD'07
, pp. 717-726, 2007.
37. Y. Wang, D. Chakrabarti, C. Wang, and C. Faloutsos. Epidemic spreading in real
networks: an eigenvalue viewpoint.
Proceedingsofthe22ndInternationalSymposiumon
ReliableDistributedSystems
, 2003. Florence, Italy.
38. Y. Weiss. Segmentation using eigenvectors: a unifying view. In
ProceedingsoftheIEEE
InternationalConferenceonComputerVision
, pp. 975-982, 1999. Corfu, Greece.
39. Scott White and Padhraic Smyth. Algorithms for estimating relative importance in
networks. In
KDD'03
, pp. 266-275, 2003. 9th ACM Conference on knowledge dis-
covery and data mining.
40. X. Ying and X. Wu. Randomizing social networks: a spectrum preserving approach. In
Proceedingsofthe8thSIAMConferenceonDataMining
, April 2008. Atlanta, Georgia.
