0

If we have a input of a dictionary with format {key: [list]} like below

Key1: [value01, value02, value 03]
Key2: [value02, value04, value 05]
Key3: [value01, value03, value 07]
Key4: [value01, value03, value 04]

The values are strings Is there a way where we can group/cluster the keys based on the similarity between it's values(lists) in python?

Consider this as a huge data of 1M Keys and group the keywords with common values of more than 2. Like in the above example, I can group keys into two sets. (Key1, Key3, Key4), (Key2). Is there any way to do that in graph based method, instead of using for loops?

Tried for loops, but it was taking hours to complete for the large data set.

Sunderam Dubey
  • 1
  • 11
  • 20
  • 40
Bhavya R
  • 1
  • 1
  • Do you have a maximum length of the lists associated to keys (is it always 3 items per list) ? Also, is there a know number of distinct values (or order of magnitude) ? – Alain T. Feb 13 '23 at 18:01
  • It is actually 10 items per list always.. not any known number of distinct values – Bhavya R Feb 13 '23 at 19:00

0 Answers0