-
-
Notifications
You must be signed in to change notification settings - Fork 46.9k
added self organising maps algorithm in the machine learning section. #6877
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Changes from 8 commits
e1cdd45
9015ab7
ceaeb71
df8c8da
1e6dc55
322d95a
5b2ae6d
f16c1a5
3b46315
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,74 @@ | ||
""" | ||
https://en.wikipedia.org/wiki/Self-organizing_map | ||
""" | ||
import math | ||
|
||
|
||
class SelfOrganizingMap: | ||
def get_winner(self, weights: list[list[float]], sample: list[int]) -> int: | ||
""" | ||
Compute the winning vector by Euclidean distance | ||
|
||
>>> SelfOrganizingMap().get_winner([[1, 2, 3], [4, 5, 6]], [1, 2, 3]) | ||
1 | ||
""" | ||
d0 = 0.0 | ||
d1 = 0.0 | ||
for i in range(len(sample)): | ||
d0 += math.pow((sample[i] - weights[0][i]), 2) | ||
d1 += math.pow((sample[i] - weights[1][i]), 2) | ||
return 0 if d0 > d1 else 1 | ||
return 0 | ||
|
||
def update( | ||
self, weights: list[list[int | float]], sample: list[int], j: int, alpha: float | ||
cclauss marked this conversation as resolved.
Show resolved
Hide resolved
cclauss marked this conversation as resolved.
Show resolved
Hide resolved
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Please provide descriptive name for the parameter: |
||
) -> list[list[int | float]]: | ||
""" | ||
Update the winning vector. | ||
|
||
>>> SelfOrganizingMap().update([[1, 2, 3], [4, 5, 6]], [1, 2, 3], 1, 0.1) | ||
[[1, 2, 3], [3.7, 4.7, 6]] | ||
""" | ||
for i in range(len(weights)): | ||
weights[j][i] += alpha * (sample[i] - weights[j][i]) | ||
return weights | ||
|
||
|
||
# Driver code | ||
def main() -> None: | ||
cclauss marked this conversation as resolved.
Show resolved
Hide resolved
cclauss marked this conversation as resolved.
Show resolved
Hide resolved
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. As there is no test file in this pull request nor any test function or class in the file There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. @dhruvmanila Does the |
||
# Training Examples ( m, n ) | ||
training_samples = [[1, 1, 0, 0], [0, 0, 0, 1], [1, 0, 0, 0], [0, 0, 1, 1]] | ||
m, n = len(training_samples), len(training_samples[0]) | ||
|
||
# weight initialization ( n, C ) | ||
weights = [[0.2, 0.6, 0.5, 0.9], [0.8, 0.4, 0.7, 0.3]] | ||
|
||
# training | ||
self_organizing_map = SelfOrganizingMap() | ||
epochs = 3 | ||
alpha = 0.5 | ||
|
||
for i in range(epochs): | ||
for j in range(m): | ||
|
||
# training sample | ||
sample = training_samples[j] | ||
|
||
# Compute the winning vector | ||
winner = self_organizing_map.get_winner(weights, sample) | ||
|
||
# Update the winning vector | ||
weights = self_organizing_map.update(weights, sample, winner, alpha) | ||
|
||
# classify test sample | ||
sample = [0, 0, 0, 1] | ||
winner = self_organizing_map.get_winner(weights, sample) | ||
|
||
# results | ||
print(f"Clusters that the test sample belongs to : {winner}") | ||
print(f"Weights that have been trained : {weights}") | ||
|
||
|
||
# running the main() function | ||
if __name__ == "__main__": | ||
main() |
Uh oh!
There was an error while loading. Please reload this page.