Maurice Hendrix and Alexandra Cristea (Semi-)automatic authoring of AH
Maurice Hendrix and Alexandra Cristea (Semi-)automatic authoring of AH.
Dec 22, 2015
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Maurice Hendrix and Alexandra Cristea
(Semi-)automatic authoring of AH
Invited Seminar, Madrid, Spain April 2008
Outline
• Why automatic authoring• System overview• Semantic Desktop• Adding resources
Invited Seminar, Madrid, Spain April 2008
Why automatic authoring
• Make authoring task easier
• Manual annotation is bottleneck
• By integrating authoring environment into semantic desktop
Invited Seminar, Madrid, Spain April 2008
System overview
SesameDatabase Lucene
CAFCAF
MOT
Enricher
Beagle++
RDF
Invited Seminar, Madrid, Spain April 2008
Concept maps and lessons are hierarchies:
MOT hierarchy structure
Adaptive Hypermedia
Hypermedia
From AH to Adaptive Web
AH
Invited Seminar, Madrid, Spain April 2008
Semantic Desktop• Desktop where everything is stored with
extra metadata• We uses RDF as storage format• Example RDF (also has an XML representation):
Publication
Conference
published At
Invited Seminar, Madrid, Spain April 2008
Adding Resources
• MOT goal/domain maps are hierarchies with tree structure, siblings are concepts at the same level
• The Semantic Desktop can be searched for resources. They are ranked by 2 formulae
Invited Seminar, Madrid, Spain April 2008
Ranking
• Concept oriented
• Article Oriented
where: rank(a,c) is the rank of article a with respect to the current domain concept c;k(c) is the set of keywords belonging to the current domain concept c;k(a) is the set of keywords belonging to the current article a; |S| = the cardinality of the set S, for a given set S.
||
||
k(c)
k(a)k(c)=c)rank(a,
||
||
k(a)
k(a)k(c)=c)rank(a,
Invited Seminar, Madrid, Spain April 2008
Selection of ranking method - snapshot
Invited Seminar, Madrid, Spain April 2008
Equal ranks
Invited Seminar, Madrid, Spain April 2008
Allow duplicates among siblings• We call concepts in MOT at the same
depth in the hierarchy Siblings• The author has to make a choice.• Adding to all siblings can mean students
get the link multiple times• Choosing one of the siblings can mean
students don’t always get the link when relevant.
Invited Seminar, Madrid, Spain April 2008
Selection of duplicates/none snapshot
Invited Seminar, Madrid, Spain April 2008
Add meta-data as separate concepts• The retrieved resources might have
attributes themselves• If resources have further attributes,
these can be added as domain attributes in MOT
• The resource can also be made into a domain concept with its own separate domain attributes
Invited Seminar, Madrid, Spain April 2008
Add metadata as attributes
Invited Seminar, Madrid, Spain April 2008
Add metadata as Separate concepts
Invited Seminar, Madrid, Spain April 2008
Separate concepts/ attributes snapshot
Invited Seminar, Madrid, Spain April 2008
Compute resource keywords as set• The number of times a keyword occurs
might indicate the relevance of the keyword.
• The ranking formulae can be computed on sets of keywords or multisets.
Invited Seminar, Madrid, Spain April 2008
Set/ multiset snapshot
Invited Seminar, Madrid, Spain April 2008
Before MOT hierarchy snapshot
Invited Seminar, Madrid, Spain April 2008
After MOT hierarchy snapshot
Invited Seminar, Madrid, Spain April 2008
Questions?
Related Documents
