Go to file
Adler Neves f967372844
implementing kgraph perimeter disambiguation
2023-11-12 18:53:59 -03:00
.gitignore implementing kgraph perimeter disambiguation 2023-11-12 18:53:59 -03:00
Makefile implementing kgraph perimeter disambiguation 2023-11-12 18:53:59 -03:00
README.md implementing kgraph perimeter disambiguation 2023-11-12 18:53:59 -03:00
query.sql implementing kgraph perimeter disambiguation 2023-11-12 18:53:59 -03:00
tosqlite.py first commit 2023-11-12 16:06:09 -03:00

README.md

SQL Clusterizer

This project is a Proof-of-Cocept that has the goal to demonstrate that SQL can be used to do really basic clusterization workloads, even if it's barely useful for more complex real-world scenarios, such as this approach that picks the most distant point within cartesian distance and later picks the closest reference point.

As this approach may technically count as some very primitive sort of machine learning, this implies that pretty much every SQL database in production is able to do machine learning.

How well it scales

It takes about a dozen seconds to cluster 64 records with 4 features each (it's tinier than most toy datasets).

Prefer using a library within your programming language instead.

See also