Patent citation network analysis: Ranking: From web pages to patents

P. Érdi, Péter Bruck

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Ranking of nodes in a network of diverse number of connections (degree) is an extensively studied field. In the theory of social networks centrality measures were constructed to rank nodes of networks based on their (not unique) topological importance, Another family of measures is related to the spectral properties of the adjacency matrix [1], which takes into account the importance of the influence of a neighbor. Importance can be defined recursively. Brin and Page [2] introduced a matching recursive centrality measure called PageRank. The relevance of this algorithm to citation networks was expressed by [3]. By adopting a citation-based recursive ranking method for patents the evolution of new field of technologies can be traced. Specifically, the laser/inkjet printer technology emerged from the recombination of existing technologies, such as sequential printing and static image production. The dynamics of the citations coming from the different precursor classes illuminate the mechanism of the emergence of new fields and give the possibility to make predictions about future technological development [4]. The combination of using clustering algorithms with ranking algorithms give more insight about the dynamics of the patent citation network [5].

Original languageEnglish
Title of host publicationArtificial Neural Networks and Machine Learning - 25th International Conference on Artificial Neural Networks, ICANN 2016, Proceedings
PublisherSpringer Verlag
Pages544
Number of pages1
Volume9886 LNCS
ISBN (Print)9783319447773
Publication statusPublished - 2016
Event25th International Conference on Artificial Neural Networks, ICANN 2016 - Barcelona, Spain
Duration: Sep 6 2016Sep 9 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9886 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other25th International Conference on Artificial Neural Networks, ICANN 2016
CountrySpain
CityBarcelona
Period9/6/169/9/16

Fingerprint

Citation Analysis
Patents
Citations
Network Analysis
Electric network analysis
Websites
Ranking
Centrality
Clustering algorithms
PageRank
Printing
Adjacency Matrix
Vertex of a graph
Spectral Properties
Recombination
Precursor
Social Networks
Clustering Algorithm
Lasers
Laser

Keywords

  • PageRank
  • Patent citation analysis
  • Ranking

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Érdi, P., & Bruck, P. (2016). Patent citation network analysis: Ranking: From web pages to patents. In Artificial Neural Networks and Machine Learning - 25th International Conference on Artificial Neural Networks, ICANN 2016, Proceedings (Vol. 9886 LNCS, pp. 544). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9886 LNCS). Springer Verlag.

Patent citation network analysis : Ranking: From web pages to patents. / Érdi, P.; Bruck, Péter.

Artificial Neural Networks and Machine Learning - 25th International Conference on Artificial Neural Networks, ICANN 2016, Proceedings. Vol. 9886 LNCS Springer Verlag, 2016. p. 544 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9886 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Érdi, P & Bruck, P 2016, Patent citation network analysis: Ranking: From web pages to patents. in Artificial Neural Networks and Machine Learning - 25th International Conference on Artificial Neural Networks, ICANN 2016, Proceedings. vol. 9886 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9886 LNCS, Springer Verlag, pp. 544, 25th International Conference on Artificial Neural Networks, ICANN 2016, Barcelona, Spain, 9/6/16.
Érdi P, Bruck P. Patent citation network analysis: Ranking: From web pages to patents. In Artificial Neural Networks and Machine Learning - 25th International Conference on Artificial Neural Networks, ICANN 2016, Proceedings. Vol. 9886 LNCS. Springer Verlag. 2016. p. 544. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Érdi, P. ; Bruck, Péter. / Patent citation network analysis : Ranking: From web pages to patents. Artificial Neural Networks and Machine Learning - 25th International Conference on Artificial Neural Networks, ICANN 2016, Proceedings. Vol. 9886 LNCS Springer Verlag, 2016. pp. 544 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{ed650126e7d84a548f5fabba77396924,
title = "Patent citation network analysis: Ranking: From web pages to patents",
abstract = "Ranking of nodes in a network of diverse number of connections (degree) is an extensively studied field. In the theory of social networks centrality measures were constructed to rank nodes of networks based on their (not unique) topological importance, Another family of measures is related to the spectral properties of the adjacency matrix [1], which takes into account the importance of the influence of a neighbor. Importance can be defined recursively. Brin and Page [2] introduced a matching recursive centrality measure called PageRank. The relevance of this algorithm to citation networks was expressed by [3]. By adopting a citation-based recursive ranking method for patents the evolution of new field of technologies can be traced. Specifically, the laser/inkjet printer technology emerged from the recombination of existing technologies, such as sequential printing and static image production. The dynamics of the citations coming from the different precursor classes illuminate the mechanism of the emergence of new fields and give the possibility to make predictions about future technological development [4]. The combination of using clustering algorithms with ranking algorithms give more insight about the dynamics of the patent citation network [5].",
keywords = "PageRank, Patent citation analysis, Ranking",
author = "P. {\'E}rdi and P{\'e}ter Bruck",
year = "2016",
language = "English",
isbn = "9783319447773",
volume = "9886 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "544",
booktitle = "Artificial Neural Networks and Machine Learning - 25th International Conference on Artificial Neural Networks, ICANN 2016, Proceedings",

}

TY - GEN

T1 - Patent citation network analysis

T2 - Ranking: From web pages to patents

AU - Érdi, P.

AU - Bruck, Péter

PY - 2016

Y1 - 2016

N2 - Ranking of nodes in a network of diverse number of connections (degree) is an extensively studied field. In the theory of social networks centrality measures were constructed to rank nodes of networks based on their (not unique) topological importance, Another family of measures is related to the spectral properties of the adjacency matrix [1], which takes into account the importance of the influence of a neighbor. Importance can be defined recursively. Brin and Page [2] introduced a matching recursive centrality measure called PageRank. The relevance of this algorithm to citation networks was expressed by [3]. By adopting a citation-based recursive ranking method for patents the evolution of new field of technologies can be traced. Specifically, the laser/inkjet printer technology emerged from the recombination of existing technologies, such as sequential printing and static image production. The dynamics of the citations coming from the different precursor classes illuminate the mechanism of the emergence of new fields and give the possibility to make predictions about future technological development [4]. The combination of using clustering algorithms with ranking algorithms give more insight about the dynamics of the patent citation network [5].

AB - Ranking of nodes in a network of diverse number of connections (degree) is an extensively studied field. In the theory of social networks centrality measures were constructed to rank nodes of networks based on their (not unique) topological importance, Another family of measures is related to the spectral properties of the adjacency matrix [1], which takes into account the importance of the influence of a neighbor. Importance can be defined recursively. Brin and Page [2] introduced a matching recursive centrality measure called PageRank. The relevance of this algorithm to citation networks was expressed by [3]. By adopting a citation-based recursive ranking method for patents the evolution of new field of technologies can be traced. Specifically, the laser/inkjet printer technology emerged from the recombination of existing technologies, such as sequential printing and static image production. The dynamics of the citations coming from the different precursor classes illuminate the mechanism of the emergence of new fields and give the possibility to make predictions about future technological development [4]. The combination of using clustering algorithms with ranking algorithms give more insight about the dynamics of the patent citation network [5].

KW - PageRank

KW - Patent citation analysis

KW - Ranking

UR - http://www.scopus.com/inward/record.url?scp=84988038860&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84988038860&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84988038860

SN - 9783319447773

VL - 9886 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 544

BT - Artificial Neural Networks and Machine Learning - 25th International Conference on Artificial Neural Networks, ICANN 2016, Proceedings

PB - Springer Verlag

ER -