计算机科学 ›› 2015, Vol. 42 ›› Issue (10): 266-270.

• 人工智能 • 上一篇    下一篇

一种基于聚类模式的RDF数据聚类方法

袁柳,张龙波   

  1. 陕西师范大学计算机科学学院 西安710062,山东理工大学计算机科学与技术学院 淄博255049
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受国家自然科学基金项目:云计算环境下旅游信息个性化服务模型研究(41271387)资助

Cluster Pattern Based RDF Data Clustering Method

YUAN Liu and ZHANG Long-bo   

  • Online:2018-11-14 Published:2018-11-14

摘要: 如何有效管理并利用日益庞大的RDF数据是当今Web数据管理领域面临的挑战之一。对大规模的RDF数据集进行聚类操作从而得到数据集的有效划分是RDF数据存储和应用时通常采取的策略。针对现有RDF聚类过程中忽略RDF三元组自身模式特征的问题,在对RDF聚类结果的形式深入分析的基础上,定义了3种不同类型的聚类模式,从而提出基于模式的聚类方法。通过对RDF数据集的重新描述,自动生成适用于RDF数据集特征的聚类模式,在此基础上实现数据聚类的任务。在不同测试集上的实验结果验证了所提方法的正确性和有效性。

关键词: RDF,聚类,开放关联数据,聚类模式

Abstract: How to manage and exploit the large mount of RDF dataset availably has become a vital issue in Web data management field.In order to partition the large scale RDF dataset for efficient data processing,clustering is usually adopted.The related researches tend to use classical clustering methods,and neglect the structure features of RDF triples.This paper analyzed the RDF clustering results intensively,and defined three types of cluster patterns.Based on the cluster patterns,a novel RDF data clustering strategy was proposed.By redescribing the RDF dataset,the cluster patterns can be generated automatically.The experiments on different test benches prove the accuracy and efficiency of the new method.

Key words: RDF,Clustering,Linked open data,Clustering pattern

[1] Bizer C,Heath T,Berners-Lee T,et al.Linked data on the Web[C]∥Proceedings of the 17th International Conference on World Wide Web.2008:1265-1266
[2] Tran T,Wang H,Haase P.Hermes:Data web search on a pay-as-you-go integration infrastructure[J].Web Semantics:Science,Services and Agents on the World Wide Web,2009,7(3):189-203
[3] Zeng K,Yang J,et al,A distributed graph engine for web scale rdf data[C]∥Proceedings of the 39th International Conference on Very Large Data Bases.2013:265-276
[4] Wu A Y,Garland M,Han J.Mining scale-free networks usinggeodesic clustering[C]∥Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.2004:719-724
[5] Kaushik R,Shenoy P,Bohannon P,et al.Exploiting local similarity for indexing paths in graph-structured data[C]∥ Procee-dings of the 18th International Conference on Data Engineering.2002:129-140
[6] Konrath M,Gottron T,Staab S,et al.Schemex efficient con-struction of a data catalogue by stream-based indexing of linked data[J].Web Semantics:Science,Services and Agents on the World Wide Web,2012,16:52-58
[7] Bohm C,Lorey J,Naumann F.Creating void descriptions forWeb-scale data[J].Web Semantics:Science,Services and Agents on the World Wide Web,2011,9(3):339-345
[8] Fanizzi N,d’Amato C.A hierarchical clustering method for se-mantic knowledge bases[C]∥Proceedings of KES 2007.2007:653-660
[9] Grimnes G A,Edwards P,Preece A D.Instance based clustering of semantic web resources[C]∥Proceedings of ESWC 2008.2008:303-317
[10] Alzogbi A,Lausen G.Similar structures inside rdf-graphs[C]∥Proceedings of Proceedings of the WWW 2013 Workshop on Linked Data on the Web.2013
[11] Ahn Y Y,Bagrow J P,Lehmann S.Link communities revealmultiscale complexity in networks[J].Nature,2010,466(7307):761-764
[12] 杜小勇,王琰,吕彬.语义Web数据管理研究进展[J].软件学报,2009,20(11):2050-2964 Du Xiao-yong,Wang Yan,Lv Bin.Research and Develompment on Semantic Web Data Management[J].Journal of Software,2009,20(11):2050-2964
[13] Guo Yuan-bo,Pan Zheng-xiang,Jeff H.LUBM:A Benchmark for OWL Knowledge Base Systems[J].Web Semantics,2005,3(2):158-182
[14] Schmidt M,Hornung T,Lausen G,et al.SP2Bench:a SPARQL performance benchmark[M].Semantic Web Information Management.2010:371-393
[15] 杜芳,陈跃国,杜小勇.RDF数据查询处理技术综述[J].软件学报,2013,4(6):1222-1242 Du Fang,Chen Yue-guo,Du Xiao-yong.Survey of RDF Query Processing Techniques[J].Journal of Software,2013,4(6):1222-1242
[16] 李慧颖,瞿裕忠.KREAG:基于实体三元组关联图的RDF数据关键词查询方法[J].计算机学报,2011,34(5):825-836Li Hui-ying,Qu Yu-zhong.KREAG:Keyword Query App-roach over RDF Data based on Entity-Triple Association Graph[J].Chinese Journal of Computers,2011,34(5):825-836

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!