�
Data Mining_Anoop Chaturvedi
1
Swayam Prabha
Course Title
Multivariate Data Mining- Methods and Applications
Lecture 26
Recurrent neural network and Projection Pursuit Regression
By
Anoop Chaturvedi
Department of Statistics, University of Allahabad
Prayagraj (India)
Slides can be downloaded from https://sites.google.com/view/anoopchaturvedi/swayam-prabha
Advantage of weight sharing in CNNs⇒
For a 4x4 image, if a 2x2 filter is passed with no stride, then the filter with four weights one per pixel is applied nine times, requiring 36 weights in all.
If same weights are used for all nine filters, it requires four weights.
Thus, weight sharing (i) reduces the number of weights to be learned (reduces model training time and cost).
(ii) Makes feature search insensitive to feature location in the image.
Data Mining_Anoop Chaturvedi
2
Data Mining_Anoop Chaturvedi
3
Local connectivity is the concept of each neural connected only to a subset of the input image.
Parameter sharing is the sharing of weights by all neurons in a particular feature map. It helps to reduce the number of parameters in the whole system and makes the computation more efficient.
Based on the assumption that if one feature is useful to compute at some spatial position, then it should also be useful to compute at a different position.
Data Mining_Anoop Chaturvedi
4
Receptive field: In a convolutional layer, each neuron receives input from a restricted area of the previous layer, called the neuron's receptive field.
In a fully connected layer, the receptive field is the entire previous layer.
Pooling layer
Data Mining_Anoop Chaturvedi
5
Data Mining_Anoop Chaturvedi
6
Data Mining_Anoop Chaturvedi
7
Cycas Flower
Sobel Kernel Matrix ⇒ Emphasize regions of high spatial intensity change in both horizontal and vertical directions�Combining 8x8 pixel input matrix with a 3x3 kernel. Output ⇒ 6x6 matrix data
Horizontal Vertical
Data Mining_Anoop Chaturvedi
8
Data Mining_Anoop Chaturvedi
9
Data Mining_Anoop Chaturvedi
10
Emboss kernel matrix ⇒Employed for generating a 3D effect on an image.
Central element corresponds to the current pixel being processed.
Surrounding elements represent the differences in intensity values between the current pixel and its neighboring pixels.
Negative coefficients indicate regions of lower intensity. Positive coefficients indicate regions of higher intensity.
Data Mining_Anoop Chaturvedi
11
Sharpening Kernel Matrix ⇒ Emphasize regions of high spatial intensity change in horizontal and vertical directions. Enhances the edges by increasing the difference in intensity between adjacent pixels.
Central element (6) represents the weight of the current pixel.
Surrounding elements (-1, -1) compute the difference in intensity between the central pixel and its neighbors.
The example uses Laplacian Kernel
Recurrent neural network and Convolutional neural network exhibit temporal dynamic behavior.
Convolutional neural network ⇒ Class of networks with a finite impulse response.
Impulse response ⇒ Output of a dynamic system when presented with a brief input signal
Recurrent neural network
Econometrics_Anoop Chaturvedi
12
Variants of RNNs�Fully recurrent neural networks (FRNN) ⇒ Connect the outputs of all neurons to the inputs of all neurons. All other topologies can be represented by setting some connection weights to zero.
Econometrics_Anoop Chaturvedi
13
Econometrics_Anoop Chaturvedi
14
Econometrics_Anoop Chaturvedi
15
Input
Hidden
Units
Output
Delay Units
Output
Hidden
Units
Input
Delay Units
Elman
Jordan
Data Mining_Anoop Chaturvedi
16
Data Mining_Anoop Chaturvedi
17
Data Mining_Anoop Chaturvedi
18
Data Mining_Anoop Chaturvedi
19
Data Mining_Anoop Chaturvedi
20
Data Mining_Anoop Chaturvedi
21
Data Mining_Anoop Chaturvedi
22
Data Mining_Anoop Chaturvedi
23
Projection pursuit regression and neural networks
Econometrics_Anoop Chaturvedi
24