Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/357594
Title: quotCommunity Detection In Social Networks Using Closeness Of Influencesquot
Researcher: Rohini, A
Guide(s): Sudalai Muthu, T
Keywords: Computer Science
Computer Science Artificial Intelligence
Engineering and Technology
University: Hindustan University
Completed Date: 2021
Abstract: Social Network Analysis is the process of analyzing the vertices and edges newlinein the social structure in terms of nodes (person, organization) or features of newlinethe particular things within the structural community and the relationship newlinebetween vertices are said to be the links (relationship or interaction) that newlineconnect them. These structures are visualized through analysis of social newlinenetworks provide a qualitatively assessing networks by varying the newlinerepresentation of their nodes and edges to spark the attributes of interest. It newlineinvolves the regularities in the patterning of relationship among social newlineentities, their relationships are strongly connected by the frequency of newlineinteractions between the processes of interactions in their daily activities, of newlineguidance, propagation of the job opportunities, cultural activities and so on, newlinetheir relationship is also based on the strong and week ties in social newlinenetwork. It characterizes networked structures in terms of nodes (individual newlineactors, people, or things within the network) and the ties, edges, newlineor links (relationships or interactions) that connect them. The Node is to be newlineoptimized to improve the Link availability, Clique through Rate, newlineEffectiveness of Link Usage. The Node optimization could be achieved by newlineoptimization of Links. Predicting techniques was used to best fit for the data newlineto predict the nodes decision, to improve the Influence Propagation and newlineRetrieve the Information from the requested users. The existing Link Prediction algorithms based on the uni-dimensional newlineparameters. As the performance of the community s depended on multiple newlineparameters in the social network environment, each parameter was to be newlinequantified in order to make the best trade among the parameters. Hence, a Node Proximity Clustering algorithm considered multi- dimensional newlineparameters along with node weight value to quantify the importance value newlineof the link prediction. The Node Proximity Clustering is designed by formulating weight w .
Pagination: 
URI: http://hdl.handle.net/10603/357594
Appears in Departments:Department of Computer Science and Engineering

Files in This Item:
File Description SizeFormat 
80_recommendation.pdfAttached File130.96 kBAdobe PDFView/Open
abstract.pdf23.13 kBAdobe PDFView/Open
ack.pdf32.91 kBAdobe PDFView/Open
certificate.pdf138.11 kBAdobe PDFView/Open
conclusion.pdf31.61 kBAdobe PDFView/Open
contents.pdf32.95 kBAdobe PDFView/Open
discussion.pdf38.46 kBAdobe PDFView/Open
fd.pdf39.34 kBAdobe PDFView/Open
introduction.pdf472.05 kBAdobe PDFView/Open
literature.pdf95 kBAdobe PDFView/Open
m&m.pdf778.07 kBAdobe PDFView/Open
references.pdf41.02 kBAdobe PDFView/Open
result.pdf396.46 kBAdobe PDFView/Open
tables.pdf46.63 kBAdobe PDFView/Open
title.pdf35.15 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: