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
Silver Trading Algorithm

Silver Trading Algorithm This project was done in the context of the Applied Algorithm Trading Course (FINM 35910) at the University of Chicago. Motiv

Laurent Lanteigne 1 Jan 29, 2022
8-puzzle-solver with UCS, ILS, IDA* algorithm

Eight Puzzle 8-puzzle-solver with UCS, ILS, IDA* algorithm pre-usage requirements python3 python3-pip virtualenv prepare enviroment virtualenv -p pyth

Mohsen Arzani 4 Sep 22, 2021
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
Our implementation of Gillespie's Stochastic Simulation Algorithm (SSA)

SSA Our implementation of Gillespie's Stochastic Simulation Algorithm (SSA) Requirements python =3.7 numpy pandas matplotlib pyyaml Command line usag

Anoop Lab 1 Jan 27, 2022
Sign data using symmetric-key algorithm encryption.

Sign data using symmetric-key algorithm encryption. Validate signed data and identify possible validation errors. Uses sha-(1, 224, 256, 385 and 512)/hmac for signature encryption. Custom hash algori

Artur Barseghyan 39 Jun 10, 2022
Algorithmic Trading with Python

Source code for Algorithmic Trading with Python (2020) by Chris Conlan

Chris Conlan 1.3k Jan 03, 2023
An open source algorithm and dataset for finding poop in pictures.

The shitspotter module is where I will be work on the "shitspotter" poop-detection algorithm and dataset. The primary goal of this work is to allow for the creation of a phone app that finds where yo

Jon Crall 29 Nov 29, 2022
Genetic Algorithm for Robby Robot based on Complexity a Guided Tour by Melanie Mitchell

Robby Robot Genetic Algorithm A Genetic Algorithm based Robby the Robot in Chapter 9 of Melanie Mitchell's book Complexity: A Guided Tour Description

Matthew 2 Dec 01, 2022
Minimal pure Python library for working with little-endian list representation of bit strings.

bitlist Minimal Python library for working with bit vectors natively. Purpose This library allows programmers to work with a native representation of

Andrei Lapets 0 Jul 25, 2022
Algorithmic virtual trading using the neostox platform

Documentation Neostox doesnt have an API Support, so this is a little selenium code to automate strategies How to use Clone this repository and then m

Abhishek Mittal 3 Jul 20, 2022
Algorithms-in-Python - Programs related to DSA in Python for placement practice

Algorithms-in-Python Programs related to DSA in Python for placement practice CO

MAINAK CHAUDHURI 2 Feb 02, 2022
With this algorithm you can see all best positions for a Team.

Best Positions Imagine that you have a favorite team, and you want to know until wich position your team can reach With this algorithm you can see all

darlyn 4 Jan 28, 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
Tic-tac-toe with minmax algorithm.

Tic-tac-toe Tic-tac-toe game with minmax algorithm which is a research algorithm his objective is to find the best move to play by going through all t

5 Jan 27, 2022
Algorithms and data structures for educational, demonstrational and experimental purposes.

Algorithms and Data Structures (ands) Introduction This project was created for personal use mostly while studying for an exam (starting in the month

50 Dec 06, 2022
Cormen-Lib - An academic tool for data structures and algorithms courses

The Cormen-lib module is an insular data structures and algorithms library based on the Thomas H. Cormen's Introduction to Algorithms Third Edition. This library was made specifically for administeri

Cormen Lib 12 Aug 18, 2022
Multiple Imputation with Random Forests in Python

miceforest: Fast, Memory Efficient Imputation with lightgbm Fast, memory efficient Multiple Imputation by Chained Equations (MICE) with lightgbm. The

Samuel Wilson 202 Dec 31, 2022
It is a platform that implements some path planning algorithms.

PathPlanningAlgorithms It is a platform that implements some path planning algorithms. Main dependence: python3.7, opencv4.1.1.26 (for image show) Tip

5 Feb 24, 2022
Primedice like provably fair algorithm

Primedice like provably fair algorithm

Ryu juheon 3 Dec 02, 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