turicreate.toolkits.distances.weighted_jaccard — Turi Create API 6.4.1 documentation (original) (raw)

• Data
  • Data Structures
  • Data Types
  • Utilities
• Modelling
  • Applications
  • Essentials
  • Utilities
• Visualization
• Configuration
  • turicreate.config.get_client_log_location
  • turicreate.config.get_environment_config
  • turicreate.config.get_num_gpus
  • turicreate.config.get_runtime_config
  • turicreate.config.set_log_level
  • turicreate.config.set_num_gpus
  • turicreate.config.set_runtime_config

Turi Create API

• Docs »
• Modelling »
• distances »
• turicreate.toolkits.distances.weighted_jaccard

turicreate.toolkits.distances. weighted_jaccard(x, y)¶

Compute the weighted Jaccard distance between between two dictionaries. Suppose \(K_x\) and \(K_y\) are the sets of keys from the two input dictionaries, while \(x_k\) and\(y_k\) are the values associated with key \(k\) in the respective dictionaries. Typically these values are counts, i.e. of words or n-grams.

\[D(x, y) = 1 - \frac{\sum_{k \in K_x \cup K_y} \min\{x_k, y_k\}} {\sum_{k \in K_x \cup K_y} \max\{x_k, y_k\}}\]

Notes

• If a key is missing in one of the two dictionaries, it is assumed to have value 0.

References

• Weighted Jaccard distance: Chierichetti, F., et al. (2010)Finding the Jaccard Median. Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics.

Examples

tc.distances.weighted_jaccard({'a': 2, 'c': 4}, ... {'b': 3, 'c': 12}) 0.7647058823529411