AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (1.2 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access

Pattern Mining in Linked Data by Edge-Labeling

School of Computer Science and Engineering, Southeast University, Nanjing 210096, China.
Show Author Information

Abstract

Link patterns are consensus practices characterizing how different types of objects are typically interlinked in linked data. Mining link patterns in large-scale linked data has been inefficient due to the computational complexity of mining algorithms and memory limitations. To improve scalability, partitioning strategies for pattern mining have been proposed. But the efficiency and completeness of mining results are still under discussion. In this paper we propose a novel partitioning strategy for mining link patterns in large-scale linked data, in which linked data is partitioned according to edge-labeling rules: Edges are grouped into a primary multi-partition according to edge labels. A feedback mechanism is proposed to produce a secondary bi-partition according to a quick mining process. Local discovered link patterns in partitions are then merged into global patterns. Experiments show that our partition strategy is feasible and efficient.

References

【1】
【1】
 
 
Tsinghua Science and Technology
Pages 168-175

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Zhang X, Cheng W. Pattern Mining in Linked Data by Edge-Labeling. Tsinghua Science and Technology, 2016, 21(2): 168-175. https://doi.org/10.1109/TST.2016.7442500

945

Views

62

Downloads

1

Crossref

N/A

Web of Science

2

Scopus

0

CSCD

Received: 25 January 2016
Accepted: 01 March 2016
Published: 31 March 2016
© The author(s) 2016