<P>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....
http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
https://www.riss.kr/link?id=A107467710
Hao, F. ; Pei, Z. ; Park, D.S. ; Yang, L.T. ; Jeong, Y.S. ; Park, J.H.
2017
-
SCIE,SCOPUS
학술저널
101-110(10쪽)
0
상세조회0
다운로드다국어 초록 (Multilingual Abstract)
<P>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....
<P>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.</P>