There are no files associated with this item.
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.startPage | 120664 | - |
dc.citation.title | INFORMATION SCIENCES | - |
dc.citation.volume | 672 | - |
dc.contributor.author | Kim, Dahee | - |
dc.contributor.author | Kim, Song | - |
dc.contributor.author | Kim, Jeongseon | - |
dc.contributor.author | Kim, Junghoon | - |
dc.contributor.author | Feng, Kaiyu | - |
dc.contributor.author | Lim, Sungsu | - |
dc.contributor.author | Kim, Jungeun | - |
dc.date.accessioned | 2024-05-03T10:35:19Z | - |
dc.date.available | 2024-05-03T10:35:19Z | - |
dc.date.created | 2024-04-25 | - |
dc.date.issued | 2024-06 | - |
dc.description.abstract | Retrieving cohesive subgraphs in networks is a fundamental problem in social network analysis and graph data management. These subgraphs can be used for marketing strategies or recommendation systems. Despite the introduction of numerous models over the years, a systematic comparison of their performance, especially across varied network configurations, remains unexplored. In this study, we evaluated various cohesive subgraph models using taskbased evaluations and conducted extensive experimental studies on both synthetic and real-world networks. Thus, we unveil the characteristics of cohesive subgraph models, highlighting their efficiency and applicability. Our findings not only provide a detailed evaluation of current models but also lay the groundwork for future research by shedding light on the balance between the interpretability and cohesion of the subgraphs. This research guides the selection of suitable models for specific analytical needs and applications, providing valuable insights. | - |
dc.identifier.bibliographicCitation | INFORMATION SCIENCES, v.672, pp.120664 | - |
dc.identifier.doi | 10.1016/j.ins.2024.120664 | - |
dc.identifier.issn | 0020-0255 | - |
dc.identifier.scopusid | 2-s2.0-85192081151 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/82278 | - |
dc.identifier.wosid | 001239087000001 | - |
dc.language | 영어 | - |
dc.publisher | ELSEVIER SCIENCE INC | - |
dc.title | Experimental Analysis and Evaluation of Cohesive Subgraph Discovery | - |
dc.type | Article | - |
dc.description.isOpenAccess | FALSE | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.type.docType | Article | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | Community detection | - |
dc.subject.keywordAuthor | Cohesive subgraph discovery | - |
dc.subject.keywordAuthor | Social network analysis | - |
dc.subject.keywordPlus | EFFECTIVE COMMUNITY SEARCH | - |
dc.subject.keywordPlus | CLIQUES | - |
dc.subject.keywordPlus | NETWORKS | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Tel : 052-217-1404 / Email : scholarworks@unist.ac.kr
Copyright (c) 2023 by UNIST LIBRARY. All rights reserved.
ScholarWorks@UNIST was established as an OAK Project for the National Library of Korea.