Itv0060 2014 arhiiv - Redigeerimiste ajalugu

Tammet: Uus lehekülg: '

teadmised Code: ITV0060
Link: http://www.lambda.ee/index.php/Teadmiste_otsing,_formaliseerimine_j...'
2015-02-02T16:05:25Z

Uus lehekülg: '<table> <tr> <td> left|teadmised </td> <td> Code: <b>ITV0060</b><br> Link: http://www.lambda.ee/index.php/Teadmiste_otsing,_formaliseerimine_j...'

Uus lehekülg
<table>
<tr>
<td>
[[Pilt:Mephistophiles small.gif| left|teadmised]]
</td>
<td>
Code: <b>ITV0060</b><br>
Link: http://www.lambda.ee/index.php/Teadmiste_otsing,_formaliseerimine_ja_hoidmine or http://www.lambda.ee/index/itv0060<br>
Lecturer: Tanel Tammet<br>
Contact: tanel.tammet@ttu.ee, 6203457, TTÜ AK223<br>
Archives of previous years: [[itv0060 2013 arhiiv|2013]], [[itv0060 2012 arhiiv|2012]], [[itv0060 2011 arhiiv|2011]], [[itv0060 20010 arhiiv|2010]], [[itv0060 2009 arhiiv|2009]], [[itv0060 2008 arhiiv|2008]], [[itv0060 2007 arhiiv|2007]], [[itv0060 2006 arhiiv|2006]], [http://cs.ttu.ee/kursused/wav4130/ older].
</td>
</tr>
</table>

= <font color="red">NB! See on 2014 aasta arhiiv, mitte hetkel käsiloleva kursuse materjalikogu</font> =

* 14. mai vaatame üle eksamimaterjalid + indeksite loeng.
* 16. mai on viimane ametlik prakside esitamise päev, aga ...
* 21. mai on varupäev prakside jaoks + indeksite loeng.

Eksamil neli küsimust väikeste ülesannete näol: igast suurest
allolevast teemast üks.

Exam times:

* 26. May, Monday: in room ICT-A2 at 10:00
* 3. June, Tuesday: in ICT-A2 at 10:00



== Time, place, result ==

Semester: spring<br>
Grading: exam<br>

Lectures: every Wednesday 16:00-17.30, room ICT-A2<br>
Practical work: Fridays on odd weeks (7. Feb, 21 Feb, ...) 12:00-13:30 room ICT-403<br>
Practical work will give 40% and exam 60% of points underlying the final grade.

== Focus ==

The main focus of the course is on KR ([https://en.wikipedia.org/wiki/Knowledge_representation 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 [http://www.sciencedirect.com/science/book/9781558609327 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.

See [[details for KR lab 2]].

=== Third lab 2014 ===

This lab is <b>optional</b> and will simply give as many points as lab 1 or 2 towards the final result and the grade: practical wotrk 60% and exam 40%.

The goal of the lab is to use [http://wordnet.princeton.edu/ wordnet] or [http://www.cl.ut.ee/ressursid/teksaurus/ teksaurus] to create an additional ruleset and to use that
in addition to your own rules in lab 2.

Student ideas are also welcome: have to agree with Tanel first.

== Lecture block 1: basics and representing simple facts. ==

=== Overview of the course. Background and basics. First lab. ===

Lecture materials:
* [[Media:Kr intro.ppt | 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.
* [[Media:Kr_plain_data_db_logic.ppt | relation of plain data in databases to logic & representing complex structures in databases ]]

=== Core ideas of non-relational databases, mostly RDF ===

Lecture materials:

* [[Media:kr_rdf_schemalessdb_3.ppt|key/value pairs and rdf, compared to the relational model]]
* [[Nosql links and notes]] not part of exam

=== HTML annotations. Microformats, microdata, RDFa ===

Lecture materials:

* [[Media:Kr_annot_rdfa_rdfs_3.ppt|Html annotations, RDFa, RDFs]] RDFs part covered during the next block

Understand main parts (not part of exam):

* [https://support.google.com/webmasters/answer/99170?hl=en Google rich snippets]
* [http://en.wikipedia.org/wiki/RDFa wiki intro]
* [http://www.w3.org/TR/rdfa-lite/ RDFa lite] ja [http://www.w3.org/TR/xhtml-rdfa-primer/ w3c rdfa primer]
* [http://ogp.me/ open graph protocol (i.e. Facebook stuff)]
* [http://microformats.org/ microformats]
* [[Media:portaalidekoosvoime.ppt]] or as pdf [[Media:portaalidekoosvoime.pdf]]

=== Data extraction from the web ===

not part of exam

* Overview
* Some details about [http://rtw.ml.cmu.edu/rtw/ Nell] as a nice example.

== Lecture block 2: representing rules ==

=== RDFS and logic ===

Understand RDFS:

Lecture material:

* [[Media:Kr_rdfs.pdf|RDFS: rdf schema]] and as [[Media:Kr_rdfs.ppt|ppt]]

Additional details (not part of exam):

* [http://en.wikipedia.org/wiki/RDF_schema RDFs wikipedia]
* [http://www.w3.org/TR/rdf-schema/ w3c 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:
* [http://en.wikipedia.org/wiki/Resource_Description_Framework RDF wikipedia]
* [http://www.w3.org/TR/rdf-primer/ w3c RDF primer]
* [http://en.wikipedia.org/wiki/Web_Ontology_Language OWL wikipedia]
* [http://www.w3.org/TR/owl-guide/ w3c OWL guide]
* [http://cl.tamu.edu/ CL main page],
* [http://attempto.ifi.unizh.ch/site/pubs/papers/phd_kaljurand.pdf Attempto restricted english]

=== RDFs and OWL ===

* [[Notes about RDF and OWL: logical meaning]]

Understand basics of owl:

* [http://en.wikipedia.org/wiki/Web_Ontology_Language OWL wikipedia]

not part of exam:

* [http://www.w3.org/TR/owl2-overview/ w3c OWL version 2 guide]
* [http://www.w3.org/TR/owl2-primer/ w3c OWL version 2 primer]
* [http://www.w3.org/2007/OWL/wiki/Profiles#Reasoning_in_OWL_2_RL_and_RDF_Graphs_using_Rules Owl2 wiki rule semantics]

Owl background: description logics (not part of exam )

* [http://disi.unitn.it/~ldkr/ml2013/slides/12.DL.ppt brief intro to description logic]
* [http://www.inf.unibz.it/~franconi/dl/course/ detailed course in description logics] (not necessary for exam)

Start looking at interesting ontologies:

* [http://www.ontologyportal.org/ SUMO]

=== Restricted english ===

* http://attempto.ifi.uzh.ch/site/pubs/ Attempto restricted english]

Attempto details not necessary for the exam.

== Lecture block 3: time, planning and uncertain knowledge ==

=== Rules in planning and robotics ===

Lecture material:
* [[Media:Kr_rules1.pdf|Rules and logic: refresher]] and as [[Media:Kr_rules1.ppt|ppt]]
* [[blocks world axiom/query examples from lecture]]

See also (not part of exam):

* [[Media:Geoffreasoningnotes.pdf|Geoff reasoning course notes: just for background, no questions in exam]]
* [http://www.ee.pdx.edu/~mperkows/May4/005.Ch11-planning.ppt planning and blocks world]

=== Logic for uncertain knowledge ===

* [http://plato.stanford.edu/entries/logic-nonmonotonic/ nonmonotonic logic] Not necessary for exam.
* [http://en.wikipedia.org/wiki/Default_logic default logic] For exam: main material for default logic.


For the exam: you should be able to create and solve small examples with default logic.

=== Fuzzy and probabilistic logic ===

* [[Media:Uncertain_prob_fuzzy.ppt‎|Uncertain_prob_fuzzy.ppt‎]] Intro.
* [[Media:Vienna_tanel.pdf|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 ===

* [[Media:Ijcai93.pdf|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:
* [http://www.lambda.ee/index.php/Pilt:IndexNotes04.ppt G. Molina lecture 4]

Hash indexes:
* [http://en.wikipedia.org/wiki/Hash_table wiki].

Bitmap indexes:
* [http://en.wikipedia.org/wiki/Bitmap_index 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: [http://www.lambda.ee/index.php/Pilt:Fulltext_indexes.ppt good intro and overview]
* Term indexes: [http://www.lambda.ee/index.php/Pilt:Mccuneindexing.pdf mccune paper]

not part of exam:

=== Fancier term indexes ===

* Path indexes

* On from here.

=== Nosql indexes ===

* Document bases
* Graph bases





[[teadmised_note]]

[[Category:Kursus]]