Iceberg Clique queries in large graphs
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hao, Fei | - |
dc.contributor.author | Pei, Zheng | - |
dc.contributor.author | Park, Doo-Soon | - |
dc.contributor.author | Yang, Laurence T. | - |
dc.contributor.author | Jeong, Young-Sik | - |
dc.contributor.author | Park, Jong-Hyuk | - |
dc.date.accessioned | 2021-08-11T14:24:25Z | - |
dc.date.available | 2021-08-11T14:24:25Z | - |
dc.date.issued | 2017-09-20 | - |
dc.identifier.issn | 0925-2312 | - |
dc.identifier.issn | 1872-8286 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/sch/handle/2021.sw.sch/7208 | - |
dc.description.abstract | This paper investigates the Iceberg Clique (IC) queries in a large graph, specially, given a user-specified threshold theta, an IC query reports the cliques where the number of vertices exceeds left perpendicular theta|V| right perpendicular. Toward this end, a practical IC query theorem is formally proposed and proved. With this proposed query theorem, a formal context and its corresponding iceberg concept lattice are first constructed from an input graph topology by Modified Adjacency Matrix; then, we prove that the IC queries problem is equivalent to finding the iceberg equiconcepts whose number of elements exceeds left perpendicular theta|V| right perpendicular. Theoretical analysis and experimental results demonstrate that the proposed query algorithm is feasible and efficient for finding the iceberg cliques from large graphs. (C) 2017 Published by Elsevier B.V. | - |
dc.format.extent | 10 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Elsevier BV | - |
dc.title | Iceberg Clique queries in large graphs | - |
dc.type | Article | - |
dc.publisher.location | 네델란드 | - |
dc.identifier.doi | 10.1016/j.neucom.2015.12.142 | - |
dc.identifier.scopusid | 2-s2.0-85019657800 | - |
dc.identifier.wosid | 000404198500011 | - |
dc.identifier.bibliographicCitation | Neurocomputing, v.256, pp 101 - 110 | - |
dc.citation.title | Neurocomputing | - |
dc.citation.volume | 256 | - |
dc.citation.startPage | 101 | - |
dc.citation.endPage | 110 | - |
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.keywordAuthor | Iceberg concept lattice | - |
dc.subject.keywordAuthor | Iceberg Clique | - |
dc.subject.keywordAuthor | Formal context | - |
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.