Teadmiste otsing, formaliseerimine ja hoidmine: erinevus redaktsioonide vahel

Allikas: Lambda
Mine navigeerimisribale Mine otsikasti
← Vanem muudatusUuem muudatus →
Resümee puudub
Resümee puudub
185. rida: 185. rida:
* [[Media:Ijcai93.pdf|Ijcai93.pdf]] Overview.
* [[Media:Ijcai93.pdf|Ijcai93.pdf]] Overview.


=== Indexes ===
=== Indexes: intro and mainstream ===


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:
Traditional database indexes incl B+ tree:
* [http://www.lambda.ee/index.php/Pilt:IndexNotes04.ppt G. Molina lecture 4]
* [http://www.lambda.ee/index.php/Pilt:IndexNotes04.ppt G. Molina lecture 4]
Hash indexes:
* [http://en.wikipedia.org/wiki/Hash_table wiki]. Understand the core usage scenario and be able to create a small example.


Bitmap indexes:
Bitmap indexes:
* [http://en.wikipedia.org/wiki/Bitmap_index wiki]. For exam: understand the core usage scenario of 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.


<!--
== Fulltext and term indexes ==


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
 
* Path indexes


=== Data extraction ===
=== Data extraction ===

Redaktsioon: 1. veebruar 2014, kell 22:03

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


Fulltext and term indexes

Fulltext indexes:

  • Term indexes
  • Path indexes

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=11320"