Matches in ScholarlyData for { ?s ?p ?o. }
- item-2 hasContent xu-jia.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent sicong-shou.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent shicong-feng.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent feng-zhou.
- item-5 next item-6.
- item-5 previous item-4.
- item-6 type ListItem.
- item-6 hasContent hongyan-liu.
- item-6 previous item-5.
- caching-intermediate-result-of-sparql-queries creator gang-wu.
- caching-intermediate-result-of-sparql-queries creator mengdong-yang.
- caching-intermediate-result-of-sparql-queries type InProceedings.
- caching-intermediate-result-of-sparql-queries label "Caching Intermediate Result of SPARQL Queries".
- caching-intermediate-result-of-sparql-queries sameAs caching-intermediate-result-of-sparql-queries.
- caching-intermediate-result-of-sparql-queries abstract "The complexity and growing scale of RDF data has made data management back end the performance bottleneck of Semantic Web applications. Caching is one of the ways that could solve this problem. However, few existing research projects focus on caching in RDF data processing. We present an adaptive caching scheme that caches intermediate result of basic graph pattern SPARQL queries. Benchmark test results are provided to illustrate the effectiveness of our caching scheme.".
- caching-intermediate-result-of-sparql-queries hasAuthorList authorList.
- caching-intermediate-result-of-sparql-queries hasTopic World_Wide_Web.
- caching-intermediate-result-of-sparql-queries isPartOf proceedings.
- caching-intermediate-result-of-sparql-queries title "Caching Intermediate Result of SPARQL Queries".
- 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 mengdong-yang.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent gang-wu.
- item-2 previous item-1.
- casting-a-web-of-trust-over-wikipedia-an-interacti creator bogdan-cautis.
- casting-a-web-of-trust-over-wikipedia-an-interacti creator silviu-maniu.
- casting-a-web-of-trust-over-wikipedia-an-interacti creator talel-abdessalem.
- casting-a-web-of-trust-over-wikipedia-an-interacti type InProceedings.
- casting-a-web-of-trust-over-wikipedia-an-interacti label "Casting a Web of Trust Over Wikipedia: An Interaction-Based Approach".
- casting-a-web-of-trust-over-wikipedia-an-interacti sameAs casting-a-web-of-trust-over-wikipedia-an-interacti.
- casting-a-web-of-trust-over-wikipedia-an-interacti abstract "We report in this short paper results on inferring a signed network (a "web of trust") from user interactions. On the Wikipedia network of contributors, from a collection of articles in the politics domain and their revision history, we investigate mechanisms by which relationships between contributors - in the form of signed directed links - can be inferred from their interactions. Our preliminary study provides valuable insight into principles underlying a signed network of Wikipedia contributors that is captured by social interaction. We look into whether this network (called hereafter WikiSigned) represents indeed a plausible configuration of link signs. We assess connections to social theories such as structural balance and status, which have already been considered in online communities. We also evaluate on this network the accuracy of a learned predictor for edge signs. Equipped with learning techniques that have been applied before on three explicit signed networks, we obtain good accuracy over the WikiSigned edges. Moreover, by cross training-testing we obtain strong evidence that our network does reveal an implicit signed configuration and that it has similar characteristics to the explicit ones, even though it is inferred from interactions. We also report on an application of the resulting signed network that impacts Wikipedia readers, namely the classification of Wikipedia articles by importance and quality.".
- casting-a-web-of-trust-over-wikipedia-an-interacti hasAuthorList authorList.
- casting-a-web-of-trust-over-wikipedia-an-interacti hasTopic World_Wide_Web.
- casting-a-web-of-trust-over-wikipedia-an-interacti isPartOf proceedings.
- casting-a-web-of-trust-over-wikipedia-an-interacti title "Casting a Web of Trust Over Wikipedia: An Interaction-Based Approach".
- 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 silviu-maniu.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent talel-abdessalem.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent bogdan-cautis.
- item-3 previous item-2.
- celf-optimizing-the-greedy-algorithm-for-influence creator amit-goyal.
- celf-optimizing-the-greedy-algorithm-for-influence creator laks-v-s-lakshmanan.
- celf-optimizing-the-greedy-algorithm-for-influence creator wei-lu.
- celf-optimizing-the-greedy-algorithm-for-influence type InProceedings.
- celf-optimizing-the-greedy-algorithm-for-influence label "CELF++: Optimizing the Greedy Algorithm for Influence Maximization in Social Networks".
- celf-optimizing-the-greedy-algorithm-for-influence sameAs celf-optimizing-the-greedy-algorithm-for-influence.
- celf-optimizing-the-greedy-algorithm-for-influence abstract "Kempe et al. (KKT) showed the problem of influence maximization is NP-hard and a simple greedy algorithm guarantees the best possible approximation factor in PTIME. However, it has two major sources of inefficiency. First, finding the expected spread of a node set is #P-hard. Second, the basic greedy algorithm is quadratic in the number of nodes. The first source is tackled by estimating the spread using Monte Carlo simulation or by using heuristics. Leskovec et al. proposed the CELF algorithm for tackling the second. In this work, we propose CELF++ and empirically show that it is 35-55% faster than CELF.".
- celf-optimizing-the-greedy-algorithm-for-influence hasAuthorList authorList.
- celf-optimizing-the-greedy-algorithm-for-influence hasTopic World_Wide_Web.
- celf-optimizing-the-greedy-algorithm-for-influence isPartOf proceedings.
- celf-optimizing-the-greedy-algorithm-for-influence title "CELF++: Optimizing the Greedy Algorithm for Influence Maximization in Social Networks".
- 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 amit-goyal.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent wei-lu.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent laks-v-s-lakshmanan.
- item-3 previous item-2.
- collaborative-classification-over-p2p-networks creator odysseas-papapetrou.
- collaborative-classification-over-p2p-networks creator stefan-siersdorfer.
- collaborative-classification-over-p2p-networks creator wolf-siberski.
- collaborative-classification-over-p2p-networks type InProceedings.
- collaborative-classification-over-p2p-networks label "Collaborative Classification Over P2P Networks".
- collaborative-classification-over-p2p-networks sameAs collaborative-classification-over-p2p-networks.
- collaborative-classification-over-p2p-networks abstract "We propose a novel collaborative approach for distributed document classification, combining the knowledge of multiple users for improved organization of data such as individual document repositories or emails. The approach builds on top of a P2P network and outperforms the state of the art approaches in collaborative classification.".