SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "WFRF:(Ordozgoiti B.) "

Search: WFRF:(Ordozgoiti B.)

  • Result 1-2 of 2
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Tommasini, R., et al. (author)
  • Accepted Tutorials at The Web Conference 2022
  • 2022
  • In: WWW 2022 - Companion Proceedings of the Web Conference 2022. - New York, NY, USA : Association for Computing Machinery (ACM). ; , s. 391-399
  • Conference paper (peer-reviewed)abstract
    • This paper summarizes the content of the 20 tutorials that have been given at The Web Conference 2022: 85% of these tutorials are lecture style, and 15% of these are hands on. 
  •  
2.
  • Ordozgoiti, B., et al. (author)
  • Provable randomized rounding for minimum-similarity diversification
  • 2022
  • In: Data mining and knowledge discovery. - : Springer Nature. - 1384-5810 .- 1573-756X. ; 36:2, s. 709-738
  • Journal article (peer-reviewed)abstract
    • When searching for information in a data collection, we are often interested not only in finding relevant items, but also in assembling a diverse set, so as to explore different concepts that are present in the data. This problem has been researched extensively. However, finding a set of items with minimal pairwise similarities can be computationally challenging, and most existing works striving for quality guarantees assume that item relatedness is measured by a distance function. Given the widespread use of similarity functions in many domains, we believe this to be an important gap in the literature. In this paper we study the problem of finding a diverse set of items, when item relatedness is measured by a similarity function. We formulate the diversification task using a flexible, broadly applicable minimization objective, consisting of the sum of pairwise similarities of the selected items and a relevance penalty term. To find good solutions we adopt a randomized rounding strategy, which is challenging to analyze because of the cardinality constraint present in our formulation. Even though this obstacle can be overcome using dependent rounding, we show that it is possible to obtain provably good solutions using an independent approach, which is faster, simpler to implement and completely parallelizable. Our analysis relies on a novel bound for the ratio of Poisson-Binomial densities, which is of independent interest and has potential implications for other combinatorial-optimization problems. We leverage this result to design an efficient randomized algorithm that provides a lower-order additive approximation guarantee. We validate our method using several benchmark datasets, and show that it consistently outperforms the greedy approaches that are commonly used in the literature.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-2 of 2

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view