Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Link prediction in multiplex networks

From MaRDI portal
Publication:258449
Jump to:navigation, search

DOI10.3934/nhm.2015.10.17zbMath1352.68206OpenAlexW2028777193MaRDI QIDQ258449

Rushed Kanawati, Manisha Pujari

Publication date: 10 March 2016

Published in: Networks and Heterogeneous Media (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/nhm.2015.10.17


zbMATH Keywords

bibliographical networkscomplex network analysislink predictionmultiplex networkrank aggregation


Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Learning and adaptive systems in artificial intelligence (68T05)


Related Items (2)

Overlapping communities and the prediction of missing links in multiplex networks ⋮ Link prediction in multiplex networks based on interlayer similarity



Cites Work

  • Predicting missing links via local information
  • The matrix-forest theorem and measuring relations in small social groups
  • The weighted majority algorithm
  • A new status index derived from sociometric analysis
  • Emergence of Scaling in Random Networks
  • Empirical Analysis of an Evolving Social Network
  • A Consistent Extension of Condorcet’s Election Principle
  • A framework for dynamic link prediction in heterogeneous networks
  • A Short Introduction to Computational Social Choice




This page was built for publication: Link prediction in multiplex networks

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:258449&oldid=12146722"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 01:37.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki