2011 44th Hawaii International Conference on System Sciences (2011)
Kauai, Hawaii USA
Jan. 4, 2011 to Jan. 7, 2011
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HICSS.2011.25
This paper proposes a new approach, and studies an algorithm to address the Maximum Diversity Problem (MDP) of recommendations for composite products or services. First, the proposed approach is based on constructing and using a multi-dimensional diversity feature space, which is separate from the utility space used for utility elicitation. Second, we introduce a randomized algorithm, which is based on iterative relaxation of selections by the Greedy algorithm with an exponential probability distribution. The algorithm produces a competitive solution with respect to finding a diverse set from candidate recommendations. Finally, we conduct an experimental study to compare the efficacy and efficiency of the proposed algorithm with two broadly used diversity algorithms, as well as with the exhaustive algorithm, which we could only compute for sets of up to seven returned recommendations. The experimental results show that the proposed algorithm is highly efficient computationally and that in terms of diversity, it consistently outperforms the two competitive algorithms and converges to the optimal solutions on cases run with the exhaustive algorithm in under 100 ms.
G. A. Mihaila, K. Alodhaibi and A. Brodsky, "A Randomized Algorithm for Maximizing the Diversity of Recommendations," 2011 44th Hawaii International Conference on System Sciences(HICSS), Kauai, Hawaii USA, 1899, pp. 1-10.