Movatterモバイル変換

Question 1

3votes

0answers

766views

Rust code implementing cosine similarity

I've been trying to create a piece of code which consists of looping through each element of a list of questions, preprocess it, and then calculate the Cosine similarity with the rest of the elements (...

Shodai Thox

31

askedJun 24, 2022 at 13:04

Question 2

1vote

1answer

78views

Dividing shared resources for homogeneous multithread processing

I'm trying to implement a homogeneous multithreading example that multiple threads process portion of a huge task. In order to achieve this, I thought of clustering data/resource and multiple threads ...

YoonSeok OH

111

askedJan 1, 2022 at 10:03

Question 3

1vote

1answer

413views

Implement 2D and 1D std::array in opencl kernel

I am asked to implement the following part of code into kernel code. Actually, I have tried but not sure about thestd::array.This is the original code for the ...

user247399

11

askedAug 22, 2021 at 9:38

Question 4

0votes

2answers

467views

Multithreaded implementation of K-means clustering algorithm in Java

Hello I have written a multi-threaded implementation of the K-means clustering algorithm. The main goals are correctness and scalable performance on multi-core CPUs. I expect to code to not have race ...

Teodor Dyakov

477

askedFeb 26, 2021 at 18:50

Question 5

1vote

1answer

252views

Calculation of the Distance Matrix in the K-Means Algorithm in MATLAB

Purpose of the code :To assign the corresponding label of the centroids to the points which are close to it. Below is a graphical (2D) example.Variable X is a matrix, rows represent the points, ...

the_illuminated2003

125

askedJan 1, 2021 at 19:16

Question 6

2votes

1answer

297views

A Tiny Nearest Neighbor Classification Implementation in C#

I am practicing to implement the KNN classification tool in C#. The basic point structure is constructed by the classPoint, and there are two members in ...

JimmyHu

7,575

askedOct 11, 2020 at 10:36

Question 7

4votes

1answer

318views

K-clustering algorithm using Kruskal MST with Disjoint Set in place to check for cycles

here below a working implementation that finds the minimal distance between k(set=4 below) clusters in a graph.I have doubts mainly on the implementation of the ...

Giogre

515

askedSep 13, 2020 at 15:38

Question 8

6votes

0answers

147views

K nearest neighbours algorithm

Here is a project that I worked on for a few days in June 2020. Since the algorithm is extremely slow, I looked into methods in order to parallelize operations but did not obtain any satisfactory ...

Aaron John Sabu

163

askedJul 1, 2020 at 3:53

Question 9

3votes

1answer

279views

Implementation of K-means

I have recently built a class that is an implementation of kMeans from scratch. I believe there is room for improvement and I would happily receive some feedback. The project can be found at: https://...

Empan

73

askedFeb 9, 2020 at 15:33

Question 10

6votes

1answer

607views

Schelling's model of Segregation Python implementation with Geopandas

If you don't know what is Schelling's model of segregation, you can read it here. The Schelling model of segregation is an agent-based model that illustrates how individual tendencies regarding ...

Kartikeya Sharma

265

askedAug 5, 2019 at 2:37

Question 11

5votes

2answers

5kviews

Grouping sorted coordinates based on proximity to each other

I created an algotrithm that groups a sortedlist of coordinates into buckets based on their proximity (30) to one another. Steps:Create a new key with a list ...

Josh Sharkey

153

askedJul 22, 2019 at 21:50

Question 12

1vote

1answer

4kviews

Clustering using k-medoids

This is the program function code for clustering using k-medoids...

dodo

21

askedJun 24, 2019 at 16:34

Question 13

2votes

0answers

134views

Machine learning, kNN and Naïve Bayes algorithm

This is the task I am working on: In this assignment you will implement the K-Nearest Neighbour and Naïve Bayes algorithms and evaluate them on a real dataset using the stratified cross validation ...

Rafiul Nakib

49

askedJun 19, 2019 at 16:42

Question 14

1vote

1answer

781views

Welford's online variance calculation algorithm for vectors

I'm developing a face recognizing application using the face_recognition Python library. The faces are encoded as 128-dimension floating-point vectors. In addition to this, each named known person ...

DannyNiu

320

askedMar 22, 2019 at 8:18

Question 15

3votes

0answers

557views

Locality Sensitive Hash (similar to k-Nearest Neighbor), in Python+Numpy

I've tried implementing Locality Sensitive Hash, the algorithm that helps recommendation engines, and powers apps like Shazzam that can identify songs you heard at restaurants.LSH is supposed to run ...

Josh.F

187

askedJan 30, 2019 at 23:50

Movatterモバイル変換

Stack Exchange Network

Questions tagged [clustering]

Rust code implementing cosine similarity

Dividing shared resources for homogeneous multithread processing

Implement 2D and 1D std::array in opencl kernel

Multithreaded implementation of K-means clustering algorithm in Java

Calculation of the Distance Matrix in the K-Means Algorithm in MATLAB

A Tiny Nearest Neighbor Classification Implementation in C#

K-clustering algorithm using Kruskal MST with Disjoint Set in place to check for cycles

K nearest neighbours algorithm

Implementation of K-means

Schelling's model of Segregation Python implementation with Geopandas

Grouping sorted coordinates based on proximity to each other

Clustering using k-medoids

Machine learning, kNN and Naïve Bayes algorithm

Welford's online variance calculation algorithm for vectors

Locality Sensitive Hash (similar to k-Nearest Neighbor), in Python+Numpy

Hot Network Questions

Subscribe to RSS