Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/2551
Full metadata record
DC FieldValueLanguage
dc.contributor.authorTamilselvan, R-
dc.contributor.authorPrabhu, A-
dc.contributor.authorRajagopal, R-
dc.date.accessioned2023-12-18T09:45:35Z-
dc.date.available2023-12-18T09:45:35Z-
dc.date.issued2023-
dc.identifier.citationChapter 9; pp. 147-162en_US
dc.identifier.isbn9781394175253-
dc.identifier.isbn9781394174584-
dc.identifier.urihttps://doi.org/10.1002/9781394175253.ch9-
dc.identifier.urihttp://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/2551-
dc.description.abstractWhen given a large-scale set of data, data analysis becomes more difficult. Identifying societies or consumers’ shared interests is particularly important for social network analysis. The enhanced information grouping for basic in interpersonal organization examination utilized in planning high dimensional information for successful information mining. The refined chart development in many existing works uses content of information as it were. The visual appraisal of information comprises of boisterous and scanty issue happen in refined diagram which makes the subsequent chart shaky and untrustworthy. Web-based media network information additionally contain connect data which gives comprises of (1) diagram development high-dimensional, quality worth information, for example, Facebook posts, tweets, remarks, and pictures, and (2) connected information that portrays the connections between web-based media clients just as who post the posts, and so on Existing works use the information interface for information bunching frequently inadequate, which means after effect of refined diagram are fragmented. The web-based media organization, the substance information regularly contains an enormous number of pointless highlights. The mind-boggling exercises of countless clients might create countless loud and inadequate of highlights. This paper proposes another k-means algorithm for huge information grouping utilizing refined chart in web-based media organization, utilizes an information bunching to track down the quantity of bunches in information. In this methodology we proposed algorithm for new k-means are shifts back and forth between two stages: In an element choice initial step, for observe the most agent subset of information grouping a transitional diagram instated with interface information. The second step for last coming about chart, which alluded to a refined diagram then, at that point, utilized informal organization information. A refined diagram bunching technique utilized on both the substance information and connection information. We efficiently plan and lead precise investigations to assess the proposed structure on datasets from true web-based media sites. © 2023 Scrivener Publishing LLC.en_US
dc.language.isoenen_US
dc.publisherWileyen_US
dc.subjectClustering, social networken_US
dc.subjectDistilled graphen_US
dc.subjectHigh dimensionalen_US
dc.subjectSocial media dataen_US
dc.titleAn Enhanced K-Means Algorithm For Large Data Clustering In Social Media Networksen_US
dc.typeBook chapteren_US
Appears in Collections:Book/ Book Chapters

Files in This Item:
There are no files associated with this item.


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