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 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
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
ROS Basics and TurtleSim

Homework 1: Turtle Control Package Anna Garverick This package draws given waypoints, then waits for a service call with a start position to send the

Anna Garverick 1 Nov 22, 2021
Supplementary Data for Evolving Reinforcement Learning Algorithms

evolvingrl Supplementary Data for Evolving Reinforcement Learning Algorithms This dataset contains 1000 loss graphs from two experiments: 500 unique g

John Co-Reyes 42 Sep 21, 2022
Robotic Path Planner for a 2D Sphere World

Robotic Path Planner for a 2D Sphere World This repository contains code implementing a robotic path planner in a 2D sphere world with obstacles. The

Matthew Miceli 1 Nov 19, 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
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
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
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
Greedy Algorithm-Problem Solving

MAX-MIN-Hackrrank-Python-Solution Greedy Algorithm-Problem Solving You will be given a list of integers, , and a single integer . You must create an a

Mahesh Nagargoje 3 Jul 13, 2021
Apriori - An algorithm for frequent item set mining and association rule learning over relational databases

Apriori Apriori is an algorithm for frequent item set mining and association rul

Mohammad Nazari 8 Jan 10, 2022
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
A Python library for simulating finite automata, pushdown automata, and Turing machines

Automata Copyright 2016-2021 Caleb Evans Released under the MIT license Automata is a Python 3 library which implements the structures and algorithms

Caleb Evans 219 Dec 12, 2022
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
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
zoofs is a Python library for performing feature selection using an variety of nature inspired wrapper algorithms. The algorithms range from swarm-intelligence to physics based to Evolutionary. It's easy to use ,flexible and powerful tool to reduce your feature size.

zoofs is a Python library for performing feature selection using a variety of nature-inspired wrapper algorithms. The algorithms range from swarm-intelligence to physics-based to Evolutionary. It's e

Jaswinder Singh 168 Dec 30, 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
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
🧬 Training the car to do self-parking using a genetic algorithm

🧬 Training the car to do self-parking using a genetic algorithm

Oleksii Trekhleb 652 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