| http://www.w3.org/ns/prov#value | - Ideally the algorithm should return values between -1 and 1 but since we hav a large set of data therefore it is giving values such as 1.0327955589886444 and 1.1547005383792517 so can u suggest us some solution to this problem or any other efficient algorithm for finding similarity between users.the input file is a dictionary of users, their choices and ranking.eg: dict1={user1:{choice1:rank1,choi
|
