Skip to content

The hierarchical clustering algorithm with the purpose of creating hierarchical structures of word embeddings.

Notifications You must be signed in to change notification settings

zhutchens/hierarchical_clustering

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

51 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Original Authors

The original authors of this repository can be found at: https://github.com/Doresic/hierarchical_clustering. The original research paper is also available at: https://www.scirp.org/pdf/ijis_2023102015515524.pdf

Current Usage

This paper and repository is currently in use for my undergraduate capstone project, ITSC 4990 - Undergraduate Research. I forked this repository to experiment with how DEBRA can be used with electronic textbooks and fictional books, including an electronic data structures textbook and Harry Potter books. Experimentation is ongoing and we are looking to see if the algorithm can be modified or improved to better suit academic textbooks. The CSV file for the data structures textbook can be found in the data folder of this repository, and the original pdf file can be found at: https://drive.google.com/file/d/12zYSxTt1iQU0qKd6Bg8QqJKAjeahodMR/view?pli=1 As for the Harry Potter CSV, it can be found at: https://github.com/gastonstat/harry-potter-data/blob/main/csv-data-file/harry_potter_books.csv

About

The hierarchical clustering algorithm with the purpose of creating hierarchical structures of word embeddings.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published