Teadmiste otsing, formaliseerimine ja hoidmine: erinevus redaktsioonide vahel
Resümee puudub |
|||
| 95. rida: | 95. rida: | ||
--> | --> | ||
== 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 == | ||
Redaktsioon: 13. mai 2013, kell 17:41
 |
Code: ITV0060 |
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.
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:
- Intro lecture: declarative and procedural representations
- relation of plain data in databases to logic & representing complex structures in databases
Databases: meaning and representation of facts
Lecture materials:
NoSQL databases
- Nosql links and notes (here for exam: understand the basic categories of Nosql bases: what is the main point
and differences between the categories. Not necessary to know the details of different bases).
HTML annotations. RDFa, reading and using RDF data from web pages. Starting RDFs
Lecture materials:
- RDFa and RDFs: Media:Kr_annot_rdfa_rdfs.ppt or as Media:kr_annot_rdfa_rdfs.pdf
Understand main parts:
- 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:
- 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"
Understand basics of owl:
(for exam: you should understand the core principles of owl, not the details below here)
Owl background: description logics
- detailed course in description logics (not necessary for exam)
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:
- 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
For the exam: you should be able to create and solve small examples with default logic.
Indexes
You should be able to understand where to use what and solve small examples.
Traditional database indexes incl B+ tree:
Bitmap indexes:
Hash indexes:
Data extraction
Not necessary for the exam.
Web mining by Nell:
Restricted english jms
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: