conferences

Evolving Towards a Consortium MARCR Redis Datastore

Evolving Towards a Consortium MARCR Redis Datastore

Slide presentation

n Characters in Search of an Author

n Characters in Search of an Author

  • Jay Luker, IT Specialist, Smithsonian Astrophysics Data System, jluker@cfa.harvard.edu

When it comes to author names the disconnect between our metadata and what a user might enter into a search box presents challenges when trying to maximize both precision and recall [0]. When indexing a paper written by "Wäterwheels, A" a goal should be to preserve as much as possible the original information. However, users searching by author name may frequently omit the diaeresis and search for simply, "Waterwheels". The reverse of this scenario is also possible, i.e., your decrepit metadata contains only the ASCII, "Supybot, Zoia", whereas the user enters, "Supybot, Zóia". If recall is your highest priority the simple solution is to always downgrade to ASCII when indexing and querying. However this strategy sacrifices precision, as you will be unable to provide an "exact" search, necessary in cases where "Hacker, J" and "Häcker, J" really are two distinct authors.

Practical Relevance Ranking for 10 million books.

Practical Relevance Ranking for 10 million books

  • Tom Burton-West, University of Michigan Library, tburtonw@umich.edu

HathiTrust Full-text search indexes the full-text and metadata for over 10 million books. There are many challenges in tuning relevance ranking for a collection of this size. This talk will discuss some of the underlying issues, some of our experiments to improve relevance ranking, and our ongoing efforts to develop a principled framework for testing changes to relevance ranking.

Some of the topics covered will include:

  • Length normalization for indexing the full-text of book-length documents
  • Indexing granularity for books
  • Testing new features in Solr 4.0:
    • New ranking formulas that should work better with book-length documents: BM25 and DFR.
    • Grouping/Field Collapsing. Can we index 3 billion pages and then use Solr's field collapsing feature to rank books according to the most relevant page(s)?
    • Finite State Automota/Block Trees for storing the in-memory index to the index. Will this allow us to allow wildcards/truncation despite over 2 billion unique terms per index?

The Avalon Media System: A Next Generation Hydra Head For Audio and Video Delivery

The Avalon Media System: A Next Generation Hydra Head For Audio and Video Delivery

Slide presentation

EAD without XSLT: A Practical New Approach to Web-Based Finding Aids

EAD without XSLT: A Practical New Approach to Web-Based Finding Aids

Slide presentation

Hacking the DPLA

Hacking the DPLA

Slide presentation

  • Nate Hill, Chattanooga Public Library, nathanielhill AT gmail.com
  • Sam Klein, Wikipedia, metasj AT gmail.com

The Digital Public Library of America is a growing open-source platform to support digital libraries and archives of all kinds. DPLA-alpha is available for testing, with data from six initial Hubs. New APIs and data feeds are in development, with the next release scheduled for April.

Come learn what we are doing, how to contribute or hack the DPLA roadmap, and how you (or your favorite institution) can draw from and publish through it. Larger institutions can join as a (content or service) hub, helping to aggregate and share metadata and services from across their {region, field, archive-type}. We will discuss current challenges and possibilities (UI and API suggestions wanted!), apps being built on the platform, and related digitization efforts.

DPLA has a transparent community and planning process; new participants are always welcome. Half the time will be for suggestions and discussion. Please bring proposals, problems, partnerships and possible paradoxes to discuss.

Pitfall! Working with Legacy Born Digital Materials in Special Collections

Pitfall! Working with Legacy Born Digital Materials in Special Collections

Slide presentation

ARCHITECTING ScholarSphere: How We Built a Repository App That Doesn't Feel Like Yet Another Janky Old Repository App

ARCHITECTING ScholarSphere: How We Built a Repository App That Doesn't Feel Like Yet Another Janky Old Repository App

Slide presentation

Code4Lib 2013 Scholarship (deadline: December 14, 2012)

Oregon State University and the Digital Library Federation are sponsoring five scholarships to promote gender and cultural diversity. Each scholarship will provide up to $1,000 to cover travel costs and conference fees for one qualified attendee to attend the 2013 Code4Lib Conference, which will be held in Chicago, Illinois, from Monday,February 11 through Thursday, February 14. The Code4Lib scholarship committee will award two scholarships per category, awarding the remaining scholarship to the best remaining candidate in either category. The Code4Lib scholarship committee will award these scholarships based on merit and need.

Code4Lib 2013 Call for Host Proposals

The Code4Lib Conference Planning Group is calling for
proposals to host the 2013 Code4Lib Conference.  Information on the
kind of venue we seek and the delineation of responsibilities between
the host organization and the Planning Group can be found at the
conference hosting web page [1] and on the Code4Lib Wiki [2].

The deadline for proposals is Sunday January 22, 2012. The
decision will be made over the course of the following weeks by a
popular vote.  Voting will begin on or around Wednesday January 25,
2012 and will continue through the first three days of Code4Lib 2012 until
11:59PM Pacific on Wednesday, February 8th. The results of the vote will be
announced on Thursday, February 9th, the final day of Code4Lib 2012.
You can apply by making your pitch to the Code4Lib Conference Planning
list [3]; attention to the criteria listed on the conference hosting
page is appreciated.  May the best site win!

Feel free to take a look at the winning proposal from 2012
https://sites.google.com/site/code4lib2012seattle/

and past hosting proposals from 2011 for ideas:

https://wiki.dlib.indiana.edu/display/EVENTS/Code4Lib+2011+Proposal
http://www.library.yale.edu/~dlovins/c4l/code4lib2011.html
http://sites.google.com/site/code4libvancouver2011

and

1. http://code4lib.org/conference/hosting
2. http://wiki.code4lib.org/index.php/How_To_Plan_A_Code4LibCon
3. code4libcon@googlegroups.com

Syndicate content