A k-dissimilarity D on a finite set X, |X| ≥ k, is a map from the set of size k subsets of X to the real numbers. Such … (<CitationRef CitationID="CR19">2004</CitationRef>) recently posed the following question: Given an arbitrary k-dissimilarity, how … ≥ 3 a k-dissimilarity on a set X arises from a tree if and only if its restriction to every 2 k-element subset of X arises …

Many content-based recommendation approaches are based on a dissimilarity measure based on the product attributes. In … this paper, we evaluate four dissimilarity measures for product recommendation using an online survey. In this survey, we … dissimilarity measures with. Also, we use this matrix to estimate weights to be used in the dissimilarity measures. In this way, we …

dissimilarity indexes to determine when chaining is appropriate. This study provides the first empirical application of … dissimilarity indexes in this context. We find that dissimilarity indexes do not appear to be sufficient to resolve the issue of …

Many content-based recommendation approaches are based on a dissimilarity measure based on the product attributes. In … this paper, we evaluate four dissimilarity measures for product recommendation using an online survey. In this survey, we … dissimilarity measures with. Also, we use this matrix to estimate weights to be used in the dissimilarity measures. In this way, we …