Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/2298
Title: A HEURISTIC APPROACH FOR INFERRING LINKS IN SOCIAL NETWORK
Authors: Pallavi
Keywords: NETWORK TOPOLOGY;SOCIAL NETWORK;LINK PREDICTION PROBLEM;ELECTRONICS AND COMPUTER ENGINEERING
Issue Date: 2012
Abstract: Social Networking Sites are experiencing a rapid growth; there seems to be no limit to their size. Many Social Networking Sites boast with millions of members using their networks on regular basis to communicate, share, create, and collaborate with others. Size of Social networks are changing over time because of addition and deletion of nodes and edges. Given a snapshot of a social network at some moment of time, the link prediction problem is the problem of inferring the new links of the network at some later moment. Existing methods for inferring the links is based solely on the information based on the network topology.. In this paper we suggest a method that uses some extra information besides that given in the network topology. We assume that such information (represented as a knowledge dependency graph) may be obtained from an expert system (or human expertise). We consider the co-authorship domain, and illustrate our method using this domain.
URI: http://hdl.handle.net/123456789/2298
Other Identifiers: M.Tech
Research Supervisor/ Guide: Niyogi, Rajdeep
metadata.dc.type: M.Tech Dessertation
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECDG22022.pdf2.01 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.