English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In the SIGMOD 2013 conference, we published a paper extending our earlierwork on crowdsourced entity resolution to improve crowdsourced join processingby exploiting transitive relationships [Wang et al. 2013]. The VLDB 2014conference has a paper that follows up on our previous work [Vesdapunt et al.,2014], which points out and corrects a mistake we made in our SIGMOD paper.Specifically, in Section 4.2 of our SIGMOD paper, we defined the "ExpectedOptimal Labeling Order" (EOLO) problem, and proposed an algorithm for solvingit. We incorrectly claimed that our algorithm is optimal. In their paper,Vesdapunt et al. show that the problem is actually NP-Hard, and based on thatobservation, propose a new algorithm to solve it. In this note, we would liketo put the Vesdapunt et al. results in context, something we believe that theirpaper does not adequately do.

The Expected Optimal Labeling Order Problem for Crowdsourced Joins and Entity Resolution