Graph mining based on a data partitioning approach

Nguyen, Son N., Orlowska, Maria E. and Li, Xue (2008). Graph mining based on a data partitioning approach. In: Alan Fekete and Xuemin Lin, Proceedings of the 19th Conference on Australasian Database (ADC 2008). Australasian Database Conference (ADC2008), Wollongong, Australia, (31-37). 22-25 January 2008.

Author Nguyen, Son N.
Orlowska, Maria E.
Li, Xue
Title of paper Graph mining based on a data partitioning approach
Conference name Australasian Database Conference (ADC2008)
Conference location Wollongong, Australia
Conference dates 22-25 January 2008
Convener Australian Computer Society
Proceedings title Proceedings of the 19th Conference on Australasian Database (ADC 2008)
Journal name Conferences in Research and Practice in Information Technology Series
Series Conferences in Research and Practice in Information Technology Series
Place of Publication Sydney, Australia
Publisher Australian Computer Society
Publication Year 2008
Sub-type Fully published paper
Open Access Status Not yet assessed
ISBN 9781920682569
ISSN 1445-1336
Editor Alan Fekete
Xuemin Lin
Volume 75
Start page 31
End page 37
Total pages 7
Language eng
Abstract/Summary Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph mining remains a challenging computational problem. In this paper, we present a new horizontal data partitioning framework for graph mining. The original dataset is divided into fragments, then each fragment is mined individually and the results are combined together to generate a global result. One of the challenging problems in graph mining is about the completeness because the of complexity graph structures. We will prove the completeness of our algorithm in this paper. The experiments will be conducted to illustrate the efficiency of our data partitioning approach.
Subjects E1
890205 Information Processing Services (incl. Data Entry and Capture)
080201 Analysis of Algorithms and Complexity
Keyword Subgraph
Graph mining
Algorithm
Q-Index Code E1
Q-Index Status Confirmed Code

 
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 4 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Fri, 17 Apr 2009, 07:44:32 EST by Ms Kimberley Nunes on behalf of School of Information Technol and Elec Engineering