Lec 5-6 Flashcards

1
Q

What is an expert system?

A

A computer system that emulates decision making process of domain expert.

  • This requires encoding a great deal of domain-specific knowledge
  • Reasoning often encoded using vast knowledge base of rules.
    -Process often augmented by heuristics.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What are the main takeaways of expert systems?

A

Expert systems are specialized systems aiding/emulating decision making. They encode expert knowledge, often in rule-based form. Together with inference engine, knowledge is used to draw conclusions. Search may be sped up using heuristics.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What are heuristics and what’s their use?

A

Criteria, methods, or principles for deciding which among several alternative courses of action promises to be the most effective in order to achieve some goal.

Rules of thumb, not always applicable or optimal, quickly finding something “good enough”, compromise:
Between simplicity, efficiency, accuracy and completeness

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Symbolic AI in 1980’s: Commercialization of Expert Systems

A

Proved a way to get AI from labs to business

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Connectionist AI: Resurgence in 1980’s

A

With increasing compute power, models start to be applicable to “real” problems

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

1980’s Second Boom:

A

Return of funding, investment in fifth generation computer systems that were to…
- use super large scale integrated chips
- have AI
- ability to recognise images and graphs
- solve complex problems
- work with natural language

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What are limits of the expert system?

A
  • Classical formal logic not suited for all problems
  • Performance issues on large knowledge base
  • Expert elicitation - translating expert knowledge to a computer is very yhard
  • Many experts don’t reason in if-then rules
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What caused the second AI winter? 1987-1993

A

The over-hyped but disappointing developments. Funds were not extended, researchers embarrassed or less interested.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What can cause uncertainty?

A

Inherent randomness in outcomes, unknowns/uncertainties in domain description, existence of many special cases

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

How can uncertainty be represented?

A

Probability theory, and extensions and generalisations of this. Fuzzy sets and logic or non-monotonic logics

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is a sample space?

A

A non empty set, representing the ‘atomic things that can happen’.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is an event?

A

Something that can happen, therefore a subset of the sample space.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

A sigma algebra over the sample space is a set of events such that..

A

It contains the sample space.
It is closed under complements.
It is closed under countable unions. — therefore also closed under countable intersections

The tuple of the (SampleSpace, SigmaAlgebra) is a measurable space.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Sigma Algebra can be considered a set-theoretic complement, union, and intersection

A

If we have a dice, the sample space is {1,2,3,4,5,6}. Then the event
(#Eyes is odd AND #eyes >= 2) = (#Eyes is odd) AND (#Eyes >=2) = {3,5}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What is the triple (S,SA,P) called?

A

Probability space

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Sigma algebra captures the events about which … can say something

A

P (probability measure)

17
Q

What is a random variable?

A

A map X: SampleSpace -> X where (X,F) is a measurable space.
Any RV we assume to be measurable.

18
Q

Summary of random variables and uncertainty:

A

We can describe a problem using an abstract underlying probability space. (Randomness generator)

A random variable is a map X: SampleSpace -> X. Turns the randomness in SampleSpace to domain-specific values in X.

Random variable X induces probability space.