Search
Now showing items 1-6 of 6
BigIR at CLEF 2018: Detection and verification of check-worthy political claims
(
CEUR-WS
, 2018 , Conference Paper)
With the enormous amount of misinformation spread over the Internet, manual fact-checking is no longer feasible to prevent its negative impact. There is an urgent need for automated systems that can make fact-checking ...
Crowd vs. Expert: What can relevance judgment rationales teach us about assessor disagreement?
(
ACM
, 2018 , Conference Paper)
© 2018 ACM. While crowdsourcing offers a low-cost, scalable way to collect relevance judgments, lack of transparency with remote crowd work has limited understanding about the quality of collected judgments. In prior work, ...
BroDyn'18: Workshop on analysis of broad dynamic topics over social media
(
CEUR-WS
, 2018 , Conference Paper)
Social media streams are flooded with posts related to topics that are broad (i.e., cover several sub-topics) and dynamic (i.e., develop over time) which attract long-standing user interests. Posts about topics like "Brexit" ...
Re-ranking web search results for better fact-checking: A preliminary study
(
Association for Computing Machinery
, 2018 , Conference Paper)
Even though Web search engines play an important role in finding documents relevant to user queries, there is little to no attention given to how they perform in terms of usefulness for fact-checking claims. In this paper, ...
When rank order isn't enough: New statistical-significance-aware correlation measures
(
Association for Computing Machinery
, 2018 , Conference Paper)
Because it is expensive to construct test collections for Cranfield-based evaluation of information retrieval systems, a variety of lower-cost methods have been proposed. The reliability of these methods is often validated ...
LA3: A scalable link-and locality-aware linear algebra-based graph analytics system
(
Association for Computing Machinery
, 2018 , Conference Paper)
This paper presents LA3, a scalable distributed system for graph analytics. LA3 couples a vertex-based programming model with a highly optimized linear algebra-based engine. It translates any vertex-centric program into ...