Inference and Learning with Networked Data
published: Jan. 15, 2008, recorded: September 2007, views: 470
Report a problem or upload filesIf 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.
In many applications we would like to draw inferences about entities that are interconnected in complex networks. For example, calls, emails, IM, and web pointers link people into huge social networks. However, traditional statistical and machine learning classification methods assume that entities are independent of each other. I start by discussing various applications of "classification" (scoring) in networked data, from fraud detection to counterterrorism to network-based marketing. I then discuss four characteristics of networked data that allow improvements-- sometimes substantial--over traditional classification: (i) models can take into account "guilt by association," (ii) inference can be performed "collectively," whereby inferences on linked entities mutually reinforce each other, (iii) characteristics of linked entities can be incorporated in models, and (iv) models can incorporate specific identifiers, such as the identities of particular individuals, to improve inference. I present results demonstrating the effectiveness of these techniques.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !