- 7
- 8 852
Deepanshu Choudhary
India
Приєднався 28 бер 2013
UA-cam Educational Channel
Відео
How to do Principal Component Analysis in Machine Learning in python *SVM Classification Included*
Переглядів 1,6 тис.4 роки тому
Code : drive.google.com/file/d/1TCyM7_B56W4HVbFlLniFrZEMpcx4bX8n/view?usp=sharing In this video i implement the Principal Component Analysis in Python over the Scikit Learn Breast Cancer Dataset. Further down the line I did the Support Vector Machines Classification and reach up to 95% accuracy. Support the channel, Hit Like and Subscribe #Machinelearning #supportvectormachine #pca #datascience
How to implement the LSTM Network on a Time-series, (Explained In Easier way), Code included
Переглядів 2014 роки тому
Code : drive.google.com/file/d/19gvayUwbriD2ScdSKP9alTSFiQyYN5g_/view?usp=sharing In this video i implemented a LSTM Network in a Simple and Easy to understand, way. Sometimes LSTMs, RNNs may haunt beginners because of so extra moving parts, but with sufficient practice and good direction one can easily master over it, Here i made an effort to do the same, LSTM Neural Networks can be so powerfu...
How to convert Time Series data to Supervised Data *IN HINDI* CLEAR EXPLANATION
Переглядів 8534 роки тому
#machinelearning #deeplearning In this video i demonstrated that how to convert time series data to supervised data format , to use it into supervised Machine Learning or Deep Learning Models like LSTM , CNN, MLP etc.
QUEUE Implementation | using Linked List | Python in 10 minutes
Переглядів 5 тис.5 років тому
Queue is an abstract data structure, somewhat similar to Stacks. Unlike stacks, a queue is open at both its ends. One end is always used to insert data (enqueue) and the other is used to remove data (dequeue). Queue follows First-In-First-Out methodology, i.e., the data item stored first will be accessed first. Link to Python Notebook: github.com/proffdeep/Queue_using_linked_list/blob/master/Qu...
Binary Search Algorithm using recursion python implementation.
Переглядів 9635 років тому
In computer science, binary search, also known as half-interval search,[1] logarithmic search,[2] or binary chop,[3] is a search algorithm that finds the position of a target value within a sorted array.[4][5] Binary search compares the target value to the middle element of the array. If they are not equal, the half in which the target cannot lie is eliminated and the search continues on the re...
Stack Implimentation | PYTHON | Data structures |
Переглядів 1315 років тому
Stack works on the principle of “Last-in, first-out”. Also, the inbuilt functions in Python make the code short and simple. To add an item to the top of the list, i.e., to push an item, we use append() function and to pop out an element we use pop() function. These functions work quiet efficiently and fast in end operations.
Your contents are so much useful for me.Thanks a lot
Thanku helpful
😪 sleepy, anyway thnks
Teach at our channel !!
helpful video
Bro Y ur voice is too low.. 😒
yeah
Thank you, Sir. if possible plz also post the link for code.
superb explanation
thanks for explaining it nicely
How did you choose pca n_components=2?
Hello Deepanshu thank you for video. I have a couple of questions or some help with my project. I try to make predictions for 30 days. First i split train data 70 % and test data 30 % . I reshape them i make create model and finish train. That's everything good. I want to make prediction from test data for future 30 days. I take last 100 days from test data to make prediction for future 30 days. It have new output for every 100 days. My question is from where come that output
Image data pe bhi bno lo bhi,jisko dekho breast cancer pe kr rha hai or CSV file le rha hai👎👎👎
can you guide us how to use PCA in Text data or how to prepare the text data for PCA based on features
Yes, Shoaib I'll post it as soon as I could. Thanks for watching.
@@deepanshuchoudhary4598 Thanks Dude
keep it up dude
superb
Thanks
hello Nice video i just have one doubt self.last.next = new_node; self.last = new_node; # why newNode should be the last itself we have already pointed the new node with last.next then why need of self.last = new_node Thanks
self.last.next = new_node; that means we add new node then (self.last.next = new_node) this is the location where we have to add
Amazing 😍
Good.
Thanks
I m looking for more videos on time series forecasting using deep learning from your end.
Thanks for watching Javeria, Yeah sure, I'll be uploading more and more videos on time series, just stay tuned and support this channel.
tq ............................... do more videos........
Thanks buddy, Sure I'll make more videos a bit later..
Any suggestion of improvement is highly appreciated, feel free to comment ! :)
This is a newbie channel, i highly assure that you're going to get valuable and quality content in future, apology for quality of this video, i'm still learning this stuff. Thanks :)