This document discusses machine learning and concepts related to matrices. It defines machine learning as a program that improves its performance on a task through experience. It then describes applied machine learning as extracting patterns from data rather than being explicitly programmed. Finally, it outlines the machine learning pipeline as involving data processing, feature extraction, modeling, and optimization. The document then defines various types of matrices, including their order, transpose, singular/nonsingular properties, and other concepts such as symmetric, diagonal, and identity matrices.
This document discusses machine learning and concepts related to matrices. It defines machine learning as a program that improves its performance on a task through experience. It then describes applied machine learning as extracting patterns from data rather than being explicitly programmed. Finally, it outlines the machine learning pipeline as involving data processing, feature extraction, modeling, and optimization. The document then defines various types of matrices, including their order, transpose, singular/nonsingular properties, and other concepts such as symmetric, diagonal, and identity matrices.
This document discusses machine learning and concepts related to matrices. It defines machine learning as a program that improves its performance on a task through experience. It then describes applied machine learning as extracting patterns from data rather than being explicitly programmed. Finally, it outlines the machine learning pipeline as involving data processing, feature extraction, modeling, and optimization. The document then defines various types of matrices, including their order, transpose, singular/nonsingular properties, and other concepts such as symmetric, diagonal, and identity matrices.
This document discusses machine learning and concepts related to matrices. It defines machine learning as a program that improves its performance on a task through experience. It then describes applied machine learning as extracting patterns from data rather than being explicitly programmed. Finally, it outlines the machine learning pipeline as involving data processing, feature extraction, modeling, and optimization. The document then defines various types of matrices, including their order, transpose, singular/nonsingular properties, and other concepts such as symmetric, diagonal, and identity matrices.
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
You are on page 1/ 2
Machine Learning:
A computer program is said to learn from experience E with respect to some task T and some performance measure P, if its performance on T as measured by P, improves with experience E.
Applied machine learning :
A collection of methods
That allows the extraction of rules (or) patterns from data
Rather than explicit construction from a programmer
The machine learning pipeline:
Data processing
Data collection
Data formatting
Data labelling
Feature extraction
Convert into mathematical concepts
Modelling
Geometry
Probability
Optimization
Training phase
Data evaluation
Prediction Matrices
A matrix represents a collection of numbers arranged in an order of rows and columns.
It is necessary to enclose the elements of a matrix in parentheses or brackets. Order of a Matrix : The order of a matrix is defined in terms of its number of rows and columns. Order of a matrix = No. of rows ×No. of columns Therefore Matrix [M] is a matrix of order 3 × 3. Transpose of a Matrix : The transpose [M]T of an m x n matrix [M] is the n x m matrix obtained by interchanging the rows and columns of [M]. if A= [aij] mxn , then AT = [bij] nxm where bij = aji Properties of transpose of a matrix: (AT)T = A (A+B)T = AT + BT (AB)T = BTAT
Singular and Nonsingular Matrix:
Singular Matrix: A square matrix is said to be singular matrix if its determinant is zero i.e. |A|=0 Nonsingular Matrix: A square matrix is said to be non-singular matrix if its determinant is non-zero. Square Matrix: A square Matrix has as many rows as it has columns. i.e. no of rows = no of columns. Symmetric matrix: A square matrix is said to be symmetric if the transpose of original matrix is equal to its original matrix. i.e. (AT) = A. Skew-symmetric: A skew-symmetric (or antisymmetric or antimetric[1]) matrix is a square matrix whose transpose equals its negative.i.e. (AT) = -A. Diagonal Matrix: A diagonal matrix is a matrix in which the entries outside the main diagonal are all zero. The term usually refers to square matrices. Identity Matrix:A square matrix in which all the elements of the principal diagonal are ones and all other elements are zeros.Identity matrix is denoted as I. Orthogonal Matrix: A matrix is said to be orthogonal if AAT = ATA = I Idempotent Matrix: A matrix is said to be idempotent if A2 = A Involutory Matrix: A matrix is said to be Involutory if A2 = I. Adjoint of a square matrix:
