Submitted by uwashingtongold t3_100bf73 in MachineLearning
Mental-Swordfish7129 t1_j2llbwf wrote
Reply to comment by uwashingtongold in [D] Establishing similarity between segmentation annotation distributions by uwashingtongold
What if you encode the data with high-dimensional binary vectors and utilize a sparse distributed memory? I've used this approach many times with models I've built and you can measure semantic (Hamming) distance between data and you have a latent space for what similar data would have to look like. It's similar to a self-organizing map approach.
Viewing a single comment thread. View all comments