Datar-Gionis-Indyk-Motwani (DGIM) Algorithm | Counting 1's in a stream | At A Glance!
ฝัง
- เผยแพร่เมื่อ 8 เม.ย. 2023
- In this video, we delve into the fascinating world of near-neighbor search, and explore the Datar-Gionis-Indyk-Motwani (DGIM) algorithm, a state-of-the-art technique for efficient data processing. Whether you're a data analyst, data engineer, or data scientist, this video will provide you with the tools you need to tackle complex data problems with ease.
We'll start with an overview of the challenges of near-neighbor search, and why it's such an important problem in today's data-driven world. Then, we'll dive into the DGIM algorithm, exploring its key concepts and how it works in practice.
But we won't stop there. We'll also provide a step-by-step solution to a real-world example, demonstrating how the DGIM algorithm can be used to solve near-neighbor search problems in a practical setting. You'll learn how to implement the algorithm using Python code, and how to interpret the results.
By the end of this video, you'll be equipped with a deep understanding of the DGIM algorithm, and how it can be used to solve near-neighbor search problems in a wide range of applications, from image recognition to recommendation systems.
So join us as we explore the cutting-edge world of near-neighbor search, and discover how the DGIM algorithm can help you unlock the full potential of your data processing capabilities!
__________________________________________
Don't forget to check the playlist of Sorting here: • Sorting Algorithms | A...
Also don't forget to subscribe the entire playlist of Searching here: • Searching Algorithms |...
Full Arrays Playlist: • Arrays | At A Glance!
White Box Testing Numerical Playlist: • White Box Testing | At...
Big Data Analytics Playlist: • Big Data Analytics | A...
Deep Learning Playlist: • Deep Learning | At A G...
Python Small Projects Playlist: • Python Small Projects!...
Subscribe to At A Glance!
Follow me on Instagram: / at_a_glance_official
__________________________________________
Very helpful 💖 thank you
Thanks a lot for appreciating! I am glad that you liked it😊 Please Share it with your friends and support ❤️ Best wishes for your exams 💕
Thank you brother for such an easy explanation .... i understood all the steaming issues in one go from your videos... keep up the good work🔥
Extremely happy to hear that🥳 Thankyou so much for your appreciation🔥 Please Share it with your friends ❤️🙏🏻
Too good brother, thank you for making such videos!
Thankyou so much for appreciation ❤️ Please stay connected to my channel🙏🏻
It was such a very detailed and clear explanation. Really appreciate your work :)
Thankyou so much for your great appreciation😇 Please Share with your friends also 🙏🏻 Best wishes for your exams🔥
Write the script to sort the values contained in the following vector in ascending
order and descending order: (23, 45, 10, 34, 89, 20, 67, 99). Demonstrate the
output
Thanks a lot ! You helped me a lot ! The explanation is very clear
I am glad that it helped you! Please share it with your friends😇💕 Best wishes for your exams🔥
Crystal clear thank you🙏
You are most welcome🤗 Please Like and Subscribe to my channel and please share it with your friends 🤗❤️
Great... thank you so much 👏
You are most welcome 🤗
This is the best. Really helped me for my exam
I am glad to know that it helped you? Thankyou so much for watching ❤️ Please Like, Share and Subscribe 😀
Thank you and this video is more helpful for me 🙏
I am very happy that my video helped you😊 Please do a favour on me by sharing the video with your friends🙏🏻💗 Thankyou again for appreciation 😁
AWESOME EXPLANATION!!
Thankyou so much 🤗 Please Share it with your friends ♥️ Best wishes for your exams 💞
Great explanation
Thanks a lot ma'am for always appreciating me😊
Thank you for this awesome and simple explanation really helped me in understanding the concept😃
Thank you so much for your appreciation.... Please Share it with your friends too ♥️
Best wishes for your exams 💞
Very Helpful ,Thank U for such good Explaination .
Thanks a ton for appreciating ♥️Please Share it with your friends ☺️
wonderful explanation ,
thank you so much Sir....
I am glad that you liked it😍 Please Share it with your friends too 😀
Thanks alot..Really helped👍
Glad to know that you liked it! Please Like, Subscribe and Share it with your friends❤️😊
Thank you
You are welcome! Please Like, Share and Subscribe ❤️
very smooth explaination
Thanks a lot for appreciating! Please Subscribe and Share it with your friends❤️😊
thanks a lot ...... it was really helpful and clearly explained !!
Thanks for appreciation ☺️ Please Share it with your friends too ♥️🙏
very good explanation and visual representation is awesome
Thankyou so much for your appreciation!💕 Please Please Share it with your friends! Support❤️
What a explanation bro. Marvelous.🥺.
What a beautiful comment bro🤩🙏🏻 Thankyou so much🔥 Best wishes for your exams💕
Clear explaination
Thanks a lot for appreciating! Please Subscribe and share it with your friends and support me🙏🏻❤️
Just amazing
Thanks a lot for your appreciating words!❤️ Please Share it with your friends✨ Best wishes for your exams 💕
what if the questio would have been [ No's of 1 in recent 20 bits?]
For the case of first 20 bits, the answer would be 13! As you know for the first 18 bits there are 9 bits of one. Now if you increase the count to first 20 bits. The length of entire next bucket (4) will be counted. That is why 9+4=13 is the answer... As DGIM algorithm is meant for providing only approximated count of 1's in a stream data as any streaming data is much huge and continuous. Therefore it's difficult to get correct results! Hope it helps❤️ Best wishes for your exams💕
Thanks man this is amazing❤️😊
You are welcome 😁 Thanks for appreciating💞✨
Great ❤
Thankyou ♥️🙏🤗
easy to understand explaination brother thanks🤗
That's so nice of you to watch and appreciate me! Thankyou so much😍 Please do share this with your friends😇💕
what a beautiful video
What a beautiful comment😍 Thanks a lot🥳
total number of elements present in the stream were 21 then why was n=20
Excellent explanation
Thanks a lot 😊🙏 Please Share it with your friends 😄
bro, you are doing a really great job hats off bro🤗
I am very glad that my videos helped you☺️ Thanks for appreciating! Please Share it with your friends 😉🙏🏻
great explanation
Thanks a ton for appreciation 😄 Please Share my videos with your friends and support ❤️🙏🏻 Best wishes for your exams🤝
very clear
Thanks a ton 🙏🤗 Please Share it with your friends ♥️
Helpful!!!
Thanks a lot 😊 Please Share it with your friends ❤️🤠
Great work ✨✨
Thankyou so much ❤️🥰 Please Share it with your friends 😉
Simple explanation ❤
Thank you so much for your appreciation 🥰 Please Share it with your friends ♥️🙏
Yash, You are amazing man!
Thankyou so much Yash for such words🤗
Please Share it with your friends ♥️
Best wishes for your exams 💞
Great
Thanks a ton 😊 Please Share it with your friends too ♥️ Best wishes for your exams 💞
Very great explanation and so easy✨
Thankyou very much for appreciating words!🙌🏻❤️☺️
How was the paper?
We'll explained ❤
Thankyou so much for your appreciating words😊 Please do a favour by sharing it with your friends❤️
I have a question. Do we have to always show those 3 scenarios : if new entering bit is 0,1,1 and then we have to count the number of recent/first bits whatever is asked? or can I count it directly in the question's given stream?
Its not mandatory to show all these three scenarios and then count the bits.. it's totally up to you, but if time permits in the exam then please show all these scenarios. Hope it helps! Thanks for watching ☺️
why did u add bits as 011 can i add any combination of bit i want?? also how do we know how many bits we can add?
As you said well no two buckets should be of same size then why you consider same sizes bits repeatedly regardless of rule conventions?
No more than two buckets should be of the same sizes.. please carefully listen🙏
How we are mapping the bucket
sir,till when we need to add 1 to the end to form buckets...what is the terminating condition of adding 1 at the end.
Because if there is no terminating condition then the answer of the query i.e. how many 1's are there in the last 16 bits.......will be different for different students.
Great explanation!
One question, are counting 1's in a stream and window both same or different?
Thanks a lot for appreciating!❤️
See for counting 1's in a stream we use DGIM algorithm because it gives the approximated answer by forming buckets. For counting 1's in a specific window also you can use DGIM algorithm. But since the window contains finite number of elements you can use any simple algorithms also for counting.
In short, both the problems are going to count the 1's but the DGIM algorithm has a sublinear time complexity, which makes it efficient for counting 1's in large windows / stream.
Hope it helps!❤️ Best wishes for your exams.... 💕
@@ataglanceofficial Got it, thanks!
Cool 🙌🏻
Sarthak udya help kar paper madhe🙏
@@ayushyelne7064 😆
❤🚀
If new number is entering then we have to take it into the right side ? And in book the formula of 1’s is half of the size of oldest bucket+size of all newer bucket.
See standard way of adding elements is from right side and also make sure if you are adding elements from right then you have to start creating buckets from right side only
In the video I have told how to count 1's you can use that
@@ataglanceofficial ya I saw your complete video, great explanation
Thankyou so much 🤗 Please Share it with your friends too ♥️
Best wishes for your exams 💞
nice
Thankyou so much🤗 Please Share!💕
What if the questions is to count the first 18 bits , should we count from the left?
Heyy that's a great question, look once buckets are formed it's location/timestamp is also stored.. so if you want to count number of 1's in a particular location/timestamp you can easily traverse to that timestamps and access the number of buckets that comes under it and easily count the total number of 1's in it..
Ans: Here, for your example, for getting 1's from first 18 bits, you can start counting from the left and easily count it because here the data is extremely small and it's easy to access. But when it comes to big data, the counter will traverse to the target timestamp and then will count the first 18 bits.... Hope it helps! Thanks for watching! Please do share with your friends ❤️😁
what if they asked for recent 19 bits instead of 18 ?
Look in the first 18 bits there are total 9 1's,
And now if you ask for first 19 bits you can see that the 19th bit lies in a separate bucket with length 4
So the total number of 1's in the first 19 bits will be 9 (for first 18 bits) + 4 (bucket length that contains the 19th bit) = 13.
So in summary the answer will be 13. Now this is acceptable because dgim is meant for counting "approximate" numbers of 1's.
Hope it helps, please share it with your friends too ♥️☺️
What if we need to count the number of 1's in recent 19 bits instead of 18?
My guess: 13
Is it correct?
For this case yes you are correct! As DGIM algorithm is meant for providing only approximated count of 1's in a stream data as any streaming data is much huge and continuous. Therefore it's difficult to get correct results! Hope it helps❤️ Best wishes for your exams💕
@@ataglanceofficial Thank you so much!!!
You are most welcome! Please Subscribe❤️🙏🏻
Very helpful 💖 thank you
I am very happy to see that you liked it! ❤️ Please Like, Subscribe and Share it with your friends 🙏🏻🙌🏻
Thank you
You are most welcome 🤗
wonderful explanation
Thank you so much 😊 Please Share it with your friends too ♥️😉
Thank you
You are most welcome 🤗 Please Share it with your friends 😁