DidaWiki

Questa pagina è in sola lettura. Puoi visualizzare il sorgente, ma non puoi modificarlo. Contatta l'amministratore se pensi che ci sia un errore.
====== Social and Information Networks ======

  * **Dino Pedreschi** Università di Pisa, Knowledge Discovery and Data Mining Lab [[pedre@di.unipi.it]]

===== News =====

  * 
====== Goals ======

Over the past decade there has been a growing public fascination with the complex "connectedness" of modern society. This connectedness is found in many contexts: in the rapid growth of the Internet and the Web, in the ease with which global communication now takes place, and in the ability of news and information as well as epidemics and financial crises to spread around the world with surprising speed and intensity. These are phenomena that involve networks and the aggregate behavior of groups of people; they are based on the links that connect us and the ways in which each of our decisions can have subtle consequences for the outcomes of everyone else.

This short course is an introduction to the analysis of complex networks, with a special focus on social networks and the Web - its structure and function, and how it can be exploited to search for information. Drawing on ideas from computing and information science, applied mathematics, economics and sociology, the course describes the emerging field of study 
that is growing at the interface of all these areas, addressing fundamental questions about how the social, economic, and technological worlds are connected.

====== Syllabus ====== 

1) Graph theory and social networks
  * Graphs
  * Social, information, biological and technological networks
  * Strong and weak ties
  * Networks in their surrounding context

2) The World Wide Web
  * The structure of the Web
  * Link analysis and Web search
  * Web mining e sponsored search markets

3) Network dynamics
  * Information cascades
  * Power laws and rich-get-richer phenomena
  * The small-world phenomenon
  * Epidemics




====== Textbooks ======

  * Slides (see Calendar).


  * **David Easley, Jon Kleinberg: Networks, Crowds, and Markets. [[http://www.cs.cornell.edu/home/kleinber/networks-book/]]**

Reading:

  * **M. E. J. Newman: The structure and function of complex networks**, SIAM Review, Vol. 45, p. 167-256, 2003. ({{:wma:newman_2003.pdf|download pdf}})

  * **A.-L. Barabasi. Linked. PLUME, Penguin Group, 2002.**

  * Duncan J. Watts.  //Six Degrees: The Science of a Connected Age.// Norton, New York,  2003.

  * Anand Rajaraman, Jeffrey D. Ullman, Mining of Massive Datasets. [[http://infolab.stanford.edu/~ullman/pub/book.pdf]]


====== Calendar ======

^ ^ Giorno ^ Argomento ^ Lucidi ^ Docente ^
|1.   |  Monday 03.10.2011 - 10:00-12:00 | Introduction to Social Network Analysis. Graph measures and real networks | {{:dm:sna.giannotti.1.ppt.pdf|}} {{:dm:sna.giannotti.2.ppt.pdf|}} {{:wma:lezione_cytoscape.pdf|}} |  |
|2.   |  Wednesday 05.10.2011 - 10:00-12:00  | Weak and strong ties. Centrality measures. Tools for SNA | Slides: {{:dm:sna.giannotti.3.pdf|}}. Reading: 1: {{:dm:pnas-2007-onnela-7332-6.pdf|}}   2: {{:dm:leskovec-im.pdf|}}  3: {{:dm:granstrengthweakties.pdf|}}  4: {{:dm:watts-smallworld2003.pdf|}}   5: {{:dm:travers69smallworld.pdf}}  | |
|3.   |  Friday 07.10.2011 - 14:00-16:00  | Community Discovery. Information diffusion | Slides: {{:dm:diffusion2.pdf|}}. Reading: 1: {{:dm:wanggonzalezhidalgobarabasi_science_2009_sm.pdf|}}, 2: {{:dm:christakis_dynamicspreadhappiness.pdf|}}, 3: {{:dm:viral.pdf|}}, 4: {{:dm:vespignani.pdf|}}, 5: {{:dm:20100801-coscia-communitydiscoveryreview.pdf|}} | |
|4.   |  Thursday 13.10.2011 - 10:00-12:00  | Graph models: random graphs, small world, preferential attachment.  |  | |
|5.   |  Friday 14.10.2011 - 14:00-16:00 | The structure of the Web. Web search | Slides: {{:dm:netevo.pdf|}}. Reading: 1: {{:dm:10.1.1.84.2158.pdf|}}, 2: {{:dm:kdd2010.pdf|}}, 3: {{:dm:kddlab-ccnr-kdd2011.pdf|}}, 4: {{:dm:knowledge_discovery_from_twitter.pdf|}} | |