Iceberg Clique queries in large graphs
- Authors
- Hao, Fei; Pei, Zheng; Park, Doo-Soon; Yang, Laurence T.; Jeong, Young-Sik; Park, Jong-Hyuk
- Issue Date
- 20-Sep-2017
- Publisher
- Elsevier BV
- Keywords
- Iceberg concept lattice; Iceberg Clique; Formal context
- Citation
- Neurocomputing, v.256, pp 101 - 110
- Pages
- 10
- Journal Title
- Neurocomputing
- Volume
- 256
- Start Page
- 101
- End Page
- 110
- URI
- https://scholarworks.bwise.kr/sch/handle/2021.sw.sch/7208
- DOI
- 10.1016/j.neucom.2015.12.142
- ISSN
- 0925-2312
1872-8286
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > Department of Computer Software Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.