Viyogi Learning

 Logistic Discriminant Analysis Feature extraction is one of the most important problems in pattern recognition. Linear discriminant analysis (LDA) is one of the well-known methods to extract the best features for multi-class discrimination. LDA is formulated as a problem to find an optimal linear mapping by which the within-class scatter in the mapped feature space is made as small as possible relative to the between-class scatter. LDA is useful for linear separable cases, but for more complicated cases, it is necessary to extend it to non-linear. ----------------------------------------------------------------------------------------------------------------------------  Prerequisite : ·            Bayesian Decision Theory ·           Multi-Variate Linear Algebra ·           Numerical Computations -----------------------------------------...

                   VIYOGI ENTERPRISE

 Insertion Sort The sorting of the array is very important in array implementation. So now, we will understand the insertion sort in a very easy way. The idea to implement:  Take a number from the array Compare it with left numbers:                    if the left number is bigger:                                   move the left number to the right                    else                                   place the number  Array = {78,89,45,23,10} Array = { 89,82,63,54,32,23} I hope you will understand the sorting if not try doing it by using a pen and paper and still stuck and comment down..

 Books for Beginners/Mediocre: 1. Machine Learning -Tom Thomas Mitchell Download Book 2.  Machine Learning: A Probabilistic Perspective Download Book  

Number of pairs whose sum is given number here we have to find the pair of numbers from the sorted array whose sum must be equal to the given number. for example, suppose array A[10]={2,6,9,12,15,19,25,29,32,38} and given numer is 27. in this array, there are two pairs: (2,25) and (12,15). Logic:- first, we take a sorted array and check the sum of the last two numbers, if the sum is less than the given number then no such pair exists in the array, and if the sum is greater than the given number then there are possibilities of the existence of such pair. now we use only one loop to make the complexity be linear. C++ Result:- Note:- In Output, the result showing numbers are the addresses of numbers in that sorted array in which they are paired with.

What is a perfect number?  A perfect  number  is a  positive integer  that is equal to the sum of its positive  divisors , excluding the number itself. For instance, 6 has divisors 1, 2 and 3 (excluding itself), and 1 + 2 + 3 = 6, so 6 is a perfect number.  C program to count all perfect numbers from 1to N. #include"stdio.h" int perfect(int num) {     /* function to check number is perfect or not*/     if(num<1)     {         return 0;     }     int i, sum, n;     sum = 0;     n = num;     for(i=1; i<n; i++)     {         /* If i is a divisor of num */         if(n%i == 0)         {             sum += i;         }     }     if(num==sum)     {         printf("number is %d\n",num); ...

BS Grewal Pdf if required SIZE:-- 243 mb DOWNLOAD NOW