Detailed Information

Cited 0 time in webofscience Cited 5 time in scopus
Metadata Downloads

cSketch: a novel framework for capturing cliques from big graph

Authors
Hao, FeiPark, Doo-Soon
Issue Date
Mar-2018
Publisher
Kluwer Academic Publishers
Keywords
cSketch; Formal concept analysis; k-Cliques; Big graph
Citation
Journal of Supercomputing, v.74, no.3, pp 1202 - 1214
Pages
13
Journal Title
Journal of Supercomputing
Volume
74
Number
3
Start Page
1202
End Page
1214
URI
https://scholarworks.bwise.kr/sch/handle/2021.sw.sch/6184
DOI
10.1007/s11227-017-2114-7
ISSN
0920-8542
1573-0484
Abstract
In analysis of ubiquitous networks, one critical work is to understand the internal structure of the networks. Many approaches are proposed to address the structure mining in the graph. Unfortunately, these approaches cannot cope with the big graph generated by large-scale streaming data. Aiming to mine the structure from the big graph, this paper presents an efficient mining framework, namely cSketch, which is used for capturing the cliques from big graph quickly. Two illustrative examples are conducted for demonstrating the feasibility and effectiveness of the proposed framework.
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

qrcode

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.

Altmetrics

Total Views & Downloads

BROWSE