method
active
method:lcs-k-nn

LCS k-NN

Calculates the longest common subsequence of nearest neighbors normalized by sequence length

Related by similarity (8)

cosine ≥ 0.65 · no typed edge

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

  • Alternative alignment metric compared in appendix; calculates longest common subsequence of nearest neighbor lists
  • Cycle k-NNmethod0.790
    Alternative alignment metric; measures whether nearest neighbor in one domain also considers original sample as nearest neighbor in other domain
  • Edit k-NNmethod0.780
    Computes edit distance required to match nearest neighbors between two datasets, normalized by maximum edit distance
  • Alternative alignment metric compared in appendix; computes edit distance between nearest neighbor lists
  • KL Controlframework0.707
    Control framework minimizing expected complexity; shown to be a special case of expected free energy minimization
  • N. Lubbersconcept0.685
    Collaborator on generalized asset exchange and mean-field models of wealth dynamics.
  • K-Compositionconcept0.682
    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
  • Scale where each object has all but one attribute.