Discovering and Ranking Semantic Associations over a Large RDF Metabase - PowerPoint PPT Presentation

1 / 13
About This Presentation
Title:

Discovering and Ranking Semantic Associations over a Large RDF Metabase

Description:

Cannot expect users to sift through resulting associations ... on Semantic Web and Databases, Berlin, Germany, September 7-8, 2003; pp. 33-50 ... – PowerPoint PPT presentation

Number of Views:31
Avg rating:3.0/5.0
Slides: 14
Provided by: chrishalas3
Category:

less

Transcript and Presenter's Notes

Title: Discovering and Ranking Semantic Associations over a Large RDF Metabase


1
Discovering and Ranking Semantic Associations
over a Large RDF Metabase
  • Chris Halaschek, Boanerges Aleman-Meza, I. Budak
    Arpinar, Amit P. Sheth
  • 30th International Conference on
  • Very Large Data Bases
  • (Demonstration Paper)

2
Semantic Association Example
The University of Georgia
name
r1
r6
worksFor
associatedWith
r5
name
LSDIS Lab
3
Motivation
  • Query between Hubwoo Company and SONERI
    Bank results in 1,160 associations (query over
    SWETO testbed)
  • Cannot expect users to sift through resulting
    associations
  • Results must be presented to users in a relevant
    fashionneed ranking

4
Ranking Overview
  • Define association rank as a function of several
    ranking criteria
  • Two Categories
  • Semantic based on semantics provided by
    ontology
  • Context
  • Subsumption
  • Trust
  • Statistical based on statistical information
    from ontology, instances and associations
  • Rarity
  • Popularity
  • Association Length

5
Overall Ranking Criterion
  • Overall Association Rank of a Semantic
    Association is a linear function
  • Ranking
  • Score
  • where ki adds up to 1.0
  • Allows a flexible ranking criteria

k1 Context k2 Subsumption k3 Trust k4
Rarity k5 Popularity k6 Association
Length

6
System Implementation
  • Ranking approach has been implemented within the
    LSDIS Labs SemDIS2 and SAI3 projects

2 NSF-ITR-IDM Award 0325464, titled SemDIS
Discovering Complex Relationships in the Semantic
Web. 3 NSF-ITR-IDM Award 0219649, titled
Semantic Association Identification and
Knowledge Discovery for National Security
Applications.
7
System Implementation
  • Native main memory data structures for
    interaction with RDF graph
  • Naïve depth-first search algorithm for
    discovering Semantic Associations
  • SWETO (subset) has been used for data set
  • Approximately 50,000 entities and 125,000
    relationships
  • SemDIS prototype4, including ranking, is
    accessible through Web interface

4SemDIS Prototype http//lsdis.cs.uga.edu/demos/
8
Interface I
9
Interface II
10
Context Specification Interface
11
Ranking Configuration Interface
12
Ranked Results Interface
13
Publications
  • 1 Chris Halaschek, Boanerges Aleman-Meza, I.
    Budak Arpinar, and Amit Sheth, Discovering and
    Ranking Semantic Associations over a Large RDF
    Metabase, 30th Int. Conf. on Very Large Data
    Bases, August 30 September 03, 2004, Toronto,
    Canada. Demonstration Paper
  • 2 Boanerges Aleman-Meza, Chris Halaschek, Amit
    Sheth, I. Budak Arpinar, and Gowtham
    Sannapareddy, SWETO Large-Scale Semantic Web
    Test-bed, International Workshop on Ontology in
    Action, Banff, Canada, June 20-24, 2004
  • 3 Boanerges Aleman-Meza, Chris Halaschek, I.
    Budak Arpinar, and Amit Sheth, Context-Aware
    Semantic Association Ranking, First International
    Workshop on Semantic Web and Databases, Berlin,
    Germany, September 7-8, 2003 pp. 33-50
Write a Comment
User Comments (0)
About PowerShow.com