A graphical heuristic constructs an information graph via approximate nearest neighbors and applies clustering to reduce or partition training data, achieving faster training than LIBSVM's shrinking heuristic with comparable or better prediction accuracy.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
citing papers explorer
-
A graphical heuristic for reduction and partitioning of large datasets for scalable supervised training
A graphical heuristic constructs an information graph via approximate nearest neighbors and applies clustering to reduce or partition training data, achieving faster training than LIBSVM's shrinking heuristic with comparable or better prediction accuracy.
- Computing k-means in mixed precision