Teadmiste otsing, formaliseerimine ja hoidmine: erinevus redaktsioonide vahel

Allikas: Lambda
Mine navigeerimisribale Mine otsikasti
← Vanem muudatusUuem muudatus →
Resümee puudub
Resümee puudub
13. rida: 13. rida:
</tr>
</tr>
</table>
</table>
== 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 ==
== Time, place, result ==
36. rida: 18. rida:
Semester: spring<br>
Semester: spring<br>
Grading: exam<br>
Grading: exam<br>
Points: 3.5<br>


Lectures: every Monday 16:00-17.30, room IT-140.<br>
Lectures: every Wedesday 16:00-17.30, room ICT-A2<br>
Practical work: Thursdays on odd weeks 16:00-17:30 room IT-213D,  IT-213H.<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.
Practical work will give 40% and exam 60% of points underlying the final grade.


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


=== First lab 2013 ===
=== First lab 2014 ===


<!--
The main goal is to select a domain and a task for the second lab. What to search, from where, etc. You should experiment
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
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


=== Second lab 2014 ===


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
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  
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.
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 2014 ===
 
=== 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
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
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.
with the prover to actually derive new facts.
Deadline: end of the spring semester.
[[ITV006 third lab 2013]]
<!--
== Old versions: 2012 ==
The old versions are here for inspiration and initial ideas.
=== Old version, not for 2013: First lab ===
The main goal of the first lab is to web-scrape data from the public sources using search engines and simple text analysis/statistics. 
Details in [[Teadmised first lab 2012|Teadmised first lab 2012]]. The lab should be completed by March, later presentation will cut the points to half.
=== Old version, not for 2013: Second lab ===
The main goal of the second lab is to augment data obtained from the first lab by writing and using probabilistic rules with a rule engine. 
Details about second lab will be available on beginning of April. Previous year lab can be seen here: [[Teadmised second lab 2012]]. You may also have a look at the 2011 version of the lab [[Teadmised second lab 2011]].
=== Old version, not for 2013: Optional third lab ===
The optional third lab can be done in parallel with the second. It will be a relatively complex lab: successful passing will give additional 20 points, thus the weight of the exam is diminished from 60% to 40% of the overall score.
What to do: use Attempto to create a system such that you can write rules and/or facts and/or queries for the second lab in restricted english. These restricted english sentences have to be automatically converted to the form usable by Otter. It is a good idea to avoid probabilities in these rules, since it would be very hard to encode probabilities using attempto.
See: http://attempto.ifi.uzh.ch/site/ , http://attempto.ifi.uzh.ch/ape/
-->
-->
== 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  ==
== Lectures  ==
142. rida: 63. rida:
Lecture materials:
Lecture materials:
* [[Media:Kr_schemaless.pdf|key/value pairs and rdf, compared to the relational model]]  
* [[Media:Kr_schemaless.pdf|key/value pairs and rdf, compared to the relational model]]  


=== NoSQL databases ===
=== NoSQL databases ===
172. rida: 92. rida:


(for exam: you should understand the core principles of rdfs)
(for exam: you should understand the core principles of rdfs)


Lecture material:
Lecture material:
295. rida: 214. rida:




===  Restricted english jms ===
===  Restricted english ===


Not necessary for the exam.  
Not necessary for the exam.  

Redaktsioon: 1. veebruar 2014, kell 22:01

teadmised
teadmised

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: 2013, 2012, 2011, 2010, 2009, 2008, 2007, 2006, [http:/cs.ttu.ee/kursused/wav4130/ older].

Time, place, result

Semester: spring
Grading: exam

Lectures: every Wedesday 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.


Practical work

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

First lab 2014

Second lab 2014

Third lab 2014

Lectures

Declarative and procedural representations

Lecture materials:

Databases: meaning and representation of facts

Lecture materials:

NoSQL databases

Not for exam.

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:

Understand main parts:

RDFs and owl OWL

Understand RDFS:

(for exam: you should understand the core principles of rdfs)

Lecture material:

Understand basics of owl:

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

Owl background: description logics

Start looking at interesting ontologies:

  • 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:

See also:


Logic for uncertain knowledge

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

Fuzzy and probabilistic logic

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

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.

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:

Bitmap indexes:

  • wiki. For exam: understand the core usage scenario of bitmap indexes.

Hash indexes:

  • 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:


Restricted english

Not necessary for the exam.


Various rule/logic languages

Not necessary for the exam.


Several languages:

  • RDFS
  • OWL
  • KIF
  • CL
  • ontologies
  • wordnet
  • cyc
  • restricted english systems

See also:


Pärit leheküljelt "http://www.lambda.ee/w/index.php?title=Teadmiste_otsing,_formaliseerimine_ja_hoidmine&oldid=11319"