By Topic

A Partition-Based Approach to Mining Link Patterns

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Xiang Zhang ; Sch. of Comput. Sci. & Eng., Southeast Univ., Nanjing, China ; Cuifang Zhao ; Sanfeng Zhang ; Peng Wang

Existing pattern mining algorithms typically assume that the dataset can fit into the main memory, while large graph datasets cannot satisfy this condition. Thus mining patterns in large-scale linked data is still a challenge. In this paper we propose a new partition-based approach for pattern mining in linked data which is composed of three steps: dividing linked data into connected typed object graphs, clustering graphs into clusters according to shared patterns and partitioning clusters into size-limited units. A global pattern mining algorithm is proposed, which is used to merge local link patterns into global patterns. Experiments on Semantic Web Dog Food dataset show that our approach is feasible and promising.

Published in:

Computer Science & Service System (CSSS), 2012 International Conference on

Date of Conference:

11-13 Aug. 2012