By Topic

MinG: An efficient algorithm to mine graphs for semantic associations

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

2 Author(s)
Hassan, Z. ; Dept. of Comput. Sci., Mohammad Ali Jinnah Univ., Islamabad, Pakistan ; Qadir, M.A.

Data in semantic web is modelled in terms of directed labelled graph. Vertices of that graph represent entities and edges represent relationships between those entities. Semantic web allows the discovery of relations between entities using the ρ-operators. In this paper an algorithm to answer ρ-operators, that is, to find all paths between any two nodes from a graph is proposed. The algorithm is based on ρ-index, an indexing scheme presented in the PhD thesis of Barton. Our algorithm reduces the computational and space complexity of indexing by not creating a special type of adjacency matrix called Path Type Matrix at each level of indexing which Barton's algorithm did. We only need Path Type Matrices at first and last level of indexing. Thus if an indexing has 100 levels, Barton requires Path Type Matrices at each level and we only require Path Type Matrices at level 1 and level 100.

Published in:

Computer Networks and Information Technology (ICCNIT), 2011 International Conference on

Date of Conference:

11-13 July 2011