Graph-based Methods for Social Search
published: March 18, 2011, recorded: September 2010, views: 3845
See Also:
Download slides: russir2010_troussov_gmss_part1.pdf (5.5 MB)
Download slides: russir2010_troussov_gmss_part2.pdf (1.3 MB)
Download slides: russir2010_troussov_gmss_part3.pdf (6.4 MB)
Related content
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Watch videos: (click on thumbnail to launch)
Description
Recent developments in Web 2.0 and Cyberinfrastructure technologies create massive computer mediated networks, where the nodes might be people as well as “non-human agents” such as documents, datasets, analytic tools, and concepts. And these networks become more and more “multidimensional”. Search exploits that links. Search becomes personal, collaborative, social. Network models are capable to aggregate heterogeneous information, graph-based methods provide clear intuition and elegant mathematic to mine such models. The course will provide review of modern graph-based methods, including methods of stochastic physics and clustering approaches needed to analyse the structure of complex networks exhibiting high clustering (such as in networks of friendships between individuals). We will present applications of these methods to mining of large volumes of heterogeneous information, and we will demonstrate how to make these methods aware of dimensions of networks where people are involved, including social, semantics, and activity management dimensions.
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !
Write your own review or comment: