Graph Mining Meets the Semantic Web

Conference · Thu Jan 01 00:00:00 EST 2015

OSTI ID:1190754

Lee, Sangkeun ^[1]; Sukumar, Sreenivas R ^[1]; Lim, Seung-Hwan ^[1]

---

1. ORNL

The Resource Description Framework (RDF) and SPARQL Protocol and RDF Query Language (SPARQL) were introduced about a decade ago to enable flexible schema-free data interchange on the Semantic Web. Today, data scientists use the framework as a scalable graph representation for integrating, querying, exploring and analyzing data sets hosted at different sources. With increasing adoption, the need for graph mining capabilities for the Semantic Web has emerged. We address that need through implementation of three popular iterative Graph Mining algorithms (Triangle count, Connected component analysis, and PageRank). We implement these algorithms as SPARQL queries, wrapped within Python scripts. We evaluate the performance of our implementation on 6 real world data sets and show graph mining algorithms (that have a linear-algebra formulation) can indeed be unleashed on data represented as RDF graphs using the SPARQL query interface.

• Research Organization: Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
• Sponsoring Organization: USDOE Laboratory Directed Research and Development (LDRD) Program
• DOE Contract Number: DE-AC05-00OR22725
• OSTI ID: 1190754
• Resource Relation: Conference: Data Engineering meets the Semantic Web (DesWeb) Workshop in conjunction with ICDE 2015, Seoul, South Korea, 20150413, 20150413
• Country of Publication: United States
• Language: English