Teadmiste otsing, formaliseerimine ja hoidmine: erinevus redaktsioonide vahel
Resümee puudub |
Resümee puudub |
||
| 7. rida: | 7. rida: | ||
Code: <b>ITV0060</b><br> | Code: <b>ITV0060</b><br> | ||
Link: http://www.lambda.ee/index.php/Teadmiste_otsing,_formaliseerimine_ja_hoidmine or http://www.lambda.ee/index/itv0060<br> | Link: http://www.lambda.ee/index.php/Teadmiste_otsing,_formaliseerimine_ja_hoidmine or http://www.lambda.ee/index/itv0060<br> | ||
Lecturer: | Lecturer: Tanel Tammet<br> | ||
Contact: | Contact: tanel.tammet@ttu.ee, 6203457, TTÜ AK223<br> | ||
tammet@ | |||
Archives of previous years: [[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]. | Archives of previous years: [[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> | </td> | ||
| 16. rida: | 15. rida: | ||
== Time, place, result == | == Time, place, result == | ||
| 50. rida: | 22. rida: | ||
Points: 3.5<br> | Points: 3.5<br> | ||
Lectures: every Monday 17. | Lectures: every Monday 16:00-17.30, room IT-140.<br> | ||
Practical work: Mondays on odd weeks | Practical work: Mondays on odd weeks 16:00-17:30 room IT-213D, IT-213H.<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. | ||
| 60. rida: | 31. rida: | ||
There are two labs on the same theme and an optional third lab. | There are two labs on the same theme and an optional third lab. | ||
=== First lab === | === 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. | The main goal of the first lab is to web-scrape data from the public sources using search engines and simple text analysis/statistics. | ||
| 66. rida: | 37. rida: | ||
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. | 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. | ||
=== Second lab === | === 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. | 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. | ||
| 72. rida: | 43. rida: | ||
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]]. | 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]]. | ||
=== Optional third lab === | === 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. | 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. | 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/ | See: http://attempto.ifi.uzh.ch/site/ , http://attempto.ifi.uzh.ch/ape/ | ||
=== Declarative and procedural representations === | === Declarative and procedural representations === | ||
Lecture material: | Lecture material: | ||
Redaktsioon: 28. jaanuar 2013, kell 18:40
 |
Code: ITV0060 |
Time, place, result
Semester: spring
Grading: exam
Points: 3.5
Lectures: every Monday 16:00-17.30, room IT-140.
Practical work: Mondays 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 two labs on the same theme and an optional third lab.
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. 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/
Declarative and procedural representations
Lecture material:
Databases: meaning and representation of facts
- relation of plain data in databases to logic & representing complex structures in databases
- key/value pairs and rdf, compared to the relational model
Rules in logic: apps in planning, robotics, ...
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
RDF, RDFS, OWL and conversion to 1st order logic
Lecture material:
- RDFS: rdf schema and as ppt
Understand RDF and RDFS:
Understand basics of owl:
RDFa, reading and using RDF data from web pages
Understand main parts:
RDF relation to logic
Notes from lecture:
Understand a bit of:
Semantics of ordinary relational base
First order logic in query engines and planning
- Geoff reasoning course notes: just for background, no questions in exam
- planning and blocks world
- blocks world axiom/query examples from lecture
Data extraction
Web mining by Nell:
Restricted english jms
Uncertain knowledge logic
Indexes
Traditional database indexes incl B+ tree:
Bitmap indexes:
Hash indexes:
Fulltext indexes:
Term indexes: Understand basics of discrimination tree trie-type term indexes and path indexes from
Course structure
We start with representing and converting facts, continue to rules, first monotonic, then probabilistic and nonmonotonic, then look into search and indexing of complex information, and finally, some learning.
Intro and paradigms of knowledge representation
Lecture materials:
- Intro lecture: declarative and procedural representations
- roboswarm example of combining dec and proc
For KR, declarative and procedural rep see:
- Short wiki overview of knowledge representation
- Long and philosophical MIT overview of knowledge representation
- Pointers to classical papers
- A Survey of Cognitive and Agent Architectures
- Classical KRL paper from 1977: Bobrow & Winograd
Web mining by Nell:
Databases: meaning and representation of facts
Lecture material:
- relation of plain data in databases to logic & representing complex structures in databases
- key/value pairs and rdf, compared to the relational model
See also about databases and logic:
See also about RDF and related:
- rdf tutorial addendum for logic and dbases
- RDF wikipedia
- w3c RDF primer
- wiki intro
- Media:portaalidekoosvoime.ppt or as pdf Media:portaalidekoosvoime.pdf
- w3c rdfa primer
- rdfa and microformats deployment now
- microformats: a similar technology
- Hayes & Guha Lbase
Rules in logic: apps in planning, robotics, ...
Lecture material:
- Rules and logic: refresher and as ppt
Topics:
- propositional, first order, higher order
- semantics/models
- proofs and deriving new information
- automated reasoning
See also:
- Geoff reasoning course notes: just for background, no questions in exam
- planning and blocks world
- blocks world axiom/query examples from lecture
Various rule/logic languages
Lecture material:
Several languages:
- RDFS
- OWL
- KIF
- CL
- ontologies
- wordnet
- cyc
- restricted english systems
See also:
Scraping semistructured data
- Example for background: http://www.sightsmap.com/
Time, context, metainformation
Probabilistic and nonmonotonic reasoning
See also:
Personalized search and recommendations
Fast search of facts and rules using indexing
Learning
See also:
- intro
- robots/cars
- backpropagation
- good set of lecture materials
- another good full set of lecture materials