Data Portal @ linkeddatafragments.org

Matches in ScholarlyData for { ?s ?p ?o. }

• item-6 hasContent paolo-ciancarini.
• item-6 previous item-5.
• paper-14 type InProceedings.
• paper-14 label "Who will follow whom? Exploiting Semantics for Link Prediction in Attention-Information Networks".
• paper-14 sameAs paper-14.
• paper-14 abstract "Existing approaches for link prediction, in the domain of network science, exploit a network's topology to predict future connections by assessing existing edges and connections, and inducing links given the presence of mutual nodes. Despite the rise in popularity of Attention-Information Networks (i.e. microblogging platforms) and the production of content within such platforms, no existing work has attempted to exploit the semantics of published content when predicting network links. In this paper we present an approach that fills this gap by a) predicting follower edges within a directed social network by exploiting concept graphs and thereby significantly outperforming a random baseline and models that rely solely on network topology information, and b) assessing the different behavior that users exhibit when making followee-addition decisions. This latter contribution exposes latent factors within social networks and the existence of a clear need for topical affinity between users for a follow link to be created.".
• paper-14 hasAuthorList authorList.
• paper-14 isPartOf proceedings-2.
• paper-14 title "Who will follow whom? Exploiting Semantics for Link Prediction in Attention-Information 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 matthew-rowe.
• item-1 next item-2.
• item-2 type ListItem.
• item-2 hasContent milan-stankovic.
• item-2 next item-3.
• item-2 previous item-1.
• item-3 type ListItem.
• item-3 hasContent harith-alani.
• item-3 previous item-2.
• paper-15 type InProceedings.
• paper-15 label "Feature LDA: a Supervised Topic Model for Automatic Detection of Web API Documentations from the Web".
• paper-15 sameAs paper-15.
• paper-15 abstract "Web APIs have gained increasing popularity in recent Web service technology development owing to its simplicity of technology stack and the proliferation of mashups. However, efficiently discovering Web APIs and the relevant documentations on the Web is still a challenging task even with the best resources available on the Web. In this paper we cast the problem of detecting the Web API documentations as a text classification problem of classifying a given Web page as Web API associated or not. We propose a supervised generative topic model called feature latent Dirichlet allocation (feaLDA) which offers a generic probabilistic framework for automatic detection of Web APIs. feaLDA not only captures the correspondence between data and the associated class labels, but also provides a mechanism for incorporating side information such as labeled features automatically learned from data that can effectively help improving classification performance. Extensive experiments on our Web APIs documentation dataset shows that the feaLDA model outperforms three strong supervised baselines including naive Bayes, support vector machines, and the maximum entropy model, by over 3% in classification accuracy. In addition, feaLDA also gives superior performance when compared against other existing supervised topic models.".
• paper-15 hasAuthorList authorList.
• paper-15 isPartOf proceedings-2.
• paper-15 title "Feature LDA: a Supervised Topic Model for Automatic Detection of Web API Documentations from the Web".
• 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 chenghua-lin.
• item-1 next item-2.
• item-2 type ListItem.
• item-2 hasContent yulan-he.
• item-2 next item-3.
• item-2 previous item-1.
• item-3 type ListItem.
• item-3 hasContent carlos-pedrinaci.
• item-3 next item-4.
• item-3 previous item-2.
• item-4 type ListItem.
• item-4 hasContent john-domingue.
• item-4 previous item-3.
• paper-16 type InProceedings.
• paper-16 label "Ontology-Based Access to Probabilistic Data with OWL QL".
• paper-16 sameAs paper-16.
• paper-16 abstract "We propose a framework for querying probabilistic instance data in the presence of an OWL2 QL ontology, arguing that the interplay of probabilities and ontologies is fruitful in many applications such as managing data that was extracted from the web. The prime inference problem is computing answer probabilities, and it can be implemented using standard probabilistic database systems. We establish a PTime vs. #P dichotomy for the data complexity of this problem by lifting a corresponding result from probabilistic databases. We also demonstrate that query rewriting (backwards chaining) is an important tool for our framework, show that non-existence of a rewriting into first-order logic implies #P-hardness, and briefly discuss approximation of answer probabilities.".
• paper-16 hasAuthorList authorList.
• paper-16 isPartOf proceedings-2.
• paper-16 title "Ontology-Based Access to Probabilistic Data with OWL QL".
• 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 jean-christoph-jung.
• item-1 next item-2.
• item-2 type ListItem.
• item-2 hasContent carsten-lutz.
• item-2 previous item-1.
• paper-17 type InProceedings.
• paper-17 label "Ontology Constraints in Incomplete and Complete Data".
• paper-17 sameAs paper-17.
• paper-17 abstract "Ontology and other logical languages are built around the idea that axioms enable the inference of new facts about the available data. In some circumstances, however, the data is meant to be complete in certain ways, and deducing new facts may be undesirable. Previous approaches to this issue have relied on syntactically specifying certain axioms as constraints or adding in new constructs for constraints, and providing a different or extended meaning for constraints that reduces or eliminates their ability to infer new facts without requiring the data to be complete. We propose to instead directly state that the extension of certain concepts and roles are complete by making them DBox predicates, which eliminates the distinction between regular axioms and constraints for these concepts and roles. This proposal eliminates the need for special semantics and avoids problems of previous proposals.".
• paper-17 hasAuthorList authorList.
• paper-17 isPartOf proceedings-2.
• paper-17 title "Ontology Constraints in Incomplete and Complete 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 peter-patel-schneider.
• item-1 next item-2.
• item-2 type ListItem.
• item-2 hasContent enrico-franconi.
• item-2 previous item-1.
• paper-18 type InProceedings.
• paper-18 label "Scalable Geo-thematic Query Answering".
• paper-18 sameAs paper-18.
• paper-18 abstract "First order logic (FOL) rewritability is a desirable feature for query answering over geo-thematic ontologies because in most geoprocessing scenarios one has to cope with large data volumes. Hence, there is a need for combined geo-thematic logics that provide a sufficiently expressive query language allowing for FOL rewritability. The DL-Lite family of description logics is tailored towards FOL rewritability of query answering for unions of conjunctive queries, hence it is a suitable candidate for the thematic component of a combined geo-thematic logic. We show that a weak coupling of DL-Lite with the expressive region connection calculus RCC8 allows for FOL rewritability under a spatial completeness condition for the ABox. Stronger couplings allowing for FOL rewritability are possible only for spatial calculi as weak as the low-resolution calculus RCC2. Already a strong combination of DL-Lite with the low-resolution calculus RCC3 does not allow for FOL rewritability.".
• paper-18 hasAuthorList authorList.
• paper-18 isPartOf proceedings-2.
• paper-18 title "Scalable Geo-thematic Query Answering".
• authorList type List.
• authorList hasFirstItem item-1.
• authorList hasItem item-1.
• authorList hasItem item-2.

• first
• previous
• next