public final class EuclideanDistanceSimilarity extends AbstractItemSimilarity
An implementation of a "similarity" based on the Euclidean "distance" between two users X and Y. Thinking of items as dimensions and preferences as points along those dimensions, a distance is computed using all items (dimensions) where both users have expressed a preference for that item. This is simply the square root of the sum of the squares of differences in position (preference) along each dimension.
The similarity could be computed as 1 / (1 + distance / sqrt(n)), so the resulting values are in the range (0,1]. This would weight against pairs that overlap in more dimensions, which should indicate more similarity, since more dimensions offer more opportunities to be farther apart. Actually, it is computed as sqrt(n) / (1 + distance), where n is the number of dimensions, in order to help correct for this. sqrt(n) is chosen since randomly-chosen points have a distance that grows as sqrt(n).
Note that this could cause a similarity to exceed 1; such values are capped at 1.
Note that the distance isn't normalized in any way; it's not valid to compare similarities computed from different domains (different rating scales, for example). Within one domain, normalizing doesn't matter much as it doesn't change ordering.
Constructor and Description |
---|
EuclideanDistanceSimilarity(DataModel dataModel) |
EuclideanDistanceSimilarity(DataModel dataModel,
Weighting weighting) |
Modifier and Type | Method and Description |
---|---|
double[] |
itemSimilarities(long itemID1,
long[] itemID2s)
A bulk-get version of
ItemSimilarity.itemSimilarity(long, long) . |
double |
itemSimilarity(long itemID1,
long itemID2)
Returns the degree of similarity, of two items, based on the preferences that users have expressed for
the items.
|
void |
refresh(Collection<Refreshable> alreadyRefreshed)
Triggers "refresh" -- whatever that means -- of the implementation.
|
void |
setPreferenceInferrer(PreferenceInferrer inferrer)
Attaches a
PreferenceInferrer to the UserSimilarity implementation. |
String |
toString() |
double |
userSimilarity(long userID1,
long userID2)
Returns the degree of similarity, of two users, based on the their preferences.
|
allSimilarItemIDs, getDataModel
public EuclideanDistanceSimilarity(DataModel dataModel) throws TasteException
IllegalArgumentException
- if DataModel
does not have preference valuesTasteException
public EuclideanDistanceSimilarity(DataModel dataModel, Weighting weighting) throws TasteException
IllegalArgumentException
- if DataModel
does not have preference valuesTasteException
public final void setPreferenceInferrer(PreferenceInferrer inferrer)
UserSimilarity
Attaches a PreferenceInferrer
to the UserSimilarity
implementation.
setPreferenceInferrer
in interface UserSimilarity
inferrer
- PreferenceInferrer
public double userSimilarity(long userID1, long userID2) throws TasteException
UserSimilarity
Returns the degree of similarity, of two users, based on the their preferences.
userSimilarity
in interface UserSimilarity
userID1
- first user IDuserID2
- second user IDDouble.NaN
similarity is unknownNoSuchUserException
- if either user is known to be non-existent in the dataTasteException
- if an error occurs while accessing the datapublic final double itemSimilarity(long itemID1, long itemID2) throws TasteException
ItemSimilarity
Returns the degree of similarity, of two items, based on the preferences that users have expressed for the items.
itemSimilarity
in interface ItemSimilarity
itemID1
- first item IDitemID2
- second item IDDouble.NaN
similarity is unknownNoSuchItemException
- if either item is known to be non-existent in the dataTasteException
- if an error occurs while accessing the datapublic double[] itemSimilarities(long itemID1, long[] itemID2s) throws TasteException
ItemSimilarity
A bulk-get version of ItemSimilarity.itemSimilarity(long, long)
.
itemSimilarities
in interface ItemSimilarity
itemID1
- first item IDitemID2s
- second item IDs to compute similarity withNoSuchItemException
- if any item is known to be non-existent in the dataTasteException
- if an error occurs while accessing the datapublic final void refresh(Collection<Refreshable> alreadyRefreshed)
Refreshable
Triggers "refresh" -- whatever that means -- of the implementation. The general contract is that any
Refreshable
should always leave itself in a consistent, operational state, and that the refresh
atomically updates internal state from old to new.
refresh
in interface Refreshable
refresh
in class AbstractItemSimilarity
alreadyRefreshed
- Refreshable
s that are known to have already been
refreshed as a result of an initial call to a {#refresh(Collection)} method on some
object. This ensure that objects in a refresh dependency graph aren't refreshed twice
needlessly.Copyright © 2008–2015 The Apache Software Foundation. All rights reserved.