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 #1: [Longest sub-sequence such that difference between adjacents is one]

-
Here is the problem :

Given an array of size n. The task is to find the longest subsequence such that absolute difference between adjacents is one.
                                                                                Input:
The first line consists of an integer T i.e number of test cases. The first line of each test case consists of an integer n.The next line consists of n spaced integers.    
Output:
Print the required answer.
Constraints: 
1<=T<=100
1<=n,a[i]<=100000
Example:
Input:
2
7
10 9 4 5 4 8 6
8
1 2 3 2 3 7 2 1
Output:
3
7
First what comes to your mind that solution can be done with nested loops, but we see the input of elements in array is 1<=n . n can be very big number (lets say 10^5 >). So time complexity must be O(n). Here is my code:


  And this is all about the algorithm . Finally the integer maxi is that longest sub-sequence . If you don't understand this explаnation, use Debugger

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 >>