Please use this identifier to cite or link to this item: http://localhost:8081/jspui/handle/123456789/2298
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPallavi-
dc.date.accessioned2014-09-27T06:11:08Z-
dc.date.available2014-09-27T06:11:08Z-
dc.date.issued2012-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/2298-
dc.guideNiyogi, Rajdeep-
dc.description.abstractSocial 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.en_US
dc.language.isoenen_US
dc.subjectNETWORK TOPOLOGYen_US
dc.subjectSOCIAL NETWORKen_US
dc.subjectLINK PREDICTION PROBLEMen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.titleA HEURISTIC APPROACH FOR INFERRING LINKS IN SOCIAL NETWORKen_US
dc.typeM.Tech Dessertationen_US
dc.accession.numberG22022en_US
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.