skip to content
Analyzing the structure of U.S. patents network
ClosePreview this item
Checking...

Analyzing the structure of U.S. patents network

Author: Vladimir Batagelj; Nataša Kejžar; Simona Korenjak-Černe; Matjaž Zaveršnik; et al
Edition/Format:   Article : English
Publication:Data science and classification, Str. [141]-148
Database:WorldCat
Summary:
The U.S. patents network is a network of almost 3.8 millions patents (network vertices) from the year 1963 to 1999 (Hall et al., 2001) and more than 16.5 millions citations (network arcs). It is an example of a very large citation network. We analyzed the U.S. patents network with the tools of network analysis in order to get insight into the structure of the network as an initial step to the study of innovations  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

&AllPage.SpinnerRetrieving;

Find a copy in the library

We were unable to get information about libraries that hold this item.

Details

Document Type: Article
All Authors / Contributors: Vladimir Batagelj; Nataša Kejžar; Simona Korenjak-Černe; Matjaž Zaveršnik; et al
ISBN: 3540344152
OCLC Number: 441711305
Notes: Soavtorji: Nataša Kejžar, Simona Korenjak-Černe, Matjaž Zaveršnik.
Description: Str. [141]-148.
Responsibility: Vladimir Batagelj ... [et al.].

Abstract:

The U.S. patents network is a network of almost 3.8 millions patents (network vertices) from the year 1963 to 1999 (Hall et al., 2001) and more than 16.5 millions citations (network arcs). It is an example of a very large citation network. We analyzed the U.S. patents network with the tools of network analysis in order to get insight into the structure of the network as an initial step to the study of innovations and technical changes based on patents citation network data. In our approach the SPC (Search Path Count) weights, proposed by Hummon and Doreian (1989), for vertices and arcs are calculated first. Based on these weights vertex and line islands (Batagelj and Zaveršnik, 2004) are determined to identify the main themes of U.S. patents network. All analyses were done with Pajek - a program for analysis and visualization of large networks. As a result of the analysis the obtained main U.S. patents topics are presented.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/441711305>
library:oclcnum"441711305"
library:placeOfPublication
owl:sameAs<info:oclcnum/441711305>
rdf:typeschema:Article
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:author
schema:author
schema:author
schema:author
schema:datePublished"2006"
schema:description"The U.S. patents network is a network of almost 3.8 millions patents (network vertices) from the year 1963 to 1999 (Hall et al., 2001) and more than 16.5 millions citations (network arcs). It is an example of a very large citation network. We analyzed the U.S. patents network with the tools of network analysis in order to get insight into the structure of the network as an initial step to the study of innovations and technical changes based on patents citation network data. In our approach the SPC (Search Path Count) weights, proposed by Hummon and Doreian (1989), for vertices and arcs are calculated first. Based on these weights vertex and line islands (Batagelj and Zaveršnik, 2004) are determined to identify the main themes of U.S. patents network. All analyses were done with Pajek - a program for analysis and visualization of large networks. As a result of the analysis the obtained main U.S. patents topics are presented."
schema:exampleOfWork<http://worldcat.org/entity/work/id/353720152>
schema:inLanguage"en"
schema:name"Analyzing the structure of U.S. patents network"
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.