The test data, code and detailed description of the AW t-SNE algorithm

Related tags

AlgorithmsAW-t-SNE
Overview

AW-t-SNE

The test data, code and result of the AW t-SNE algorithm

Structure of the folder

Datasets: This folder contains two datasets, the MNIST dataset and the medical record dataset.

MNIST dataset:We selected two easily misidentified digits, 4 and 9, based on the digit labels to form the new dataset(mnist_data(1000) and mnist_data(2000)):

  1. mnist_data(1000):mnist_data(1000) contains a total of 1000 groups of data, each consisting of 784 data point attributes and 1 label attribute.
  2. mnist_data(2000):mnist_data(2000) contains a total of 1000 groups of data, each consisting of 784 data point attributes and 1 label attribute.
  3. handled_mnist_data(1000):the dataset obtained by binarising mnist_data(1000).
  4. handled_mnist_data(2000):the dataset obtained by binarising mnist_data(2000).

Medical Record dataset:A total of 13 attributes are included:

  1. medical record_data:This is our origin medical record data, which contains 13 attributes, namely LOH, COG, AGE, TOO, SDH, LSH, CEH, TCH, CWM, COD, CLH, CCT, CCM.
  2. handled_medical record_data(1000):The dataset is obtained by standardising the medical record_data and randomly selecting 1000 groups of data.
  3. handled_medical record_data(2000):The dataset is obtained by standardising the medical record_data and randomly selecting 2000 groups of data.

Module:This folder contains all the codes that needs to be used.

  1. critic method.py:This is the code for calculating the weights of the data matrix by the critic weight method.
  2. svd method.py:This is the code for calculating the weights of the data matrix by the svd method.
  3. entrophy weight method.py:This is the code for calculating the weights of the data matrix by the entrophy weight method.
  4. PSO(MNIST).py:This is the code to calculate the optimal weights of the MNIST data matrix by the PSO algorithm.
  5. PSO(Medical Record).py:This is the code to calculate the optimal weights of the Medical Record data matrix by the PSO algorithm.
  6. t-SNE(MNIST).py:This is the code for the t-SNE dimensionality reduction algorithm of MNIST data.
  7. t-SNE(medical record).py:This is the code for the t-SNE dimensionality reduction algorithm of Medical Record data.
  8. AW t-SNE(Medical Record).py:This is the code for the t-SNE algorithm for dimensionality reduction of Medical Record data.
  9. AW t-SNE(MNIST).py:This is the code for the t-SNE algorithm for dimensionality reduction of MNIST data.

Result:This folder includes two-dimensional data points generated by the t-sne algorithm and the aw t-sne algorithm after dimensionality reduction of data in datasets

  1. t-SNE_mnist_data(1000).json:The JSON file is a two-dimensional data point set generated by reducing the dimension of 1000 groups of binarized MNIST data using t-sne algorithm
  2. t-SNE_mnist_data(2000).json:The JSON file is a two-dimensional data point set generated by reducing the dimension of 2000 groups of binarized MNIST data using t-sne algorithm
  3. aw t-SNE_mnist_data(1000).json:The JSON file is a two-dimensional data point set generated by reducing the dimension of 1000 groups of binarized MNIST data using aw t-sne algorithm
  4. aw t-SNE_mnist_data(2000).json:The JSON file is a two-dimensional data point set generated by reducing the dimension of 2000 groups of binarized MNIST data using aw t-sne algorithm
  5. t-SNE_medical record_data(1000).json:The JSON file is a two-dimensional data point set generated by reducing the dimension of 1000 groups of binarized medical record data using t-sne algorithm
  6. t-SNE_medical record_data(2000).json:The JSON file is a two-dimensional data point set generated by reducing the dimension of 2000 groups of binarized medical record data using t-sne algorithm
  7. aw t-SNE_medical record_data(1000).json:The JSON file is a two-dimensional data point set generated by reducing the dimension of 1000 groups of binarized medical record data using aw t-sne algorithm
  8. aw t-SNE_medical record_data(2000).json:The JSON file is a two-dimensional data point set generated by reducing the dimension of 2000 groups of binarized medical record data using aw t-sne algorithm
Nature-inspired algorithms are a very popular tool for solving optimization problems.

Nature-inspired algorithms are a very popular tool for solving optimization problems. Numerous variants of nature-inspired algorithms have been develo

NiaOrg 215 Dec 28, 2022
Slight modification to one of the Facebook Salina examples, to test the A2C algorithm on financial series.

Facebook Salina - Gym_AnyTrading Slight modification of Facebook Salina Reinforcement Learning - A2C GPU example for financial series. The gym FOREX d

Francesco Bardozzo 5 Mar 14, 2022
Implementation for Evolution of Strategies for Cooperation

Moraliser Implementation for Evolution of Strategies for Cooperation Dependencies You will need a python3 (= 3.8) environment to run the code. Before

1 Dec 21, 2021
Using Bayesian, KNN, Logistic Regression to classify spam and non-spam.

Make Sure the dataset file "spamData.mat" is in the folder spam\src Environment: Python --version = 3.7 Third Party: numpy, matplotlib, math, scipy

0 Dec 26, 2021
Rover. Finding the shortest pass by Dijkstra’s shortest path algorithm

rover Rover. Finding the shortest path by Dijkstra’s shortest path algorithm Задача Вы — инженер, проектирующий роверы-беспилотники. Вам надо спроекти

1 Nov 11, 2021
CLI Eight Puzzle mini-game featuring BFS, DFS, Greedy and A* searches as solver algorithms.

🕹 Eight Puzzle CLI Jogo do quebra-cabeças de 8 peças em linha de comando desenvolvido para a disciplina de Inteligência Artificial. Escrito em python

Lucas Nakahara 1 Jun 30, 2021
Xor encryption and decryption algorithm

Folosire: Pentru encriptare: python encrypt.py parola fișier pentru criptare fișier encriptat(de tip binar) Pentru decriptare: python decrypt.p

2 Dec 05, 2021
This repository explores an implementation of Grover's Algorithm for knights on a chessboard.

Grover Knights Welcome to my Knights project! Project Description: I explore an implementation of a quantum oracle for knights on a chessboard.

Will Sun 8 Feb 22, 2022
Search algorithm implementations meant for teaching

Search-py A collection of search algorithms for teaching and experimenting. Non-adversarial Search There’s a heavy separation of concerns which leads

Dietrich Daroch 5 Mar 07, 2022
Algoritmos de busca:

Algoritmos-de-Buscas Algoritmos de busca: Abaixo está a interface da aplicação: Ao selecionar o tipo de busca e o caminho, então será realizado o cálc

Elielson Barbosa 5 Oct 04, 2021
So far implements A* will add more later

Pathfinding_Visualization Finds the shortest path between two nodes. The light blue path is the shortest path. The black nodes are barriers. Created i

Lukas DeLoach 1 Jan 18, 2022
Distributed algorithms, reimplemented for fun and practice

Distributed Algorithms Playground for reimplementing and experimenting with algorithms for distributed computing. Usage Running the code for Ring-AllR

Mahan Tourkaman 1 Oct 16, 2022
Algorithms implemented in Python

Python Algorithms Library Laurent Luce Description The purpose of this library is to help you with common algorithms like: A* path finding. String Mat

Laurent Luce 264 Dec 06, 2022
Parameterising Simulated Annealing for the Travelling Salesman Problem

Parameterising Simulated Annealing for the Travelling Salesman Problem Abstract The Travelling Salesman Problem is a well known NP-Hard problem. Given

Gary Sun 55 Jun 15, 2022
Optimal skincare partition finder using graph theory

Pigment The problem of partitioning up a skincare regime into parts such that each part does not interfere with itself is equivalent to the minimal cl

Jason Nguyen 1 Nov 22, 2021
FLIght SCheduling OPTimization - a simple optimization library for flight scheduling and related problems in the discrete domain

Fliscopt FLIght SCheduling OPTimization 🛫 or fliscopt is a simple optimization library for flight scheduling and related problems in the discrete dom

33 Dec 17, 2022
sudoku solver using CSP forward-tracking algorithms.

Sudoku sudoku solver using CSP forward-tracking algorithms. Description Sudoku is a logic-based game that consists of 9 3x3 grids that create one larg

Cindy 0 Dec 27, 2021
A Python implementation of Jerome Friedman's Multivariate Adaptive Regression Splines

py-earth A Python implementation of Jerome Friedman's Multivariate Adaptive Regression Splines algorithm, in the style of scikit-learn. The py-earth p

431 Dec 15, 2022
Python implementation of Aho-Corasick algorithm for string searching

Python implementation of Aho-Corasick algorithm for string searching

Daniel O'Sullivan 1 Dec 31, 2021
The test data, code and detailed description of the AW t-SNE algorithm

AW-t-SNE The test data, code and result of the AW t-SNE algorithm Structure of the folder Datasets: This folder contains two datasets, the MNIST datas

1 Mar 09, 2022