Python - Remove Elements in K distance with N

Minkowski distance in Python

Last Updated : 17 Apr, 2023

Minkowski distance is a metric in a normed vector space. Minkowski distance is used for distance similarity of vector. Given two or more vectors, find distance similarity of these vectors.

Mainly, Minkowski distance is applied in machine learning to find out distance similarity.

Examples :

Input : vector1 = 0 2 3 4
        vector2 = 2, 4, 3, 7
        p = 3

Output : distance1 = 3.5033

Input : vector1 = 1, 4, 7, 12, 23
        vector2 = 2, 5, 6, 10, 20
        p = 2

Output : distance2 = 4.0

Note : Here distance1 and distance2 are almost same so it will be in same near region.

Python3

# Python3 program to find Minkowski distance

# import math library
from math import *
from decimal import Decimal

# Function distance between two points 
# and calculate distance value to given
# root value(p is root value)
def p_root(value, root):
    
    root_value = 1 / float(root)
    return round (Decimal(value) **
             Decimal(root_value), 3)

def minkowski_distance(x, y, p_value):
    
    # pass the p_root function to calculate
    # all the value of vector parallelly 
    return (p_root(sum(pow(abs(a-b), p_value)
            for a, b in zip(x, y)), p_value))

# Driver Code
vector1 = [0, 2, 3, 4]
vector2 = [2, 4, 3, 7]
p = 3
print(minkowski_distance(vector1, vector2, p))

Output :

3.503

Time Complexity : O(N)

Auxiliary Space : O(N)

Reference :
https://en.wikipedia.org/wiki/Minkowski_distance

Python - Remove Elements in K distance with N

S

shrikanth13

Improve

Article Tags :

Practice Tags :

python

Similar Reads

Python - Actual order index distance

Sometimes we have an unsorted list and we wish to find the actual position the elements could be when they would be sorted, i.e we wish to construct the list which could give the position distance to each element destined if the list was sorted. This has a good application in web development and com

Python - Non K distant elements

Given a list, the task is to write a Python program to extract all the elements such that no element is at K distant from one other. Examples: Input : test_list = [8, 10, 16, 20, 3, 1, 7], K = 2 Output : [16, 20, 7] Explanation : 16 + 2 = 18, 16 - 2 = 14, both are not in list, hence filtered. Input

Python | Maximum distance between elements

Sometimes, while working with lists, we can have a problem in which we need to find maximum distance between reoccurring elements. This kind of problem can have application in competitive programming and web development domain. Let's discuss certain way in which this task can be performed. Method 1:

Python - Remove Elements in K distance with N

Given a list, remove all elements which are within K distance with N. Input : test_list = [4, 5, 9, 1, 10, 6, 13 ], K = 3, N = 5 Output : [9, 1, 10, 13] Explanation : 4 is removed as 5 - 4 = 1 < 3, hence its within distance. Input : test_list = [1, 10, 6, 13 ], K = 3, N = 5 Output : [1, 10, 13] E

Python | Cropped list Minimum

Sometimes, we require to shrink a list by deletion of its certain elements. One of the methods that is employed to perform this particular task is front and rear element deletion and we also desire to find minimum of this list. It is a good utility whose solution can be useful to have. Letâ€™s discuss

Python - Distance between occurrences

Sometimes, while working with Python Strings, we can have a task in which we need to find the indices difference between occurrences of a particular character. This can have applications in domains such as day-day programming. Let us discuss certain ways in which this task can be done. Method #1: Us

Minimum Value Keys in Dictionary - Python

We are given a dictionary and need to find all the keys that have the minimum value among all key-value pairs. The goal is to identify the smallest value in the dictionary and then collect every key that matches it. For example, in {'a': 3, 'b': 1, 'c': 2, 'd': 1}, the minimum value is 1, so the res

Python | Maximum Difference in String

Sometimes, we might have a problem in which we require to get the maximum difference of 2 numbers from Strings but with a constraint of having the numbers in successions. This type of problem can occur while competitive programming. Letâ€™s discuss certain ways in which this problem can be solved. Met

Python | Minimum Difference in Matrix Columns

This particular article focuses on a problem that has utility in competitive as well as day-day programming. Sometimes, we need to get the minimum difference between the like indices when compared with the next list. The minimum difference between the like elements in that index is returned. Letâ€™s d

Python - Get minimum difference in Tuple pair

Sometimes, while working with data, we might have a problem in which we need to find minimum difference between available pairs in list. This can be application to many problems in mathematics domain. Letâ€™s discuss certain ways in which this task can be performed.Method #1 : Using min() + list compr