k-Cliques mining in dynamic social networks based on triadic formal concept analysis
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hao, Fei | - |
dc.contributor.author | Park, Doo-Soon | - |
dc.contributor.author | Min, Geyong | - |
dc.contributor.author | Jeong, Young-Sik | - |
dc.contributor.author | Park, Jong-Hyuk | - |
dc.date.accessioned | 2021-08-11T16:45:21Z | - |
dc.date.available | 2021-08-11T16:45:21Z | - |
dc.date.issued | 2016-10-12 | - |
dc.identifier.issn | 0925-2312 | - |
dc.identifier.issn | 1872-8286 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/sch/handle/2021.sw.sch/8677 | - |
dc.description.abstract | Internet of Things (IoT), an emerging computing paradigm which interconnects various ubiquitous things is facilitating the advancement of computational intelligence. This paper aims at investigating the computation intelligence extraction approach with focus on the dynamic k-clique mining that is an important issue in social network analysis. The k-clique detection problem as one of the fundamental problems in computer science, can assist us to understand the organization style and behavioral patterns of users in social networks. However, real social networks usually evolve over time and it remains a challenge to efficiently detect the k-cliques from dynamic social networks. To address this challenge, this paper proposes an efficient k-clique dynamic detection theorem based on triadic formal concept analysis (TFCA) with completed mathematical proof. With this proposed detection theorem, we prove that the k-cliques detection problem is equivalent to finding the explicit k-cliques generated from k-triadic equiconcepts plus the implicit k-cliques derived from its high-order triadic equiconcepts. Theoretical analysis and experimental results illustrate that the proposed detection algorithm is efficient for finding the k-cliques and exploring the dynamic characteristics of the sub-structures in social networks. (C) 2016 Elsevier B.V. All rights reserved. | - |
dc.format.extent | 10 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Elsevier BV | - |
dc.title | k-Cliques mining in dynamic social networks based on triadic formal concept analysis | - |
dc.type | Article | - |
dc.publisher.location | 네델란드 | - |
dc.identifier.doi | 10.1016/j.neucom.2015.10.141 | - |
dc.identifier.scopusid | 2-s2.0-84977495778 | - |
dc.identifier.wosid | 000401344900007 | - |
dc.identifier.bibliographicCitation | Neurocomputing, v.209, pp 57 - 66 | - |
dc.citation.title | Neurocomputing | - |
dc.citation.volume | 209 | - |
dc.citation.startPage | 57 | - |
dc.citation.endPage | 66 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordAuthor | Clique | - |
dc.subject.keywordAuthor | Triadic formal context | - |
dc.subject.keywordAuthor | Dynamic social network | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(31538) 22, Soonchunhyang-ro, Asan-si, Chungcheongnam-do, Republic of Korea+82-41-530-1114
COPYRIGHT 2021 by SOONCHUNHYANG UNIVERSITY ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.