Research Library, Los Alamos National Laboratory RESEARCH LIBRARY @ OAI4 - Geneva, Switzerland Digital Library Research & Prototyping Team Multi-Graph

Research Library, Los Alamos National LaboratoryRESEARCHLIBRARY @ OAI4 - Geneva, Switzerland

Digital Library Research & Prototyping Team

Multi-Graph to Support Scholarly Communication

Marko Antonio RodriguezDigital Library Research & Prototyping Team

Los Alamos National Laboratory

&

Center for Evolution, Complexity, and Cognition

Vrije Universiteit Brussel

&

Computer Science Department

University of California at Santa Cruz

email: [email protected] . URL: http://www.soe.ucsc.edu/~okram



Purpose of this Talk

• Define OAI institutional repositories

• Define resource metadata

• Define a collection of network generation algorithms to exploit resource metadata

• Define a simple spreading-activation network search algorithm

• Define problem and solution representation in a multi-graph

• Demonstrate problem-solving in a scholarly multi-graph



Open Archives Initiative and Institutional Repositories

• Open Archives Initiative is a joint effort to standardize interfaces between various institutional repositories.

• Institutional repositories software systems that support the archiving and dissemination of institutional resources.

• A resource is any digital or non-digital artifact.

• A resource, in a repository, has an associated metadata record.

• OAI-PMH was developed as a protocol for ‘harvesting’ metadata records from institutional repositories.



OAI and OAI-PMH

data provider (institutional repository)service provider



Federation and Scalability



Resource Metadata

• http://arxiv.org/oai2?o verb=GetRecord&identifier=oai:arXiv.org:cs/0504084&metadataPrefix=oai_dc

Protocol Verbs:

1. Identify

2. ListIdentifiers

3. ListMetadataFormats

4. ListRecords

5. ListSets

Resource Identifier (repository specific)

Metadata Format (repository specific)

- oai_dc, didl, olac, etc.

OAI Data Provider



<?xml version="1.0" encoding="UTF-8" ?> <OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"> <responseDate>2005-09-07T15:25:04Z</responseDate> <request verb="GetRecord" identifier="oai:arXiv.org:cs/0412047" metadataPrefix="oai_dc">http://arXiv.org/oai2</request> <GetRecord> <record> <header> <identifier>oai:arXiv.org:cs/0412047</identifier> <datestamp>2004-12-14</datestamp> <setSpec>cs</setSpec> </header> <metadata> <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"> <dc:title>A Social Network for Societal-Scale Decision-Making Systems</dc:title> <dc:creator>Rodriguez, Marko</dc:creator> <dc:creator>Steinbock, Daniel</dc:creator> <dc:subject>Computers and Society</dc:subject> <dc:subject>Data Structures and Algorithms</dc:subject> <dc:subject>Human-Computer Interaction</dc:subject> <dc:subject>H.4.2</dc:subject> <dc:subject>J.7</dc:subject> <dc:subject>K.4.m</dc:subject> <dc:description>In societal-scale decision-making systems the collective is faced ...</dc:description> <dc:description>Comment: Dynamically Distributed Democracy algorithm</dc:description> <dc:date>2004-12-10</dc:date> <dc:type>text</dc:type> <dc:identifier>http://arxiv.org/abs/cs/0412047</dc:identifier> <dc:identifier>North American Association for Computational Social and Organizational Science Conference Proceedings 2004</dc:identifier> </oai_dc:dc> </metadata> </record> </GetRecord></OAI-PMH>



Network Generation Algorithms

Co-Occurrence: if there exists a direct relation from A to C and a direct relation from B to C then there is C ‘co-occurs’ in both A and B

Occurrence: if there exists a direct relation from resource A to resource B then there is an ‘occurrence’ of B in A

A B

A B

C

Running Time: O([N2-N]/2)

Running Time: O(N)



<record> <header> <identifier>info:lanl-repo/i/0e08eefc-d053-11d8-85e1-d1cbfd475562</identifier> <datestamp>2004-07-07T20:20:14Z</datestamp> <setSpec>format:info*3Alanl-repo*2Fpro*2Fisi</setSpec> </header> <metadata> <didl:Resource mimeType="application/isi+xml"> <citation> <title>The meaning of self-organization in computing</title> <author> <au>Heylighen, F</au> Δ1, Δ1-2 <au>Gershenson, C</au> Δ1, Δ1-2 </author> <journal> <issn>1094-7167</issn> Δ3a, Δ3-2 <jtitle>IEEE INTELLIGENT SYSTEMS</jtitle> Δ3a, Δ3-2 <stitle>IEEE INTELL SYST</stitle> Δ3a, Δ3-2 </journal> <enumeration> <year>2003</year> <volume>18</volume> <issue>4</issue> <spage>72</spage> <epage>75</epage> </enumeration> </citation> <reference> <source> <stitle>P 13 EUR M CYB SYST</stitle> Δ3b, Δ2 <author>BOLLEN, J</author> Δ2 <spage>911</spage> Δ2 <year>1996</year> Δ2 </source> </reference> <reference> <source> <stitle>SWARM INTELLIGENCE</stitle> Δ3b, Δ2 <author>BONABEAU, E</author> Δ2 <year>1998</year> Δ2 </source> </reference> </didl:DIDL> </metadata></record>



A Scholarly Multi-Graph

Journal

coauthor

wrote written by wrote written by

published in contains

wrote written by

Journal

published in contains

references

Author

Paper

Author Author Author

Paper Papercites cites

coauthor

coauthor

coauthor

coauthor

coauthor

Layer-3

Layer-2

Layer-1



A Multi-Graph Repository-Flow Model

multi-graph

generator

multi-graph

data source

multi-graph

searcher

multi-graph

aggregator

1

2

3

4



Spreading Activation Algorithm

1

3

4

5

6

2 8

7

STIMULATION



Problem-Solving in a Scholarly Multi-Graph

J

P

A

JP

A

J

P

A Scholarly Multi-Graph Implementation

Finding Related Work

Finding Collaborators

Finding Journals

Finding Referees

Finding Audience

Problem representation

Scholarly Communication Process

Problem

Solution

Solution

P



Finding Related Papers

Author Layer

Paper Layer

P+ S S

Journal Layer



Finding Collaborators

Author Layer

Paper Layer

S

S

P+ P+ P+

Journal Layer



Finding a Journal

Author Layer

P+

P+

Paper Layer

P+ P+ P+

S

Journal Layer



Finding Peer-Reviewers

Author Layer

Paper Layer

P-

P-

S

S

P+ P+ P+

P+

Journal Layer



Finding Interested Readers

Author Layer

Paper Layer

S

S P+

S

S

P+

S

P+ P+ P+

Journal Layer



Extensibility

• Adding addition nodes to network: research institutions, keywords, subject categories, funding institutions, departments, etc.

• As long as you can represent a problem as a collection of resources and your solution as a collection of resources, a multi-graph is provides the necessary pattern-matching infrastructure to support the problem-solving.



Conclusion

• Thank you for coming…

• Questions?

Documents

Research Library, Los Alamos National Laboratory RESEARCH LIBRARY @ OAI4 - Geneva, Switzerland Digital Library Research & Prototyping Team Multi-Graph