Skip to main content

Matrices and Matrix Arithmetic

Matrices and Matrix Arithmetic
Matrices are a foundational element of linear algebra. Matrices are used throughout the fi eld of machine learning in the description of algorithms and processes such as the input data variable (X) when training an algorithm.A matrix is a two-dimensional array of scalars with one or more columns and one or more rows.
Defining a Matrix
We can represent a matrix in Python using a two-dimensional NumPy array. A NumPy array can be constructed given a list of lists. For example, below is a 2 row, 3 column matrix.
# create matrix
from numpy import array
A = array([[1, 2, 3], [4, 5, 6]])
print(A)
o/p:
[[1 2 3]
[4 5 6]]
Matrix Addition
# matrix addition
from numpy import array
# define first matrix
A = array([[1, 2, 3],[4, 5, 6]])
print("Matrix A")
print(A)
# define second matrix
B = array([[1, 2, 3],[4, 5, 6]])
print("Matrix B")
print(B)
# add matrices
C = A + B
print("Matrix C")
print(C)
o/p:
Matrix A
[[1 2 3]
[4 5 6]]
Matrix B
[[1 2 3]
[4 5 6]]
Matrix C
[[ 2 4 6]
[ 8 10 12]]
Matrix Subtraction
# matrix subtraction
from numpy import array
# define first matrix
A = array([[1, 2, 3],[4, 5, 6]])
print("Matrix A")
print(A)
# define second matrix
B = array([[0.5, 0.5, 0.5],[0.5, 0.5, 0.5]])
print("Matrix B")
print(B)
# subtract matrices
C = A - B
print("Matrix C")
print(C)
o/p:
Matrix A
[[1 2 3]
[4 5 6]]
Matrix B
[[ 0.5 0.5 0.5]
[ 0.5 0.5 0.5]]
Matrix C
[[ 0.5 1.5 2.5]
[ 3.5 4.5 5.5]]
Matrix Multiplication (Hadamard Product)
Two matrices with the same size can be multiplied together, and this is often called element-wise matrix multiplication or the Hadamard product. It is not the typical operation meant when referring to matrix multiplication.
# matrix Hadamard product
from numpy import array
# define first matrix
A = array([[1, 2, 3],[4, 5, 6]])
print("Matrix A")
print(A)
# define second matrix
B = array([[1, 2, 3],[4, 5, 6]])
print("Matrix B")
print(B)
# multiply matrices
C = A * B
print("Matrix C")
print(C)
o/p:
Matrix A
[[1 2 3]
[4 5 6]]
Matrix B
[[1 2 3]
[4 5 6]]
Matrix C
[[ 1 4 9]
[16 25 36]]
Matrix Division
# matrix division
from numpy import array
# define first matrix
A = array([[1, 2, 3],[4, 5, 6]])
print("Matrix A")
print(A)
# define second matrix
B = array([[1, 2, 3],[4, 5, 6]])
print("Matrix B")
print(B)
# divide matrices
C = A / B
print("Matrix C")
print(C)
o/p:
Matrix A
[[1 2 3]
[4 5 6]]
Matrix B
[[1 2 3]
[4 5 6]]
Matrix C
[[ 1. 1. 1.]
[ 1. 1. 1.]]
Matrix-Matrix Multiplication
Matrix multiplication, also called the matrix dot product is more complicated than the previous
operations and involves a rule as not all matrices can be multiplied together.
C = A.B
or
C = AB
The rule for matrix multiplication is as follows:
The number of columns (n) in the rst matrix (A) must equal the number of rows (m) in
the second matrix (B).
For example, matrix A has the dimensions m rows and n columns and matrix B has the dimensions n and k. The n columns in A and n rows in B are equal. The result is a new matrix with m rows and k columns.
C(m; k) = A(m; n) . B(n; k)
# matrix dot product
import numpy as np
# define first matrix
A =np. array([
[1, 2],
[3, 4],
[5, 6]])
print("Matrix A")
print(A)
# define second matrix
B = np.array([
[1, 2],
[3, 4]])
print("Matrix B")
print(B)
# multiply matrices
C = A.dot(B)
print("Matrix C")
print(C)
# multiply matrices with @ operator
D = A @ B
print("Matrix D")
print(D)
print("Matrix E")
E=np.matmul(A,B)
o/p:
Matrix A
[[1 2]
[3 4]
[5 6]]
Matrix B
[[1 2]
[3 4]]
Matrix C
[[ 7 10]
[15 22]
[23 34]]
Matrix D
[[ 7 10]
[15 22]
[23 34]]
Matrix E
[[ 7 10]
[15 22]
[23 34]]

Matrix-Vector Multiplication
A matrix and a vector can be multiplied together as long as the rule of matrix multiplication is observed. Speci cally, that the number of columns in the matrix must equal the number of items in the vector. As with matrix multiplication, the operation can be written using the dot notation. Because the vector only has one column, the result is always a vector.
c = A . v
# matrix-vector multiplication
from numpy import array
# define matrix
A = array([[1, 2],[3, 4],[5, 6]])
print("Matrix A")
print(A)
# define vector
B = array([0.5, 0.5])
print("Matrix B")
print(B)
# multiply
C = A.dot(B)
print("Matrix C")
print(C)
o/p
Matrix A
[[1 2]
[3 4]
[5 6]]
Matrix B
[ 0.5 0.5]
Matrix C
[ 1.5 3.5 5.5]
Matrix-Scalar Multiplication
A matrix can be multiplied by a scalar. This can be represented using the dot notation between
the matrix and the scalar.
C = A. b
# matrix-scalar multiplication
from numpy import array
# define matrix
A = array([[1, 2], [3, 4], [5, 6]])
print("Matrix A")
print(A)
# define scalar
b = 0.5
print("Scalar b")
print(b)
# multiply
C = A * b
print("Matrix C")
print(C)
o/p:
Matrix A
[[1 2]
[3 4]
[5 6]]
Scalar B
0.5
Matrix C
[[ 0.5 1. ]
[ 1.5 2. ]
[ 2.5 3. ]]


Labels:

Comments

Post a Comment

Popular posts from this blog

Mathematics for Machine Learning- CST 284 - KTU Minor Notes - Dr Binu V P

  Introduction About Me Syllabus Course Outcomes and Model Question Paper University Question Papers and Evaluation Scheme -Mathematics for Machine learning CST 284 KTU Overview of Machine Learning What is Machine Learning (video) Learn the Seven Steps in Machine Learning (video) Linear Algebra in Machine Learning Module I- Linear Algebra 1.Geometry of Linear Equations (video-Gilbert Strang) 2.Elimination with Matrices (video-Gilbert Strang) 3.Solving System of equations using Gauss Elimination Method 4.Row Echelon form and Reduced Row Echelon Form -Python Code 5.Solving system of equations Python code 6. Practice problems Gauss Elimination ( contact) 7.Finding Inverse using Gauss Jordan Elimination  (video) 8.Finding Inverse using Gauss Jordan Elimination-Python code Vectors in Machine Learning- Basics 9.Vector spaces and sub spaces 10.Linear Independence 11.Linear Independence, Basis and Dimension (video) 12.Generating set basis and span 13.Rank of a Matrix 14.Linear Mapping...
Post a Comment
Read more

4.3 Sum Rule, Product Rule, and Bayes’ Theorem

 We think of probability theory as an extension to logical reasoning Probabilistic modeling  provides a principled foundation for designing machine learning methods. Once we have defined probability distributions corresponding to the uncertainties of the data and our problem, it turns out that there are only two fundamental rules, the sum rule and the product rule. Let $p(x,y)$ is the joint distribution of the two random variables $x, y$. The distributions $p(x)$ and $p(y)$ are the corresponding marginal distributions, and $p(y |x)$ is the conditional distribution of $y$ given $x$. Sum Rule The addition rule states the probability of two events is the sum of the probability that either will happen minus the probability that both will happen. The addition rule is: $P(A∪B)=P(A)+P(B)−P(A∩B)$ Suppose $A$ and $B$ are disjoint, their intersection is empty. Then the probability of their intersection is zero. In symbols:  $P(A∩B)=0$  The addition law then simplifies to: $P(...
Post a Comment
Read more

5.1 Optimization using Gradient Descent

Since machine learning algorithms are implemented on a computer, the mathematical formulations are expressed as numerical optimization methods.Training a machine learning model often boils down to finding a good set of parameters. The notion of “good” is determined by the objective function or the probabilistic model. Given an objective function, finding the best value is done using optimization algorithms. There are two main branches of continuous optimization constrained and unconstrained. By convention, most objective functions in machine learning are intended to be minimized, that is, the best value is the minimum value. Intuitively finding the best value is like finding the valleys of the objective function, and the gradients point us uphill. The idea is to move downhill (opposite to the gradient) and hope to find the deepest point. For unconstrained optimization, this is the only concept we need,but there are several design choices. For constrained optimization, we need to intr...
Post a Comment
Read more