End-Term Flashcards
(40 cards)
What is Machine Learning?
A field of AI that enables systems to learn from experience without being explicitly programmed.
Who defined ML as ‘computers learning from experience E with respect to tasks T and performance measure P’?
Tom Mitchell
Name the three types of Machine Learning.
Supervised learning, Unsupervised learning, Reinforcement learning
What is supervised learning?
Predicting outcomes based on labeled training data
What are examples of supervised learning?
Handwriting recognition, stock prediction, disease diagnosis
What is unsupervised learning?
Finding patterns or groupings in unlabeled data
What are examples of unsupervised learning?
Market basket analysis, customer segmentation
What is reinforcement learning?
Learning to make sequences of decisions to maximize a reward
What is a data set in ML?
A collection of information or records about a specific subject or entity
What are attributes in a data set?
Features or variables that describe each record
What is qualitative data?
Categorical data describing qualities (e.g., gender, grade)
What are types of qualitative data?
Nominal (no order) and Ordinal (with order)
What is quantitative data?
Numerical data that can be measured
What is interval data?
Numeric data with known intervals but no true zero (e.g., temperature)
What is ratio data?
Numeric data with a true zero (e.g., height, weight)
What are the main steps in building a learning system?
Task understanding, data collection, data preparation, modeling, evaluation, deployment
What is classification?
Assigning a label to input data based on learned patterns
What is regression?
Predicting a numerical value based on input data
What programming language is most used in ML?
Python
What is a common library in Python for ML?
Scikit-learn
What is the first step in problem-solving?
Problem formulation
Name the main components in problem formulation.
Initial state, actions, transition model, goal test, path cost
What is BFS (Breadth-First Search)?
Search algorithm that explores all nodes at the present depth before moving deeper
What is DFS (Depth-First Search)?
Search algorithm that explores as far as possible along a branch before backtracking