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>


== Time, place, result ==
== Time, place, result ==
22. rida: 23. rida:
Practical work: Fridays on odd weeks (7. Feb, 21 Feb, ...) 12:00-13:30 room ICT-403<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.
== 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 three blocks built on each other:
* Declarative and procedural representations, relational and nosql databases, core logic, html annotations.
*




51. rida: 61. rida:
-->
-->


== Lectures  ==
== Lecture block 1: declarative/procedural, KR in programming languages, databases, core logic, web annotations ==
 


=== Declarative and procedural representations. Notes on relational databases. ===
==== Declarative and procedural representations. Notes on relational databases. ====


Lecture materials:
Lecture materials:
76. rida: 87. rida:
* [[Media:portaalidekoosvoime.ppt]] or as pdf [[Media:portaalidekoosvoime.pdf]] (for exam: just an example for the material above and below)
* [[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)
* [http://www.w3.org/TR/xhtml-rdfa-primer/ w3c rdfa primer (for exam: understand the basics, not all details)
=== Data extraction ===
Web mining by Nell:
* [http://rtw.ml.cmu.edu/rtw/ Nell]
== Lecture block 2: various languages: rule/logic languages, 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]


=== RDFs and OWL ===
=== RDFs and OWL ===
105. rida: 150. rida:
* [http://www.ontologyportal.org/ SUMO]
* [http://www.ontologyportal.org/ SUMO]


=== Rules in logic: apps in planning, robotics, ... ===
 
===  Restricted english ===
 
Not necessary for the exam.
 
* [http://attempto.ifi.unizh.ch/site/pubs/papers/phd_kaljurand.pdf Attempto restricted english]
 
 
== Lecture block 3: time and uncertain knowledge ==
 
 
=== Rules in planning and robotics ===


Lecture material:
Lecture material:
115. rida: 171. rida:
* [http://www.ee.pdx.edu/~mperkows/May4/005.Ch11-planning.ppt planning and blocks world]
* [http://www.ee.pdx.edu/~mperkows/May4/005.Ch11-planning.ppt planning and blocks world]
* [[blocks world axiom/query examples from lecture]]
* [[blocks world axiom/query examples from lecture]]


=== Logic for uncertain knowledge ===
=== Logic for uncertain knowledge ===
136. rida: 193. rida:


For the exam: understand referential transparency and core ideas about encoding belief and knowledge. Modal logic not necessary for the exam.
For the 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 ===
=== Indexes: intro and mainstream ===
152. rida: 211. rida:
A few words about both multi-field indexes and geoindexes.
A few words about both multi-field indexes and geoindexes.


Fulltext indexes:
* Fulltext indexes: [http://www.lambda.ee/index.php/Pilt:Fulltext_indexes.ppt good intro and overview]
* [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]
 
* Term indexes


=== Fancier term indexes ===
=== Fancier term indexes ===
163. rida: 220. rida:
* On from here.
* On from here.


=== Data extraction ===
== Nosql indexes ==
 
Not necessary for the exam.


Web mining by Nell:
* Document bases
* [http://rtw.ml.cmu.edu/rtw/ Nell]
* Graph bases
 
===  Restricted english ===
 
Not necessary for the exam.
 
* [http://attempto.ifi.unizh.ch/site/pubs/papers/phd_kaljurand.pdf Attempto restricted english]
 
<!--
 
Term indexes:
Understand basics of discrimination tree trie-type term indexes and path indexes from
* [http://www.lambda.ee/index.php/Pilt:Mccuneindexing.pdf mccune paper]
 
-->
 
=== 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]




Redaktsioon: 1. veebruar 2014, kell 22:35

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.

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 three blocks built on each other:

  • Declarative and procedural representations, relational and nosql databases, core logic, html annotations.


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

Lecture block 1: declarative/procedural, KR in programming languages, databases, core logic, web annotations

Declarative and procedural representations. Notes on relational databases.

Lecture materials:

Databases: SQL and NoSQL: meaning and representation of facts

Lecture materials:

HTML annotations. Microformats, microdata, RDFa, Starting RDFs

Lecture materials:

Understand main parts:


Data extraction

Web mining by Nell:


Lecture block 2: various languages: rule/logic languages, 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:

RDFs and OWL

Understand RDFS:

Lecture material:

Understand basics of owl:

Owl background: description logics

Start looking at interesting ontologies:


Restricted english

Not necessary for the exam.


Lecture block 3: time and uncertain knowledge

Rules in planning and robotics

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.

Lecture block 4: indexes and search

Indexes: intro and mainstream

Traditional database indexes incl B+ tree:

Hash indexes:

  • wiki. Understand the core usage scenario and be able to create a small example.

Bitmap indexes:

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

Multi-field and geoindexes, Fulltext and term indexes

A few words about both multi-field indexes and geoindexes.

Fancier term indexes

  • Path indexes
  • On from here.

Nosql indexes

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