Currently there is a many-to-many relation between a duplicate and its master, such as;
4 --> 5
4 --> 6
3 --> 6
3 --> 7
But allowing each issue to only be recorded once as a duplicate may reduce the amount of false duplicates significantly. This would instead give;
4 --> 5
3 --> 6
where the duplicate pair with highest cosine similarity would be kept, and possibly replacing earlier pair of duplicate --> master issues if a newer combination is found with higher similarity.
mantono
commented
8 years ago
Currently there is a many-to-many relation between a duplicate and its master, such as;
4 --> 5 4 --> 6 3 --> 6 3 --> 7
But allowing each issue to only be recorded once as a duplicate may reduce the amount of false duplicates significantly. This would instead give;
4 --> 5 3 --> 6
where the duplicate pair with highest cosine similarity would be kept, and possibly replacing earlier pair of duplicate --> master issues if a newer combination is found with higher similarity.