Matches in ScholarlyData for { ?s ?p ?o. }
- 529 keyword "Workload Characterization".
- 529 title "A Comparative Analysis of Web and Peer-to-Peer Traffic".
- 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 hasLastItem item-5.
- item-1 type ListItem.
- item-1 hasContent naimul-basher.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent aniket-mahanti.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent anirban-mahanti.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent carey-williamson.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent martin-arlitt.
- item-5 previous item-4.
- 535 creator joydeep-ghosh.
- 535 creator kunal-punera.
- 535 type InProceedings.
- 535 label "Enhanced Hierarchical Classification via Isotonic Smoothing".
- 535 sameAs 535.
- 535 abstract "Hierarchical topic taxonomies have proliferated on the World Wide Web~\cite{dmoz,yahoodir}, and exploiting the output space decompositions they induce in automated classification systems is an active area of research. In many domains, classifiers learned on a hierarchy of classes have been shown to outperform those learned on a flat set of classes. In this paper we argue that the hierarchical arrangement of classes leads to intuitive relationships between the corresponding classifiers' output scores, and that enforcing these relationships as a post-processing step to classification can improve its accuracy. We formulate the task of smoothing classifier outputs as a regularized isotonic tree regression problem, and present a dynamic programming based method that solves it optimally. This new problem generalizes the classic isotonic tree regression problem, and both, the new formulation and algorithm, might be of independent interest. In our empirical analysis of two real-world text classification scenarios, we show that our approach to smoothing classifier outputs results in improved classification accuracy.".
- 535 hasAuthorList authorList.
- 535 hasTopic World_Wide_Web.
- 535 isPartOf proceedings.
- 535 keyword "Dynamic Programming".
- 535 keyword "Hierarchical Classification".
- 535 keyword "Regularized Isotonic Regression".
- 535 keyword "Taxonomies".
- 535 title "Enhanced Hierarchical Classification via Isotonic Smoothing".
- 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 kunal-punera.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent joydeep-ghosh.
- item-2 previous item-1.
- 551 creator simon-schenk.
- 551 creator steffen-staab.
- 551 type InProceedings.
- 551 label "Networked Graphs: A Declarative Mechanism for SPARQL Rules, SPARQL Views and RDF Data Integration on the Web".
- 551 sameAs 551.
- 551 abstract "Easy reuse and integration of declaratively described information in a distributed setting is one of the main motivations for building the Semantic Web. Despite of this claim, reuse and recombination of RDF data today is mostly done using data replication and procedural code. A simple declarative mechanism for reusing and combining RDF data would help users to generate content for the semantic web. Having such a mechanism, the Semantic Web could better benefit from user generated content, as it is broadly present in the so called Web 2.0, but also from better linkage of existing content. We propose Networked Graphs, which allow users to define RDF graphs both, by extensionally listing content, but also by using views on other graphs. These views can be used to include parts of other graphs, to transform data before including it and to denote rules. The relationships between graphs are described declaratively using SPARQL queries and an extension of the SPARQL semantics. Networked Graphs are easily exchangeable between and interpretable on different computers. Using existing protocols, Networked Graphs can be evaluated in a distributed setting.".
- 551 hasAuthorList authorList.
- 551 hasTopic World_Wide_Web.
- 551 isPartOf proceedings.
- 551 keyword "Distributed architectures for semistructured data on the Web".
- 551 keyword "Logic Programming (Well Founded Semantics)".
- 551 keyword "Rules".
- 551 keyword "SPARQL".
- 551 keyword "Views".
- 551 title "Networked Graphs: A Declarative Mechanism for SPARQL Rules, SPARQL Views and RDF Data Integration on the Web".
- 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 simon-schenk.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent steffen-staab.
- item-2 previous item-1.
- 565 creator caroline-jay.
- 565 creator robert-stevens.
- 565 creator simon-harper.
- 565 creator yeliz-yesilada.
- 565 type InProceedings.
- 565 label "Visual Elements in Blind Navigation".
- 565 sameAs 565.
- 565 abstract "This paper presents an eye-tracking study that examines how sighted people use visual elements of Web pages to complete certain tasks. Whilst these elements significantly aid sighted users, they frequently serve to hinder visually disabled users, who need to access pages in audio. Our previous work has introduced a framework that identifies these elements and then reengineers Web pages such that these elements can play their intended roles in an audio, as well as visual presentation. To further improve our understanding of how these elements are used and validate our approach, we track the eye movements of sighted users performing a number of different tasks. The resulting gaze data show that there is a strong relationship between the aspects of a page that receive visual attention and the travel objects identified by our framework. The study also shows some limitations, as well as yielding information to address these short-comings. Perhaps the most important result is the support provided for a particular kind of object called a Way Edge-the visual construct used to group content into sections. There is a significant effect of Way Edges on the distribution of attention across tasks. This is a result that not only provides strong evidence for the utility of reengineering, but also has consequences for our understanding of how people allocate attention to different parts of a page. We speculate that the phenomenon of Banner Blindness owes as much to Way Edges, as it does to colour and font size.".
- 565 hasAuthorList authorList.
- 565 hasTopic World_Wide_Web.
- 565 isPartOf proceedings.
- 565 keyword "Eye-tracking".
- 565 keyword "Navigation".
- 565 keyword "Travel Objects".
- 565 keyword "Travel".
- 565 keyword "Visual Disability".
- 565 title "Visual Elements in Blind Navigation".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.