MeanNearestNeighbors (MNN) - algorithm for balancing dataset - In progress #1

-
Image
One of the challenges in classification problems are unbalanced datasets. I was Data Science Intern when the company that I worked for, assigned me such an interesting challenge where the dataset was unbalanced.  However, I realized this type of problem like unbalanced dataset is а common thing in real life. I tried most of the algorithms (undersampling, oversampling) like SMOTE, NearMiss, CondensedNearestNeighbors, RandomUnderSampler, RandomOverSampler,  KMeansSMOTЕ and rest of them. Anyway, they didn't help me in that case, on the contrary, they worsened my model.  I was like: "but, but, you should have been helpful in creating the predictive model" So, I'm trying to create another algorithm based on undersampling concept when it comes to balancing datasets. I called it Mean Nearest Neighbors (MNN). What's the initial idea: It's simple. Actually, the algorithm is just a modification of the other undersampling algorithms. In the data where target labe...

Competitive Programming #27 : [Reducing Walls]

-
Ishaan is trapped in a city full of walls. To escape from there, if needs to climb N walls, one after the other. He can climb a wall if its height is atmost K.
Ishaan also has a superpower. He can reduce the height of a wall by K by using his superpower once. Since he can't use this power many times, calculate the minimum number of times he has to use this power to go over all the walls.
Input : 
First line of input contains a single integer T denoting the number of test cases.
The first line of each test case contains 2 space-separated integers N and K.
The second line contains N space-separated integers denoting the heights of the walls.
Output : 
For each test case, print the required answer in a new line.
Constraints : 
1 <= T <= 100
1 <= N <= 250
1 <= K <= 10^5
1 <= Height of a Wall <= 10^9
Example :
Input : 
3
5 5
5 3 2 6 8
6 4
2 6 4 8 1 6
4 3
2 2 2 2
Output : 
2
3
0
Explanation : 
Case 1 : 
Heights : 5 3 2 6 8
Ishaan can climb a wall with height atmost 5. So he climbs the first 3 walls easily.
Now he has to use his power to reduce the height of the 4th wall.
After using his power, heights : 5 3 2 1 8
Now to climb the last wall, he again uses his power.
Final heights : 5 3 2 1 3
Case 2 : 
Heights : 2 4 6 8 1 6
Ishaan can climb a wall with height atmost 4. So he climbs the first 2 walls easily.
Now he has to use his power to reduce the height of the 3rd wall.
After using his power, heights : 2 4 2 8 1 6
Now to climb the next wall, he again uses his power.
Heights : 2 4 2 4 1 6
He climbs the 5th wall easily.
To climb the last wall, h uses his power again.
Final Heights : 2 4 2 4 1 2
Case 3 : 
Since all the heights are already below K(=3), Ishaan can climb all the walls without using his powers.

Solution:
---------------------------------------- 
I was afraid of this problem too ... Not cause I thought it is hard, but how many submissions were sent and were incorrect .
(GeeksForGeeks is the platform where I  solve problems) 
So I read the problem and I said 'Hey this is easy , why so  incorrect submissions , where programmers stuck ? ' 
The only thing here is to count how many elements are bigger than Ishaan's SUPERPOWER and to reduce it ...

Popular posts from this blog

Math Problem -> Combinatorics: Foreign alphabet

-
You are given 12 letters in a foreign alphabet.  Eight of the letters are consonants while the remaining four are vowels.  You are asked to create only 5 letter words using these 12 letters.  Each word must contain exactly two vowels and no repetition of letters is allowed.  How many different arrangements can be made? . . . . . . . . . . . . . . . . . . Solution: C(5,2) * (4*3) * (8*7*6) C(5,2) -> 5 letter word , we find the number of words with two vowels. (4*3) - > 2-permutation of 4 vowels (8*7*6) - > 3-permutation of 8 consonants The final step we use rule product .
READ MORE >>

Competitive Programming #29 : [LineUp]

-
Image
To prepare his students for an upcoming game, the sports coach decides to try some new training drills. To begin with, he lines them up and starts with the following warm-up exercise: when the coach says  'L' , he instructs the students to turn to the left. Alternatively, when he says  'R' , they should turn to the right. Finally, when the coach says  'A' , the students should turn around. Unfortunately some students (not all of them, but at least one) can't tell left from right, meaning they always turn right when they hear  'L'  and left when they hear  'R' . The coach wants to know how many times the students end up facing the same direction. Given the list of commands the coach has given, count the number of such commands after which the students will be facing the same direction. Example For  commands = "LLARL" , the output should be lineUp(commands) = 3 . Let's say that there are  4  students, and the second one...
READ MORE >>

Intro to Quantum Computing: Што ќе ми треба ова сега? #1

-
Image
     Да, точно е дека сега нема да ти треба ова. Но, за едно 5-6 години ќе сфатиш дека ова е иднината. Ова ќе биде дел од футуристичката технологија. На Harvard, MIT веќе постојат курсеви и книги за квантно сметање. Веќе постои програмски јазик за квантно програмирање. Провери Q# од Microsoft. Веќе се развиваат квантни алгоритми... Различни области кои почнуваат со зборот Quantum. Еве неколку: AI, Machine Learning, Networking, Cryptography и многу повеќе.      Поразлична е од оваа класична технологија. Пример, ако знаеме дека во класичната технологија информацијата се претставува со два бита 0 и 1, во квантум се користат кјубита и еден кјубит може истовремено да биде 0 или 1. Чудно, нели? Тоа е магијата овде.      Како и да е, тоа не значи дека ќе се исфрли десктоп компјутер, или дека за џабе е се учење сега, ако знаеме дека за 15 години доаѓа технологија која ќе писка низ светов.     IBM, Google, Microsoft, Intel, HP, Alibaba даваа...
READ MORE >>