Longest Common Subsequence k-NN

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.

• LCS k-NNmethod0.804
  Calculates the longest common subsequence of nearest neighbors normalized by sequence length
• Edit k-NNmethod0.763
  Computes edit distance required to match nearest neighbors between two datasets, normalized by maximum edit distance
• Cycle k-NNmethod0.762
  Alternative alignment metric; measures whether nearest neighbor in one domain also considers original sample as nearest neighbor in other domain
• Edit Distance k-NNmethod0.720
  Alternative alignment metric compared in appendix; computes edit distance between nearest neighbor lists
• K-Compositionconcept0.695
  A form of attention head composition where W_K reads from a subspace affected by a previous head; central to how induction heads are implemented
• Rank-one subcomponentsconcept0.687
  The atomic pieces into which weight matrices are decomposed by VPD; each rank-one component is interpretable.
• network of sequencesconcept0.686
  The interdependence of morphogenetic sequences, where each triggers others to repair the whole environment, analogous to arithmetic operations.
• KL Divergenceconcept0.685
  A measure of the difference between two probability distributions, used extensively in free energy formulations.