ApurvPatki1703/Tries
This is implementation of Trie, Suffix tree data structure. This code is an implementation of the data structures on the lines of lecture by Robert Sedgewick in the course Algorithms 2 on coursera.
Public GitHub Catalog
Discovered Sep 30, 2026
ApurvPatki1703 / MachineLearning
This package can be used when text is to be vectorized and used in tools such as matlab or octave. The package provides text parsing, vectorization using TF and TF-IDF scheme. The output is a sparse file that can directly be loaded in matlab and algorithms can be run on it. Samples for multinomial Naive Bayes classifier, SVM, Logistic Regression are also available.
About this discovery
Public repository record indexed from GitHub. Explore verified star velocity metrics, source code repositories, and curated developer tool directories across the GitHubRepo ecosystem.
#16786132GitHub System ID
ApurvPatki1703Organization / User
PublicVisibility
ActiveCatalog Status
More from ApurvPatki1703
ApurvPatki1703/Secure-Banking-System
Public repository.