{"id":"1908.08619","title":"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms","url":"https://codeofpaper.com/paper/1908.08619","arxiv_url":"https://arxiv.org/abs/1908.08619","published":"2019-08-22","code":"official","best":{"full_name":"AI-secure/KNN-PVLDB","url":"https://github.com/AI-secure/KNN-PVLDB","tier":"official","stars":27,"license":null,"framework":null,"language":"Jupyter Notebook","last_commit":"2020-02-21T07:50:54"},"most_starred_community":null,"implementations":[{"full_name":"AI-secure/KNN-PVLDB","url":"https://github.com/AI-secure/KNN-PVLDB","tier":"official","stars":27,"license":null,"framework":null,"language":"Jupyter Notebook","last_commit":"2020-02-21T07:50:54"}],"possible_matches":0}