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 description of the Kinematic Bicycle Model with an animated example.

Kinematic Bicycle Model Abstract A python library for the Kinematic Bicycle model. The Kinematic Bicycle is a compromise between the non-linear and li

Winston H. 36 Dec 23, 2022
PathPlanning - Common used path planning algorithms with animations.

Overview This repository implements some common path planning algorithms used in robotics, including Search-based algorithms and Sampling-based algori

Huiming Zhou 5.1k Jan 08, 2023
Genetic algorithm which evolves aoe2 DE ai scripts

AlphaScripter Use the power of genetic algorithms to evolve AI scripts for Age of Empires II : Definitive Edition. For now this package runs in AOC Us

6 Nov 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
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
A simple python implementation of A* and bfs algorithm solving Eight-Puzzle

A simple python implementation of A* and bfs algorithm solving Eight-Puzzle

2 May 22, 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
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
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
Code for generating alloy / disordered structures through the special quasirandom structure (SQS) algorithm

Code for generating alloy / disordered structures through the special quasirandom structure (SQS) algorithm

Bruno Focassio 1 Nov 10, 2021
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
A priority of preferences for teacher assignment problem

Genetic-Algorithm-for-Assignment-Problem A priority of preferences for teacher assignment problem Keywords k-partition; clustering; education 4.0 Abst

hades 2 Oct 31, 2022
Resilient Adaptive Parallel sImulator for griD (rapid)

Rapid is an open-source software library that implements a novel “parallel-in-time” (Parareal) algorithm and semi-analytical solutions for co-simulation of integrated transmission and distribution sy

Richard Lincoln 7 Sep 07, 2022
8 Puzzle with A* , Greedy & BFS Search in Python

8_Puzzle 8 Puzzle with A* , Greedy & BFS Search in Python Python Install Python from here. Pip Install pip from here. How to run? 🚀 Install 8_Puzzle

I3L4CK H4CK3l2 1 Jan 30, 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
This repository is not maintained

This repository is no longer maintained, but is being kept around for educational purposes. If you want a more complete algorithms repo check out: htt

Nic Young 2.8k Dec 30, 2022
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
iAWE is a wonderful dataset for those of us who work on Non-Intrusive Load Monitoring (NILM) algorithms.

iAWE is a wonderful dataset for those of us who work on Non-Intrusive Load Monitoring (NILM) algorithms. You can find its main page and description via this link. If you are familiar with NILM-TK API

Mozaffar Etezadifar 3 Mar 19, 2022
PickMush - A mini study/project on boosting algorithm

PickMush A mini project implementing Boosting Author Shashwat Vaibhav What does it do? Classifies whether Mushroom is edible or is non-edible (binary

Shashwat Vaibahav 3 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