-
Baker, T.; Bermès, E.; Coyle, K.; Dunsire, G.; Isaac, A.; Murray, P.; Panzer, M.; Schneider, J.; Singer, R.; Summers, E.; Waites, W.; Young, J.; Zeng, M.: Library Linked Data Incubator Group Final Report (2011)
0.03
0.027372966 = product of:
0.10949186 = sum of:
0.10949186 = weight(_text_:data in 4796) [ClassicSimilarity], result of:
0.10949186 = score(doc=4796,freq=56.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.7394569 = fieldWeight in 4796, product of:
7.483315 = tf(freq=56.0), with freq of:
56.0 = termFreq=56.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.03125 = fieldNorm(doc=4796)
0.25 = coord(1/4)
- Abstract
- The mission of the W3C Library Linked Data Incubator Group, chartered from May 2010 through August 2011, has been "to help increase global interoperability of library data on the Web, by bringing together people involved in Semantic Web activities - focusing on Linked Data - in the library community and beyond, building on existing initiatives, and identifying collaboration tracks for the future." In Linked Data [LINKEDDATA], data is expressed using standards such as Resource Description Framework (RDF) [RDF], which specifies relationships between things, and Uniform Resource Identifiers (URIs, or "Web addresses") [URI]. This final report of the Incubator Group examines how Semantic Web standards and Linked Data principles can be used to make the valuable information assets that library create and curate - resources such as bibliographic data, authorities, and concept schemes - more visible and re-usable outside of their original library context on the wider Web. The Incubator Group began by eliciting reports on relevant activities from parties ranging from small, independent projects to national library initiatives (see the separate report, Library Linked Data Incubator Group: Use Cases) [USECASE]. These use cases provided the starting point for the work summarized in the report: an analysis of the benefits of library Linked Data, a discussion of current issues with regard to traditional library data, existing library Linked Data initiatives, and legal rights over library data; and recommendations for next steps. The report also summarizes the results of a survey of current Linked Data technologies and an inventory of library Linked Data resources available today (see also the more detailed report, Library Linked Data Incubator Group: Datasets, Value Vocabularies, and Metadata Element Sets) [VOCABDATASET].
Key recommendations of the report are: - That library leaders identify sets of data as possible candidates for early exposure as Linked Data and foster a discussion about Open Data and rights; - That library standards bodies increase library participation in Semantic Web standardization, develop library data standards that are compatible with Linked Data, and disseminate best-practice design patterns tailored to library Linked Data; - That data and systems designers design enhanced user services based on Linked Data capabilities, create URIs for the items in library datasets, develop policies for managing RDF vocabularies and their URIs, and express library data by re-using or mapping to existing Linked Data vocabularies; - That librarians and archivists preserve Linked Data element sets and value vocabularies and apply library experience in curation and long-term preservation to Linked Data datasets.
-
Isaac, A.; Baker, T.: Linked data practice at different levels of semantic precision : the perspective of libraries, archives and museums (2015)
0.02
0.019398764 = product of:
0.077595055 = sum of:
0.077595055 = weight(_text_:data in 2026) [ClassicSimilarity], result of:
0.077595055 = score(doc=2026,freq=18.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.52404076 = fieldWeight in 2026, product of:
4.2426405 = tf(freq=18.0), with freq of:
18.0 = termFreq=18.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0390625 = fieldNorm(doc=2026)
0.25 = coord(1/4)
- Abstract
- Libraries, archives and museums rely on structured schemas and vocabularies to indicate classes in which a resource may belong. In the context of linked data, key organizational components are the RDF data model, element schemas and value vocabularies, with simple ontologies having minimally defined classes and properties in order to facilitate reuse and interoperability. Simplicity over formal semantics is a tenet of the open-world assumption underlying ontology languages central to the Semantic Web, but the result is a lack of constraints, data quality checks and validation capacity. Inconsistent use of vocabularies and ontologies that do not follow formal semantics rules and logical concept hierarchies further complicate the use of Semantic Web technologies. The Simple Knowledge Organization System (SKOS) helps make existing value vocabularies available in the linked data environment, but it exchanges precision for simplicity. Incompatibilities between simple organized vocabularies, Resource Description Framework Schemas and OWL ontologies and even basic notions of subjects and concepts prevent smooth translations and challenge the conversion of cultural institutions' unique legacy vocabularies for linked data. Adopting the linked data vision requires accepting loose semantic interpretations. To avoid semantic inconsistencies and illogical results, cultural organizations following the linked data path must be careful to choose the level of semantics that best suits their domain and needs.
- Footnote
- Contribution to a special section "Linked data and the charm of weak semantics".
-
Baker, T.: ¬A grammar of Dublin Core (2000)
0.02
0.016690476 = product of:
0.03338095 = sum of:
0.020692015 = weight(_text_:data in 1236) [ClassicSimilarity], result of:
0.020692015 = score(doc=1236,freq=2.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.1397442 = fieldWeight in 1236, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.03125 = fieldNorm(doc=1236)
0.012688936 = product of:
0.025377871 = sum of:
0.025377871 = weight(_text_:22 in 1236) [ClassicSimilarity], result of:
0.025377871 = score(doc=1236,freq=2.0), product of:
0.16398162 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046827413 = queryNorm
0.15476047 = fieldWeight in 1236, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03125 = fieldNorm(doc=1236)
0.5 = coord(1/2)
0.5 = coord(2/4)
- Abstract
- Dublin Core is often presented as a modern form of catalog card -- a set of elements (and now qualifiers) that describe resources in a complete package. Sometimes it is proposed as an exchange format for sharing records among multiple collections. The founding principle that "every element is optional and repeatable" reinforces the notion that a Dublin Core description is to be taken as a whole. This paper, in contrast, is based on a much different premise: Dublin Core is a language. More precisely, it is a small language for making a particular class of statements about resources. Like natural languages, it has a vocabulary of word-like terms, the two classes of which -- elements and qualifiers -- function within statements like nouns and adjectives; and it has a syntax for arranging elements and qualifiers into statements according to a simple pattern. Whenever tourists order a meal or ask directions in an unfamiliar language, considerate native speakers will spontaneously limit themselves to basic words and simple sentence patterns along the lines of "I am so-and-so" or "This is such-and-such". Linguists call this pidginization. In such situations, a small phrase book or translated menu can be most helpful. By analogy, today's Web has been called an Internet Commons where users and information providers from a wide range of scientific, commercial, and social domains present their information in a variety of incompatible data models and description languages. In this context, Dublin Core presents itself as a metadata pidgin for digital tourists who must find their way in this linguistically diverse landscape. Its vocabulary is small enough to learn quickly, and its basic pattern is easily grasped. It is well-suited to serve as an auxiliary language for digital libraries. This grammar starts by defining terms. It then follows a 200-year-old tradition of English grammar teaching by focusing on the structure of single statements. It concludes by looking at the growing dictionary of Dublin Core vocabulary terms -- its registry, and at how statements can be used to build the metadata equivalent of paragraphs and compositions -- the application profile.
- Date
- 26.12.2011 14:01:22
-
Baker, T.; Sutton, S.A.: Linked data and the charm of weak semantics : Introduction: the strengths of weak semantics (2015)
0.02
0.015839024 = product of:
0.063356094 = sum of:
0.063356094 = weight(_text_:data in 2022) [ClassicSimilarity], result of:
0.063356094 = score(doc=2022,freq=12.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.4278775 = fieldWeight in 2022, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.0390625 = fieldNorm(doc=2022)
0.25 = coord(1/4)
- Abstract
- Logic and precision are fundamental to ontologies underlying the semantic web and, by extension, to linked data. This special section focuses on the interaction of semantics, ontologies and linked data. The discussion presents the Simple Knowledge Organization Scheme (SKOS) as a less formal strategy for expressing concept hierarchies and associations and questions the value of deep domain ontologies in favor of simpler vocabularies that are more open to reuse, albeit risking illogical outcomes. RDF ontologies harbor another unexpected drawback. While structurally sound, they leave validation gaps permitting illogical uses, a problem being addressed by a W3C Working Group. Data models based on RDF graphs and properties may replace traditional library catalog models geared to predefined entities, with relationships between RDF classes providing the semantic connections. The BIBFRAME Initiative takes a different and streamlined approach to linking data, building rich networks of information resources rather than relying on a strict underlying structure and vocabulary. Taken together, the articles illustrate the trend toward a pragmatic approach to a Semantic Web, sacrificing some specificity for greater flexibility and partial interoperability.
- Footnote
- Introduction to a special section "Linked data and the charm of weak semantics".
-
Baker, T.: ¬The concepts of knowledge organization systems as hubs in the Web of data (2011)
0.01
0.010973599 = product of:
0.043894395 = sum of:
0.043894395 = weight(_text_:data in 4810) [ClassicSimilarity], result of:
0.043894395 = score(doc=4810,freq=4.0), product of:
0.14807065 = queryWeight, product of:
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046827413 = queryNorm
0.29644224 = fieldWeight in 4810, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.1620505 = idf(docFreq=5088, maxDocs=44218)
0.046875 = fieldNorm(doc=4810)
0.25 = coord(1/4)
- Abstract
- The domain name system of the World-Wide Web provides a managed space of globally unique identifiers resolvable to a globally distributed set of information resources. When the concepts of a knowledge organization system (KOS) are identified using URIs, the KOS functions as a "hub" for accessing resources tagged with its concepts. Resource Description Framework (RDF) triples, consisting of a subject, a predicate, and an object, joined on the basis of matched URIs, form the spokes of these hubs. New sources of metadata can be dynamically integrated into an infinitely "expandable" description. Term-to-term alignments with other KOSs increase the conceptual reach of a KOS, while concept labels in multiple languages increase its reach linguistically. This talk illustrates the mechanics of merging linked data triples with reference to KOSs that function as hubs.
-
Baker, T.: Dublin Core Application Profiles : current approaches (2010)
0.00
0.0047583506 = product of:
0.019033402 = sum of:
0.019033402 = product of:
0.038066804 = sum of:
0.038066804 = weight(_text_:22 in 3737) [ClassicSimilarity], result of:
0.038066804 = score(doc=3737,freq=2.0), product of:
0.16398162 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046827413 = queryNorm
0.23214069 = fieldWeight in 3737, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=3737)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Source
- Wissensspeicher in digitalen Räumen: Nachhaltigkeit - Verfügbarkeit - semantische Interoperabilität. Proceedings der 11. Tagung der Deutschen Sektion der Internationalen Gesellschaft für Wissensorganisation, Konstanz, 20. bis 22. Februar 2008. Hrsg.: J. Sieglerschmidt u. H.P.Ohly