Matches in ScholarlyData for { ?s ?p ?o. }
- 649 title "Towards Robust Service Compositions in the Context of Functionally Diverse Services".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent florian-wagner.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent benjamin-kloepper.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent fuyuki-ishikawa.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent shinichi-honiden.
- item-4 previous item-3.
- 65 creator ben-y-zhao.
- 65 creator christo-wilson.
- 65 creator gang-wang.
- 65 creator haitao-zheng.
- 65 creator manish-mohanlal.
- 65 creator xiaohan-zhao.
- 65 creator yibo-zhu.
- 65 type InProceedings.
- 65 label "Serf and Turf: Crowdturfing for Fun and Profit".
- 65 sameAs 65.
- 65 abstract "Popular Internet services in recent years have shown that remarkable things can be achieved by harnessing the power of the masses using crowd-sourcing systems. However, crowd-sourcing systems can also pose a real challenge to existing security mechanisms deployed to protect Internet services. Many of these techniques make the assumption that malicious activity is generated automatically by machines, and perform poorly or fail if users can be organized to perform malicious tasks using crowd-sourcing systems. Through measurements, we have found surprising evidence showing that not only do malicious crowd-sourcing systems exist, but they are rapidly growing in both user base and total revenue. In this paper, we describe a significant effort to study and understand these crowdturfing systems in today's Internet. We use detailed crawls to extract data about the size and operational structure of these crowdturfing systems. We analyze details of campaigns offered and performed in these sites, and evaluate their end-to-end effectiveness by running active, non-malicious campaigns of our own. Finally, we study and compare the source of workers on crowdturfing sites in different countries. Our results suggest that campaigns on these systems are highly effective at reaching users, and their continuing growth poses a concrete threat to online communities such as social networks, both in the US and elsewhere.".
- 65 hasAuthorList authorList.
- 65 isPartOf proceedings.
- 65 keyword "crowdsourcing".
- 65 keyword "mechanical turks".
- 65 keyword "microblogging".
- 65 keyword "social networks".
- 65 title "Serf and Turf: Crowdturfing for Fun and Profit".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasItem item-5.
- authorList hasItem item-6.
- authorList hasItem item-7.
- authorList hasLastItem item-7.
- item-1 type ListItem.
- item-1 hasContent gang-wang.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent christo-wilson.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent xiaohan-zhao.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent yibo-zhu.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent manish-mohanlal.
- item-5 next item-6.
- item-5 previous item-4.
- item-6 type ListItem.
- item-6 hasContent haitao-zheng.
- item-6 next item-7.
- item-6 previous item-5.
- item-7 type ListItem.
- item-7 hasContent ben-y-zhao.
- item-7 previous item-6.
- 707 creator maximilian-nickel.
- 707 creator volker-tresp.
- 707 type InProceedings.
- 707 label "Factorizing YAGO: Scalable Machine Learning for Linked Data".
- 707 sameAs 707.
- 707 abstract "Vast amounts of structured information have already been published in the Semantic Web's Linked Open Data (LOD) cloud and its size is still growing rapidly. Yet, access to this information via reasoning and querying is often difficult, due to LOD's size, partial data inconsistencies and inherent noisiness. Machine Learning offers an alternative approach to exploiting LOD's data with the advantages that Machine Learning algorithms are typically robust to noise and data inconsistencies. From a Machine Learning point of view, LOD is challenging due to its relational nature and its scale. Here, we present an efficient approach to relational learning on LOD data, based on a sparse tensor factorization that scales to data consisting of millions of entities, hundreds of relations and billions of known facts. Furthermore, we show how ontological knowledge can be incorporated in the factorization to improve learning results and how its computation can be distributed across multiple nodes. We demonstrate that our approach is able to factorize the YAGO~2 ontology and globally predict statements for this large knowledge base using a single dual-core desktop computer. Furthermore, we show experimentally that our approach achieves good results in a variety of relational learning tasks that are relevant to Linked Data, such as predicting the existence of unknown triples.".
- 707 hasAuthorList authorList.
- 707 isPartOf proceedings.
- 707 keyword "Large-Scale Machine Learning".
- 707 keyword "Linked Open Data".
- 707 keyword "Relational Learning".
- 707 keyword "Semantic Web".
- 707 keyword "Tensor Factorization".
- 707 title "Factorizing YAGO: Scalable Machine Learning for Linked Data".
- 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 maximilian-nickel.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent volker-tresp.