11:30 pm May 23rd, 2008 by wkallander
Review of:
Sharan, U. and Neville, J. 2007. Exploiting time-varying relationships in statistical relational models. In Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 Workshop on Web Mining and Social Network Analysis (San Jose, California, August 12 - 12, 2007). WebKDD/SNA-KDD ‘07. ACM, New York, NY, 9-15.
Read post.
Posted in ECS289M, Graphs | No Comments »
5:50 pm May 22nd, 2008 by wkallander
A review of:
Liben-Nowell, D. and Kleinberg, J. 2003. The link prediction problem for social networks. In Proceedings of the Twelfth international Conference on information and Knowledge Management (New Orleans, LA, USA, November 03 - 08, 2003). CIKM ‘03. ACM, New York, NY, 556-559.
Read post.
Posted in ECS289M, Graphs | 1 Comment »
4:05 pm May 12th, 2008 by wkallander
A review of:
Watts, Duncan J.; Dodds, Peter Sheridan; Newman, M. E. J., 2002. “Identity and Search in Social Networks”. Science, Volume 296, Issue 5571, pp. 1302-1305.
Read post.
Posted in ECS289M, Graphs | No Comments »
9:25 pm May 3rd, 2008 by wkallander
Posted in Covert Networks, ECS289M, Graphs, Research | 1 Comment »
2:18 am April 6th, 2008 by wkallander
A review of Network Mathematics: Why is it a Small World?, a talk given by Oskar Sandberg at Defcon 15.
Read post.
Posted in ECS289M, Graphs | No Comments »
10:01 pm April 5th, 2008 by wkallander
Reka Albert and Albert-Laszlo Barabasi wrote a seminal paper in 2001 that I have read recently, and am now just getting around to collecting my thoughts…
Read post.
Posted in ECS289M, Graphs | No Comments »
