Tammet – 1. veebruar 2014, kell 19:32

2014-02-01T19:32:38Z

Tammet: Uus lehekülg: '

teadmised Code: ITV0060
Link: http://www.lambda.ee/index.php/Teadmiste_otsing,_formaliseerimine_j...'
2014-02-01T19:32:26Z

Uus lehekülg: '<table> <tr> <td> left|teadmised </td> <td> Code: ITV0060 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: ITV0060 
Link: http://www.lambda.ee/index.php/Teadmiste_otsing,_formaliseerimine_ja_hoidmine or http://www.lambda.ee/index/itv0060 
Lecturer: Tanel Tammet 
Contact: tanel.tammet@ttu.ee, 6203457, TTÜ AK223 
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>

== N! See on kursuse arhiiv aastast 2013

== Eksam ==

Põhieksam esmaspäeval, 20. mail kell 12:00 ruumis X-413 (majanduse maja).

Seejuures:

* Kell 12:00 saab sealsamas esitada projekte.
* Kell 13:30 algab eksam.

Järeleksam teisipäeval, 4. juunil kell 12:00 ruumis X-211B (majanduse maja).

* Kell 12:00 saab sealsamas esitada projekte.
* Kell 13:30 algab eksam.

== Muutused loengukohas ==

Loengud toimuvad nüüd ja edaspidi uues IT majas Akadeemia 15, 4 korrus arvutiteaduse seminariruumis 411.

== Time, place, result ==

Semester: spring 
Grading: exam 
Points: 3.5 

Lectures: every Monday 16:00-17.30, room IT-140. 
Practical work: Thursdays on odd weeks 16:00-17:30 room IT-213D, IT-213H. 
Practical work will give 40% and exam 60% of points underlying the final grade.

== Practical work ==

There are three labs. All labs have to be presented to the prof and all students present at labwork.

=== First lab 2013 ===

The main goal is to select a domain and a task for the second lab. What to search, from where, etc. You should experiment
with scraping, search and apis to find out what you can really get, in practice. The ideas, experiments and the final
plan should be presented. Might be useful to have a look at:
* http://www.programmableweb.com/
* http://www.webdesignerdepot.com/2011/07/40-useful-apis-for-web-designers-and-developers/
* http://stackoverflow.com/questions/6084096/what-free-web-search-apis-are-available
* http://commoncrawl.org/data/accessing-the-data/
* https://www.facebook.com/SocialNetworkAnalysis
* http://www.sightsmap.com
* http://wordnetweb.princeton.edu
* http://dbpedia.org/About
* https://ajax.googleapis.com/ajax/services/search/web?v=1.0&q=Paris%20Hilton

Deadline: 21. February.

=== Second lab 2013 ===

The main goal is to develop an app which scrapes/searches potentially uncertain data from the web and creates a representation
of that data in a machine-processable form (json, csv, xml etc). You can scrape html pages, google, bing, wolfram alpha results
and/or use any apis like twitter, google places, google plus etc. It is best to have a combination of these.

Deadline: end of March.

=== Third lab 2013 ===

The main goal of the third lab is to develop a ruleset for generating new interesting facts from the data obtained from the second
lab. The ruleset has to be encoded in a format suitable for some first-order based logical prover and then used
with the prover to actually derive new facts.

Deadline: end of the spring semester.

[[ITV006 third lab 2013]]



== Eksamiküsimused ==

Väikesed ülesanded: data ja reeglite esitamine ja kasutamine

Andmebaas nö tüüpilise relatsioonilise mudelina, key-value ja rdf kujul. Nende esituste omavahelise teisendamise oskus.

Ülesanne blocks worldist: esita mingi olukord, mingi reegel ja näita rakendamise tulemust. Hea oleks aru saada erinevatest võimalustest

RDF, RDFS ja OWL põhiasjad: väike ülesanne. Süntaksid ja eridetailid ei ole olulised.

RDF ja RDFS esitada loogikas faktide ja reeglitena.

Arusaamine RDFa põhiasjadest, oskus teha näidet. ??? Kallelt küsida.

Arusaam et mis on mittemonotoonne loogika ja mis ei ole, mis oleks viisid esitada vasturääkivaid teadmisi. Võib olla väike ülesanne mingite asjade esitamise kohta: näide ja selgitus. Default loogika ülesanne a la linnud ja Quaker diamond: panna kirja reeglid ja viia läbi järeldused ja vbl selgitada lisaks. Seos CWA, Prolog ja default loogika vahel võib samuti küsimuse alla tulla.

Arusaam fuzzy ja probabilistic logic erinevustest ja võimalikest rakenduskohtadest.

Indeksid: arusaam baasindekseerimis-ideedest ja B+ treest. Ntx ehitada B+ või hash indeks mingi väikese datahulga jaoks.

== Lectures ==

=== Declarative and procedural representations ===

Lecture materials:
* [[Media:Kr intro.ppt | Intro lecture: declarative and procedural representations]]
* [[Media:Kr_plain_data_db_logic.ppt | relation of plain data in databases to logic & representing complex structures in databases ]]

=== Databases: meaning and representation of facts ===

Lecture materials:
* [[Media:Kr_schemaless.pdf|key/value pairs and rdf, compared to the relational model]]

=== NoSQL databases ===

Not for exam.

* [[Nosql links and notes]]

=== HTML annotations. RDFa, reading and using RDF data from web pages. Starting RDFs ===

For exam: no xml syntax necessary. Syntax
unimportant, except for RDFa.

Lecture materials:

* RDFa and RDFs: [[Media:Kr_annot_rdfa_rdfs.ppt]] or as [[Media:kr_annot_rdfa_rdfs.pdf]]

Understand main parts:

* [http://en.wikipedia.org/wiki/RDFa wiki intro]
* [[Media:portaalidekoosvoime.ppt]] or as pdf [[Media:portaalidekoosvoime.pdf]] (for exam: just an example for the material above and below)
* [http://www.w3.org/TR/xhtml-rdfa-primer/ w3c rdfa primer (for exam: understand the basics, not all details)

=== RDFs and owl OWL ===

* [[Notes about RDF and OWL: logical meaning]] (for exam: you should understand this!)

Understand RDFS:

(for exam: you should understand the core principles of 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"

Understand basics of owl:

(for exam: you should understand the core principles of owl, not the details below here)

* [http://en.wikipedia.org/wiki/Web_Ontology_Language OWL wikipedia]
* [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

* [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] (not necessary for exam)



=== Rules in logic: apps in planning, robotics, ... ===

For exam: you should be able to encode a small blocks world planning example and solve it. The details below "see also" are not necessary, but the last example is useful.

Lecture material:
* [[Media:Kr_rules1.pdf|Rules and logic: refresher]] and as [[Media:Kr_rules1.ppt|ppt]]

See also:

* [[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]
* [[blocks world axiom/query examples from lecture]]



=== Logic for uncertain knowledge ===

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

* [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.
* [http://sc.snu.ac.kr/courses/2008/spring/pg/krr/Lectures/Lecture11/Lec11.ppt Reasoning with Conflicting Knowledge] Helpful additional material.

=== Fuzzy and probabilistic logic ===

For the exam: understand the differences between fuzzy and probabilistic logic and be able to present small examples.

* [[Media:Uncertain_prob_fuzzy.ppt‎|Uncertain_prob_fuzzy.ppt‎]] Intro.
* [[Media:Vienna_tanel.pdf|Vienna_tanel_2.pdf]] Additional examples and combining.

=== Logic of belief and knowledge ===

For the exam: understand referential transparency and core ideas about encoding belief and knowledge. Modal logic not necessary for the exam.

* [[Media:Ijcai93.pdf|Ijcai93.pdf]] Overview.

=== Indexes ===

You should be able to understand where to use what and solve small examples. Algorithms for updating
B+ trees not necessary for exam.

Traditional database indexes incl B+ tree:
* [http://www.lambda.ee/index.php/Pilt:IndexNotes04.ppt G. Molina lecture 4]

Bitmap indexes:
* [http://en.wikipedia.org/wiki/Bitmap_index wiki]. For exam: understand the core usage scenario of bitmap indexes.

Hash indexes:
* [http://en.wikipedia.org/wiki/Hash_table wiki]. Understand the core usage scenario and be able to create a small example.



=== Data extraction ===

Not necessary for the exam.

Web mining by Nell:
* [http://rtw.ml.cmu.edu/rtw/ Nell]

=== Restricted english jms ===

Not necessary for the exam.

* [http://attempto.ifi.unizh.ch/site/pubs/papers/phd_kaljurand.pdf Attempto restricted english]



=== Various rule/logic languages ===

Not necessary for the exam.

Several languages:
* RDFS
* OWL
* KIF
* CL
* ontologies
* wordnet
* cyc
* restricted english 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]





[[Category:Kursus]]

Itv0060 2013 arhiiv - Redigeerimiste ajalugu

Tammet – 1. veebruar 2014, kell 19:32