We have 128-dimensional vectors representing people's identities where the euclidean metric defines the similarity between them.
Ours solution requires them to be clustered and then annotated (assign real identities to the clusters). This procedure has the purpose of reducing the amount of work necessary to annotate every object - the amount of work needed to annotate objects drops to one fifth since we have the groupings obtained from clustering.
One pass solution with DBSCAN works well, but we would like to do clustering on the fly (gradually). Upload a batch of data, cluster it, annotate it, upload additional batch of data, cluster the additional batch (add them to existing clustering), annotate … If we cluster whole data after new batch then we lost the annotated identities. Is it possible to implement such a solution? Furthermore is it possible to be solved in deterministic manner (no matter on an order of the batches to everytime get the same solution)?