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
A Python program to easily solve the n-queens problem using min-conflicts algorithm

QueensProblem A program to easily solve the n-queens problem using min-conflicts algorithm Performances estimated with a sample of 1000 different rand

0 Oct 21, 2022
Solving a card game with three search algorithms: BFS, IDS, and A*

Search Algorithms Overview In this project, we want to solve a card game with three search algorithms. In this card game, we have to sort our cards by

Korosh 5 Aug 04, 2022
This is an implementation of the QuickHull algorithm in Python. I

QuickHull This is an implementation of the QuickHull algorithm in Python. It randomly generates a set of points and finds the convex hull of this set

Anant Joshi 4 Dec 04, 2022
A Python project for optimizing the 8 Queens Puzzle using the Genetic Algorithm implemented in PyGAD.

8QueensGenetic A Python project for optimizing the 8 Queens Puzzle using the Genetic Algorithm implemented in PyGAD. The project uses the Kivy cross-p

Ahmed Gad 16 Nov 13, 2022
Visualisation for sorting algorithms. Version 2.0

Visualisation for sorting algorithms v2. Upped a notch from version 1. This program provides animates simple, common and popular sorting algorithms, t

Ben Woo 7 Nov 08, 2022
A lightweight, object-oriented finite state machine implementation in Python with many extensions

transitions A lightweight, object-oriented state machine implementation in Python with many extensions. Compatible with Python 2.7+ and 3.0+. Installa

4.7k Jan 01, 2023
Provide player's names and mmr and generate mathematically balanced teams

Lollo's matchmaking algorithm Provide player's names and mmr and generate mathematically balanced teams How to use Fill the input.json file with your

4 Aug 04, 2022
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
Python Client for Algorithmia Algorithms and Data API

Algorithmia Common Library (python) Python client library for accessing the Algorithmia API For API documentation, see the PythonDocs Algorithm Develo

Algorithmia 138 Oct 26, 2022
BCI datasets and algorithms

Brainda Welcome! First and foremost, Welcome! Thank you for visiting the Brainda repository which was initially released at this repo and reorganized

52 Jan 04, 2023
Policy Gradient Algorithms (One Step Actor Critic & PPO) from scratch using Numpy

Policy Gradient Algorithms From Scratch (NumPy) This repository showcases two policy gradient algorithms (One Step Actor Critic and Proximal Policy Op

1 Jan 17, 2022
A* (with 2 heuristic functions), BFS , DFS and DFS iterativeA* (with 2 heuristic functions), BFS , DFS and DFS iterative

Descpritpion This project solves the Taquin game (jeu de taquin) problem using different algorithms : A* (with 2 heuristic functions), BFS , DFS and D

Ayari Ahmed 3 May 09, 2022
Repository for data structure and algorithms in Python for coding interviews

Python Data Structures and Algorithms This repository contains questions requiring implementation of data structures and algorithms concepts. It is us

Prabhu Pant 1.9k Jan 01, 2023
Algorithm for Cutting Stock Problem using Google OR-Tools. Link to the tool:

Cutting Stock Problem Cutting Stock Problem (CSP) deals with planning the cutting of items (rods / sheets) from given stock items (which are usually o

Emad Ehsan 87 Dec 31, 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
Dynamic Programming-Join Optimization Algorithm

DP-JOA Join optimization is the process of optimizing the joining, or combining, of two or more tables in a database. Here is a simple join optimizati

Haoze Zhou 3 Feb 03, 2022
Implementation of an ordered dithering algorithm used in computer graphics

Ordered Dithering Project In this project, we use an ordered dithering method to turn an RGB image, first to a gray scale image and then, turn the gra

1 Oct 26, 2021
Python based framework providing a simple and intuitive framework for algorithmic trading

Harvest is a Python based framework providing a simple and intuitive framework for algorithmic trading. Visit Harvest's website for details, tutorials

100 Jan 03, 2023
N Queen Problem using Genetic Algorithm

The N Queen is the problem of placing N chess queens on an N×N chessboard so that no two queens attack each other.

Mahdi Hassanzadeh 2 Nov 11, 2022
frePPLe - open source supply chain planning

frePPLe Open source supply chain planning FrePPLe is an easy-to-use and easy-to-implement open source advanced planning and scheduling tool for manufa

frePPLe 385 Jan 06, 2023