Teadmiste otsing, formaliseerimine ja hoidmine: erinevus redaktsioonide vahel
Resümee puudub |
|||
| 127. rida: | 127. rida: | ||
== Lecture block 2: representing rules == | == Lecture block 2: representing rules == | ||
=== RDFS and logic === | |||
Understand RDFS: | |||
Lecture material: | |||
* [http://en.wikipedia.org/wiki/RDF_schema RDFs wikipedia] | |||
* [[Media:Kr_rdfs.pdf|RDFS: rdf schema]] and as [[Media:Kr_rdfs.ppt|ppt]] | |||
* [[Notes about RDF and OWL: logical meaning]] | |||
* [http://www.w3.org/TR/rdf-primer/ w3c RDF primer] see chapter "5. Defining RDF Vocabularies: RDF Schema" | |||
=== Important KR languages === | === Important KR languages === | ||
| 154. rida: | 167. rida: | ||
* [[Notes about RDF and OWL: logical meaning]] | * [[Notes about RDF and OWL: logical meaning]] | ||
Understand basics of owl: | Understand basics of owl: | ||
Redaktsioon: 12. märts 2014, kell 19:47
![]() |
Code: ITV0060 |
Time, place, result
Semester: spring
Grading: exam
Lectures: every Wednesday 16:00-17.30, room ICT-A2
Practical work: Fridays on odd weeks (7. Feb, 21 Feb, ...) 12:00-13:30 room ICT-403
Practical work will give 40% and exam 60% of points underlying the final grade.
Focus
The main focus of the course is on KR (knowledge representation): how to represent nontrivial information in programs and databases, how to build and use indexes for efficient search through large sets of knowledge.
The course contains four blocks built on each other:
- Background and basics. Representing simple facts.
- Representing rules.
- Time, planning and uncertain knowledge.
- Indexes and search.
Ca half of the course themes are covered in this book.
Practical work
There are three labs: the first two are obligatory, third is optional. The labs have to be presented to the prof and all students present at labwork.
First lab 2014
The goal of the first lab is to write a software system able to scrape factual raw data about a person with a name given to the program.
Basically, search for web pages containing the name and extract relevant words from the list you create: words closer to the name and with more occurrences are also more important/better match. It may be a good idea to do some searches together with interesting keywords already. Also, whenever you do a search / pull a page, it is a good idea to store the search result / html source in a file to avoid exchausting your search quota and just wasting bandwidth and time,
Deadline: recommended mid-March, absolutely latest end of March (after this there will be a penalty).
See also notes for KR lab 1.
Second lab 2014
The goal of the second lab is to write and use rules to categorize/tag people according to the data obtained during the first lab. A person should get a number of tags with numerical indicators showing our trust in that the tag really applies to the person, plus (sometimes) a number indicating the degree to which the tag applies.
As a concrete scenario imagine we want to show ads to the people and decide the concrete ads based on the tags/categories of people.
Third lab 2014
Details to be announced.
Lecture block 1: basics and representing simple facts.
Overview of the course. Background and basics. First lab.
Lecture materials:
- Intro lecture: declarative and procedural representations
- Core logic refresher.
- Details of the first lab.
Programming and databases. SQL: meaning and representation of facts
- Encoding data in programming languages.
- relation of plain data in databases to logic & representing complex structures in databases
Core ideas of non-relational databases, mostly RDF
Lecture materials:
HTML annotations. Microformats, microdata, RDFa
Lecture materials:
- Html annotations, RDFa, RDFs RDFs part covered during the next block
Understand main parts:
- Google rich snippets
- wiki intro
- RDFa lite ja w3c rdfa primer
- open graph protocol (i.e. Facebook stuff)
- microformats
- Media:portaalidekoosvoime.ppt or as pdf Media:portaalidekoosvoime.pdf
Data extraction from the web
- Overview
- Some details about Nell as a nice example.
Lecture block 2: representing rules
RDFS and logic
Understand RDFS:
Lecture material:
- RDFs wikipedia
- RDFS: rdf schema and as ppt
- Notes about RDF and OWL: logical meaning
- w3c RDF primer see chapter "5. Defining RDF Vocabularies: RDF Schema"
Important KR languages
Not necessary for the exam.
Several languages:
- RDFS
- OWL
- KIF
- CL
- ontologies
- wordnet
- cyc
- restricted english systems
- frame systems
See also:
RDFs and OWL
Understand basics of owl:
Owl background: description logics
- brief intro to description logic
- detailed course in description logics (not necessary for exam)
Start looking at interesting ontologies:
Restricted english
Attempto details not necessary for the exam.
Lecture block 3: time, planning and uncertain knowledge
Rules in planning and robotics
Lecture material:
- Rules and logic: refresher and as ppt
See also:
- Geoff reasoning course notes: just for background, no questions in exam
- planning and blocks world
- blocks world axiom/query examples from lecture
Logic for uncertain knowledge
- nonmonotonic logic Not necessary for exam.
- default logic For exam: main material for default logic.
- Reasoning with Conflicting Knowledge Helpful additional material.
For the exam: you should be able to create and solve small examples with default logic.
Fuzzy and probabilistic logic
- Uncertain_prob_fuzzy.ppt Intro.
- Vienna_tanel_2.pdf Additional examples and combining.
For the exam: understand the differences between fuzzy and probabilistic logic and be able to present small examples.
Logic of belief and knowledge
- Ijcai93.pdf Overview.
For exam: understand referential transparency and core ideas about encoding belief and knowledge. Modal logic not necessary for the exam.
Lecture block 4: indexes and search
Indexes: intro and mainstream
Traditional database indexes incl B+ tree:
Hash indexes:
- wiki.
Bitmap indexes:
- wiki.
For exam: understand the core usage scenarios and be able to create small examples.
Multi-field and geoindexes, fulltext and term indexes
- A few words about both multi-field indexes and geoindexes.
- Fulltext indexes: good intro and overview
- Term indexes: mccune paper
Fancier term indexes
- Path indexes
- On from here.
Nosql indexes
- Document bases
- Graph bases
