Skip to main content

Posts

Showing posts from July, 2024

Everything/Anything as a Service (XaaS)

  "Anything as a Service" or "Everything as a Service."     XaaS, or "Anything as a Service," represents the comprehensive and evolving suite of services and applications delivered to users via the internet. This paradigm encompasses a wide array of cloud-based solutions, transcending traditional boundaries to include software, infrastructure, platforms and more. There are numerous types of XaaS: Software as a service Platform as a service Infrastructure as a service Storage as a service Mobility as a service Database as a service Communications as a service Network as a service  .. and this list goes on by each passing day  Most familiar and known services in Cloud Computing : Software as a service ...

Mathematics for Artificial Intelligence : Multivariate Analysis

 A simplified guide on how to prep up on Mathematics for Artificial Intelligence, Machine Learning and Data Science: Multivariate Analysis (Important Pointers only)   Module VIII : Multivariate Analysis  Multivariate analysis is a branch of statistics that deals with the observation and analysis of more than one statistical outcome variable at a time. It is used to understand the relationships between multiple variables simultaneously and to model their interactions. I. Principal Component Analysis (PCA). Principal Component Analysis (PCA) is a statistical technique used to simplify a dataset by reducing its dimensions while retaining most of the variance in the data. Important Concepts: Dimensionality Reduction : PCA reduces the number of dimensions (features) in the dataset while preserving as much variability (information) as possible. Principal Components : These are new, uncorrelated variables formed from linear combinations of the original variables. The first prin...

Mathematics for Artificial Intelligence : Numerical Methods

 A simplified guide on how to prep up on Mathematics for Artificial Intelligence, Machine Learning and Data Science: Numerical Methods (Important Pointers only) Module VII : Numerical Methods  I. Bisection Method. A numerical technique for solving equations of the form f ( x ) = 0 . It is a type of root-finding method that repeatedly narrows down an interval where a root of the function exists. Steps: Choose the initial interval [ a , b ] [a, b] : Select two points a a and b b such that f ( a ) f(a) and f ( b ) f(b) have opposite signs. This indicates that there is at least one root in the interval [ a , b ] [a, b] . Compute the midpoint c c : Calculate the midpoint of the interval: c = a + b 2 c = \frac{a + b}{2} ​ Evaluate the function at the midpoint : Compute f ( c ) f(c) . Determine the subinterval : If f ( a ) ⋅ f ( c ) < 0 , the root lies in the interval [ a , c ] [a, c] . Set b = c . If f ( b ) ⋅ f ( c ) < 0 f(b) \cdot f(c) < 0 , the root lies in the in...