Detection of Maximal Balance Clique Using Three-way Concept Lattice
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yixuan Yang | - |
dc.contributor.author | 박두순 | - |
dc.contributor.author | Fei Hao | - |
dc.contributor.author | Sony Peng | - |
dc.contributor.author | 이혜정 | - |
dc.contributor.author | 홍민표 | - |
dc.date.accessioned | 2023-05-25T07:41:02Z | - |
dc.date.available | 2023-05-25T07:41:02Z | - |
dc.date.issued | 2023-04 | - |
dc.identifier.issn | 1976-913X | - |
dc.identifier.issn | 2092-805X | - |
dc.identifier.uri | https://scholarworks.bwise.kr/sch/handle/2021.sw.sch/22506 | - |
dc.description.abstract | In the era marked by information inundation, social network analysis is the most important part of big dataanalysis, with clique detection being a key technology in social network mining. Also, detecting maximalbalance clique in signed networks with positive and negative relationships is essential. In this paper, we presenttwo algorithms. The first one is an algorithm, MCDA1, that detects the maximal balance clique using theimproved three-way concept lattice algorithm and object-induced three-way concept lattice (OE-concept). Thesecond one is an improved formal concept analysis algorithm, MCDA2, that improves the efficiency ofmemory. Additionally, we tested the execution time of our proposed method with four real-world datasets. | - |
dc.format.extent | 14 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | 한국정보처리학회 | - |
dc.title | Detection of Maximal Balance Clique Using Three-way Concept Lattice | - |
dc.title.alternative | Detection of Maximal Balance Clique Using Three-way Concept Lattice | - |
dc.type | Article | - |
dc.publisher.location | 대한민국 | - |
dc.identifier.doi | 10.3745/JIPS.01.0094 | - |
dc.identifier.scopusid | 2-s2.0-85161281757 | - |
dc.identifier.wosid | 001001827400004 | - |
dc.identifier.bibliographicCitation | JIPS(Journal of Information Processing Systems), v.19, no.2, pp 189 - 202 | - |
dc.citation.title | JIPS(Journal of Information Processing Systems) | - |
dc.citation.volume | 19 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 189 | - |
dc.citation.endPage | 202 | - |
dc.type.docType | Article | - |
dc.identifier.kciid | ART002955314 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.description.journalRegisteredClass | esci | - |
dc.description.journalRegisteredClass | kci | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.subject.keywordAuthor | Formal Concept Analysis | - |
dc.subject.keywordAuthor | Maximal Balanced Clique | - |
dc.subject.keywordAuthor | Signed Networks | - |
dc.subject.keywordAuthor | Three-Way Concept | - |
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.