Abstract
We present improved 2/α approximation guarantee for the problem of selecting diverse set of p items when its formulation is based on Max Sum Facility Dispersion problem and the underlying dissimilarity measure satisfies parameterised triangle inequality with parameter α.
Diversity-aware approach is gaining interest in many important applications such as web search, recommendation, database querying or summarisation, especially in the context of ambiguous user query or unknown user profile.
In addition, we make some observations on the applicability of these results in practical computations on real data and link to important recent applications in the result diversification problem in web search and semantic graph summarisation. The results apply to both relaxed and strengthen variants of the triangle inequality.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andreae, T., Bandelt, H.-J.: Performance guarantees for approximation algorithms depending on parametrized triangle inequalities. SIAM Journal of Discrete Mathematics 8, 1–16 (1995)
Fagin, R., Stockmeyer, L.: Relaxing the triangle inequality in pattern matching. Int. J. Comput. Vision 30(3), 219–231 (1998)
Gollapudi, S., Sharma, A.: An axiomatic approach for result diversification. In: Proceedings of the 18th International Conference on World Wide Web, WWW 2009, pp. 381–390. ACM, New York (2009)
Gonzalez, T.F.: Handbook of approx. algorithms and metaheuristics. CRC Press (2007)
Hassin, R., Rubinstein, S., Tamir, A.: Approximation algorithms for maximum dispersion. Oper. Res. Lett. 21(3), 133–137 (1997)
Kosiński, W., Kuśmierczyk, T., Rembelski, P., Sydow, M.: Application of ant-colony optimisation to compute diversified entity summarisation on semantic knowledge graphs. In: Proc. of International IEEE AAIA 2013/FedCSIS Conference, Annals of Computer Science and Information Systems, vol. 1, pp. 69–76 (2013)
Ravi, S.S., Rosenkrantz, D.J., Tayi, G.K.: Heuristic and special case algorithms for dispersion problems. Operations Research 42(2), 299–310 (1994)
Sydow, M., Pikula, M., Schenkel, R.: The notion of diversity in graphical entity summarisation on semantic knowledge graphs. Journal of Intelligent Information Systems 41, 109–149 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Sydow, M. (2014). Improved Approximation Guarantee for Max Sum Diversification with Parameterised Triangle Inequality. In: Andreasen, T., Christiansen, H., Cubero, JC., Raś, Z.W. (eds) Foundations of Intelligent Systems. ISMIS 2014. Lecture Notes in Computer Science(), vol 8502. Springer, Cham. https://doi.org/10.1007/978-3-319-08326-1_60
Download citation
DOI: https://doi.org/10.1007/978-3-319-08326-1_60
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08325-4
Online ISBN: 978-3-319-08326-1
eBook Packages: Computer ScienceComputer Science (R0)