Learn from the best! Meet the four finalists headed to the FINALS of the Power BI Dataviz World Championships! Register now
Hi - I am trying to use power query to create the most optimal matches in a dataset. Think of it as the college dorm assigment problem. I have survey responses from a group of people and I want to match individuals with the most opposite responses. The issue is rather than create a unique score for each person, the individual's responses are compared to every other person to create a score for every possible pairing. I have been able to create a matrix with the participants on the X and Y axis and their pairing score. Now I need to select the pairings with the highest scores, without any of the participants being selected more than once.
After some digging, it appears to be a perfect use case for the hungarian aglorithm, does anyone know how to do this in Power Query, or maybe have the Python code to do it?
Thanks in advance
Solved! Go to Solution.
Hi @Anonymous ,
About Hungarian Algorithm in python, I think you could refer these two simliar articles which introduce it in details:
Best Regards,
Community Support Team _ Yingjie Li
If this post helps, then please consider Accept it as the solution to help the other members find it more quickly.
Hi @Anonymous ,
About Hungarian Algorithm in python, I think you could refer these two simliar articles which introduce it in details:
Best Regards,
Community Support Team _ Yingjie Li
If this post helps, then please consider Accept it as the solution to help the other members find it more quickly.
If you have recently started exploring Fabric, we'd love to hear how it's going. Your feedback can help with product improvements.
A new Power BI DataViz World Championship is coming this June! Don't miss out on submitting your entry.
Share feedback directly with Fabric product managers, participate in targeted research studies and influence the Fabric roadmap.
| User | Count |
|---|---|
| 6 | |
| 4 | |
| 3 | |
| 2 | |
| 2 |
| User | Count |
|---|---|
| 11 | |
| 10 | |
| 8 | |
| 7 | |
| 7 |