Skip to main content
  • New York, New York, United States
... Thus, digital li-braries with special or otherwise sought-after collections can make their metadata available for re-use by relatively unaf-filiated peers, allowing the sharing of content and addition of value within the digital... more
... Thus, digital li-braries with special or otherwise sought-after collections can make their metadata available for re-use by relatively unaf-filiated peers, allowing the sharing of content and addition of value within the digital library community in a loosely-coupled fashion. ...
... Author Details. Aaron Krowne Woodruff Library Emory University Email: akrowne@emory.edu Web site: http://web.library.emory.edu/. Urvashi Gadi Woodruff Library Emory University Email: ugadi@emory.edu Web site:... more
... Author Details. Aaron Krowne Woodruff Library Emory University Email: akrowne@emory.edu Web site: http://web.library.emory.edu/. Urvashi Gadi Woodruff Library Emory University Email: ugadi@emory.edu Web site: http://web.library.emory.edu/. Return to top. ...
We describe an experiment in combined searching of Web pages and digital library resources, exposed via an open archives metadata provider and Web gateway service. We utilize only free/open source software components for our... more
We describe an experiment in combined searching of Web pages and digital library resources, exposed via an open archives metadata provider and Web gateway service. We utilize only free/open source software components for our investigation, in order to demonstrate feasibility of deployment for all institutions.
Abstract †œQuality Metrics†is an IMLS–funded research project which aims to address longstanding deficits in the formal conceptual support for and development of scholarly digital libraries. Central to attaining these goals is... more
Abstract †œQuality Metrics†is an IMLS–funded research project which aims to address longstanding deficits in the formal conceptual support for and development of scholarly digital libraries. Central to attaining these goals is collecting and analyzing feedback from ...
This article defines the digital library setting as it relates to commons-based peer production (CBPP) (1). Motivations for selecting the CBPP method in this setting will be discussed, and the challenges of CBPP will be described. The... more
This article defines the digital library setting as it relates to commons-based peer production (CBPP) (1). Motivations for selecting the CBPP method in this setting will be discussed, and the challenges of CBPP will be described. The Noosphere system will be presented as a case study to demonstrate CBPP digital library system design. Specific aspects addressed include: how an "economy
Commons-based peer production is a term that describes authorship of shared information resources. In this article we examine the technical aspects of writing-in-common. We begin with a simple model: that of text and commentary. This... more
Commons-based peer production is a term that
describes authorship of shared information resources. In this
article we examine the technical aspects of writing-in-common.
We begin with a simple model: that of text and commentary.
This scholia-based model emphasizes ownership of speech and freedom of speech. We then consider what happens when the freedom to create derivative versions is added to the mix. The resulting model proves to be quite sophisticated, and flexible enough to describe many different commons-based peer production systems. We provide an overview of our implementation of this model, and suggest some ideas for subsequent work. We conclude by discussing the implications of our model for distributed authorship and writing.
Collaborative online encyclopedias or knowledge bases such as Wikipedia and PlanetMath are becoming increasingly popular because of their open access, comprehensive and interlinked content, rapid and continual updates, and community... more
Collaborative online encyclopedias or knowledge bases such as Wikipedia and PlanetMath are becoming increasingly popular because of their open access, comprehensive and interlinked content, rapid and continual updates, and community interactivity. To understand a particular concept in these knowledge bases, a reader needs to learn about related and underlying concepts. In this chapter, we introduce the problem of invocation linking for collaborative encyclopedia or knowledge bases, review the state of the art for invocation linking including the popular linking system of Wikipedia, discuss the problems and challenges of automatic linking, and present the NNexus approach, an abstraction and generalization of the automatic linking system used by PlanetMath.org. The chapter emphasizes both research problems and practical design issues through discussion of real world scenarios and hence is suitable for both researchers in web intelligence and practitioners looking to adopt the techniques. Below is a brief outline of the chapter. Problem and Motivation. We first introduce the problem of invocation linking for online collaborative encyclopedia or knowledge bases. An online encyclopedia consists of multiple entries. An invocation link is a hyperlink from a term or phrase in an entry representing a concept to another entry that defines the concept. It allows a reader easily “jump” to requisite concepts in order to fully understand the current one. We refer to the term or phrase being linked from as link source and the entry being linked to as link target. The problem of invocation linking is how to add these invocation links in an online encyclopedia in order to build a semantic concept network. State of the Arts. We review the state of arts for the invocation linking in current online encyclopedia and knowledge bases. The existing approaches can be mainly classified into: 1) manual linking where both the link source and link target are explicitly defined by the user (such as blog software), 2) semi-automatic linking where the link source are explicitly marked by the user but the link target is determined automatically (such as Wikipedia), and 3) automatic linking where both the link source and link target are determined automatically. We discuss the representative systems for each approach and illustrate their advantages and disadvantages. We will also review potential technologies such as web search and recommender systems and discuss their applicability for invocation linking. Automatic Invocation Linking. We advocate in this chapter the automatic linking approach as we believe that the manual and semi-automatic approaches are an unnecessary burden on contributors, and in addition, require continuous re-inspection of the entire corpus by writers or other maintainers for a growing and dynamic corpus. We discuss the challenges and design goals for developing such an automatic linking system including linking quality, efficiency and scalability, and generalization to multiple corpus. NNexus Approach. In particular, we present the NNexus system, an automatic linking system that we have developed as an abstraction and generalization of the linking component of PlanetMath (planetmath.org), PlanetPhysics(planetphysics.org), and other sites. We discuss a number of key features and design ideas of NNexus in addressing the challenges for invocation linking. NNexus provides an effective linking scheme utilizing metadata to automatically identify link sources and link targets. It achieves good linking quality with a classification-based link steering approach and an interactive entry filtering component. It achieves good efficiency and scalability by its efficient data structures as well as a mechanism for efficiently updating the links between entries that are related to newly defined or modified concepts in the corpus. Finally, its implementation utilizes OWL and has a simple interface, which allows for an almost unlimited number of online corpora to interconnect for automatic linking. Conclusions and Open Issues. We close the chapter by discussing a set of interesting issues and open problems for invocation linking.
We define an authority model, in the context of CSCW, as the characteristics of the system that determine who has control over objects in the system, and how this control manifests. In this paper we present two natural authority mod- els... more
We define an authority model, in the context of CSCW, as the characteristics of the system that determine who has control over objects in the system, and how this control manifests. In this paper we present two natural authority mod- els (free-form and owner-centric) and, employing an empirical study, explore the question "which authority model is best for collaborative, commons-based
This chapter argues that in addition to federated search and gathering (as by Web crawlers), harvesting is an important approach to address the needs for distributed IR. We highlight the use of the Open Archives Initiative Protocol for... more
This chapter argues that in addition to federated search and gathering (as by Web crawlers), harvesting is an important approach to address the needs for distributed IR. We highlight the use of the Open Archives Initiative Protocol for Metadata Harvesting, illustrating its use in three projects: OAD, NDLTD, and CITIDEL. We explain how traditional services can be extended in a user-centered fashion, providing details of our new: ESSEX search engine, multischeming browsing, and quality-oriented filtering (using rules and SVMs). We conclude with an overview of work in progress on logging and component architectures, as well as a summary of our findings.
Structured or fielded metadata is the basis for many digital library services, including searching and browsing. Yet, little is known about the impact of using structure on the effectiveness of such services. We investigate a key research... more
Structured or fielded metadata is the basis for many digital library services, including searching and browsing. Yet, little is known about the impact of using structure on the effectiveness of such services. We investigate a key research question: do structured queries improve effectiveness in DL searching? To answer this question, we empirically compared the use of unstructured queries to the use of structured queries. We then tested the capability of a simple Bayesian network system, built on top of a DL retrieval engine, to infer the best structured queries from the keywords entered by the user. Experiments performed with 20 subjects working with a DL containing a large collection of computer science literature clearly indicate that structured queries, either manually constructed or automatically generated, perform better than their unstructured counterparts, in the majority of cases. Also, automatic structuring of queries appears to be an effective and viable alternative to manual structuring that may significantly reduce the burden users.