Matches in ScholarlyData for { ?s ?p ?o. }
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent lorenzo-blanco.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent nilesh-dalvi.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent ashwin-machanavajjhala.
- item-3 previous item-2.
- hyperanf-approximating-the-neighbourhood-function- creator marco-rosa.
- hyperanf-approximating-the-neighbourhood-function- creator paolo-boldi.
- hyperanf-approximating-the-neighbourhood-function- creator sebastiano-vigna.
- hyperanf-approximating-the-neighbourhood-function- type InProceedings.
- hyperanf-approximating-the-neighbourhood-function- label "HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget".
- hyperanf-approximating-the-neighbourhood-function- sameAs hyperanf-approximating-the-neighbourhood-function-.
- hyperanf-approximating-the-neighbourhood-function- abstract "The neighbourhood function N(t) of a graph G gives, for each t, the number of pairs of nodes <x, y> such that y is reachable from x in less that t hops. The neighbourhood function provides a wealth of information about the graph (e.g., it easily allows one to compute its diameter), but it is very expensive to compute it exactly. Recently, the ANF algorithm (approximate neighbourhood function) has been proposed with the purpose of approximating N(t) on large graphs. We describe a breakthrough improvement over ANF in terms of speed and scalability. Our algorithm, called HyperANF, uses the new HyperLogLog counters and combines them efficiently through broadword programming; our implementation uses overdecomposition to exploit multi-core parallelism. With HyperANF, for the first time we can compute in a few hours the neighbourhood function of graphs with billions of nodes with a small error and good confidence using a standard workstation. Then, we turn to the study of the distribution of the shortest paths between reachable nodes (that can be efficiently approximated by means of HyperANF), and discover the surprising fact that its index of dispersion provides a clear-cut characterisation of proper social networks vs. web graphs. We thus propose the spid (Shortest-Paths Index of Dispersion) of a graph as a new, informative statistics that is able to discriminate between the above two types of graphs. We believe this is the first proposal of a significant new non-local structural index for complex networks whose computation is highly scalable.".
- hyperanf-approximating-the-neighbourhood-function- hasAuthorList authorList.
- hyperanf-approximating-the-neighbourhood-function- hasTopic social-network-algorithms.
- hyperanf-approximating-the-neighbourhood-function- hasTopic World_Wide_Web.
- hyperanf-approximating-the-neighbourhood-function- isPartOf proceedings.
- hyperanf-approximating-the-neighbourhood-function- title "HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent paolo-boldi.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent marco-rosa.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent sebastiano-vigna.
- item-3 previous item-2.
- improving-recommendation-for-long-tail-queries-via creator aristides-gionis.
- improving-recommendation-for-long-tail-queries-via creator idan-szpektor.
- improving-recommendation-for-long-tail-queries-via creator yoelle-maarek.
- improving-recommendation-for-long-tail-queries-via type InProceedings.
- improving-recommendation-for-long-tail-queries-via label "Improving Recommendation for Long-Tail Queries Via Templates".
- improving-recommendation-for-long-tail-queries-via sameAs improving-recommendation-for-long-tail-queries-via.
- improving-recommendation-for-long-tail-queries-via abstract "The ability to aggregate huge volumes of queries over a large population of users allows search engines to build precise models for a variety of query-assistance features such as query recommendation, correction, etc. Yet, no matter how much data is aggregated, the long-tail distribution implies that a large fraction of queries are rare. As a result, most query assistance services perform poorly or are not even triggered on long-tail queries. We propose a method to extend the reach of query assistance techniques (and in particular query recommendation) to long-tail queries by reasoning about rules between query templates rather than individual query transitions, as currently done in query-flow graph models. As a simple example, if we recognize that `Montezuma' is a city in the rare query Montezuma surf and if the rule <city> surf{<city> beach} has been observed, we are able to offer Montezuma beach as a recommendation, even if the two queries were never observed in a same session. We conducted experiments to validate our hypothesis, first via traditional small-scale editorial assessments but more interestingly via a novel automated large scale evaluation methodology. Our experiments show that general coverage can be relatively increased by 24\% using templates without penalizing quality. Furthermore, for 36\% of the 95M queries in our query flow graph, which have no out edges and thus could not be served recommendations, we can now offer at least one recommendation in 98\% of the cases.".
- improving-recommendation-for-long-tail-queries-via hasAuthorList authorList.
- improving-recommendation-for-long-tail-queries-via hasTopic recommendation.
- improving-recommendation-for-long-tail-queries-via hasTopic World_Wide_Web.
- improving-recommendation-for-long-tail-queries-via isPartOf proceedings.
- improving-recommendation-for-long-tail-queries-via title "Improving Recommendation for Long-Tail Queries Via Templates".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent idan-szpektor.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent aristides-gionis.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent yoelle-maarek.
- item-3 previous item-2.
- incentivizing-high-quality-user-generated-content creator arpita-ghosh.
- incentivizing-high-quality-user-generated-content creator preston-mcafee.
- incentivizing-high-quality-user-generated-content type InProceedings.
- incentivizing-high-quality-user-generated-content label "Incentivizing High-Quality User-Generated Content".
- incentivizing-high-quality-user-generated-content sameAs incentivizing-high-quality-user-generated-content.
- incentivizing-high-quality-user-generated-content abstract "We model the economics of incentivizing high-quality user generated content (UGC), motivated by settings such as online review forums, question-answer sites, and comments on news articles and blogs. We provide a game-theoretic model within which to study the problem of incentivizing high quality UGC, in which contributors are strategic and motivated by exposure. Our model has the feature that both the quality of contributions as well as the extent of participation is determined endogenously in a free-entry Nash equilibrium. The model predicts, as observed in practice, that if exposure is independent of quality, there will be a flood of low quality contributions in equilibrium. An ideal mechanism in this context would elicit both high quality and high participation in equilibrium, with near-optimal quality as the available attention diverges, and should be easily implementable in practice. We consider a very simple elimination mechanism, which subjects each contribution to rating by some number A of viewers, and eliminates any contributions that are not uniformly rated positively. We construct and analyze free-entry Nash equilibria for this mechanism, and show that A can be chosen to achieve quality that tends to optimal, along with diverging participation, as the number of viewers diverges.".
- incentivizing-high-quality-user-generated-content hasAuthorList authorList.
- incentivizing-high-quality-user-generated-content hasTopic monetization.
- incentivizing-high-quality-user-generated-content hasTopic World_Wide_Web.
- incentivizing-high-quality-user-generated-content isPartOf proceedings.
- incentivizing-high-quality-user-generated-content title "Incentivizing High-Quality User-Generated Content".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent arpita-ghosh.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent preston-mcafee.
- item-2 previous item-1.
- information-credibility-on-twitter creator barbara-poblete.
- information-credibility-on-twitter creator carlos-castillo.
- information-credibility-on-twitter creator marcelo-mendoza.
- information-credibility-on-twitter type InProceedings.
- information-credibility-on-twitter label "Information Credibility on Twitter".
- information-credibility-on-twitter sameAs information-credibility-on-twitter.
- information-credibility-on-twitter abstract "We analyze the information credibility of news propagated through Twitter, a popular microblogging service. Previous research has shown that most of the messages posted on Twitter are truthful, but the service is also used to spread misinformation and false rumors, often unintentionally. On this paper we focus on automatic methods for assessing the credibility of a given set of tweets. Specifically, we analyze microblog postings related to "trending" topics, and classify them as credible or not credible, based on features extracted from them. We use features from users' posting and re-posting ("re-tweeting") behavior, from the text of the posts, and from citations to external sources. We evaluate our methods using a significant number of human assessments about the credibility of items on a recent sample of Twitter postings. Our results shows that there are measurable differences in the way messages propagate, that can be used to classify them automatically as credible or not credible, with precision and recall in the range of 70% to 80%.".