[Oct 25, 2022] Fully Updated Artificial intelligence (AI) (AIF) Certification Sample Questions [Q13-Q29]

Explanation
https://griffinshare.fontbonne.edu/cgi/viewcontent.cgi?article=1008&context=ijds

Explanation
https://www.techtarget.com/whatis/definition/scrum-master#:~:text=A%20Scrum%20Master%20is%20a,in%20a

Explanation
* Performance Measure of Agent It is the criteria, which determines how successful an agent is.
* Behavior of Agent It is the action that agent performs after any given sequence of percepts.
* Percept It is agent’s perceptual inputs at a given instance.
* Percept Sequence It is the history of all that an agent has perceived till date.
* Agent Function It is a map from the precept sequence to an action.
Agent Terminology
https://www.tutorialspoint.com/artificial_intelligence/artificial_intelligence_agents_and_environments.htm

Explanation
https://link.springer.com/referenceworkentry/10.1007/978-0-387-73003-5_293#:~:text=Definition,and%20comb

Explanation
* Weak Learner: Colloquially, a model that performs slightly better than a naive model.
More formally, the notion has been generalized to multi-class classification and has a different meaning
beyond better than 50 percent accuracy.
For binary classification, it is well known that the exact requirement for weak learners is to be better than
random guess. […] Notice that requiring base learners to be better than random guess is too weak for
multi-class problems, yet requiring better than 50% accuracy is too stringent.
– Page 46, Ensemble Methods, 2012.
It is based on formal computational learning theory that proposes a class of learning methods that possess
weakly learnability, meaning that they perform better than random guessing. Weak learnability is proposed as
a simplification of the more desirable strong learnability, where a learnable achieved arbitrary good
classification accuracy.
A weaker model of learnability, called weak learnability, drops the requirement that the learner be able to
achieve arbitrarily high accuracy; a weak learning algorithm needs only output an hypothesis that performs
slightly better (by an inverse polynomial) than random guessing.
– The Strength of Weak Learnability, 1990.
It is a useful concept as it is often used to describe the capabilities of contributing members of ensemble
learning algorithms. For example, sometimes members of a bootstrap aggregation are referred to as weak
learners as opposed to strong, at least in the colloquial meaning of the term.
More specifically, weak learners are the basis for the boosting class of ensemble learning algorithms.
The term boosting refers to a family of algorithms that are able to convert weak learners to strong learners.
https://machinelearningmastery.com/strong-learners-vs-weak-learners-for-ensemble-learning/

Explanation
https://www.techopedia.com/2/31564/watercooler/ada-lovelace-enchantress-of-numbers