8.1.6 Computing Similar Vertices for a Given Vertex
You can fetch the k
most similar vertices for a given vertex as described in the following code:
Computing Similar Vertices for Given Vertex Using
JShell
opg4j> var similars = model.computeSimilars("Albert_Einstein", 10);
opg4j> similars.print();
Computing Similar Vertices for Given Vertex Using
Java
PgxFrame similars = model.computeSimilars("Albert_Einstein", 10);
similars.print();
Computing Similar Vertices for Given Vertex Using Python
similars = model.compute_similars("Albert_Einstein",10)
similars.print()
Searching for similar vertices for Albert_Einstein using the trained model, will result in the following output:
+-----------------------------------------+ | dstVertex | similarity | +-----------------------------------------+ | Albert_Einstein | 1.0000001192092896 | | Physics | 0.8664291501045227 | | Werner_Heisenberg | 0.8625140190124512 | | Richard_Feynman | 0.8496938943862915 | | List_of_physicists | 0.8415523767471313 | | Physicist | 0.8384397625923157 | | Max_Planck | 0.8370327353477478 | | Niels_Bohr | 0.8340970873832703 | | Quantum_mechanics | 0.8331197500228882 | | Special_relativity | 0.8280861973762512 | +-----------------------------------------+
Parent topic: Using the DeepWalk Algorithm