|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'500'096
Articles rated: 2609
19 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
How to project a bipartite network? | | Tao Zhou
; Jie Ren
; Matus Medo
; Yi-Cheng Zhang
; | | Date: |
4 Jul 2007 | | Abstract: | The one-mode projecting is extensively used to compress the bipartite
networks. Since the one-mode projection is always less informative than the
bipartite representation, a proper weighting method is required to better
retain the original information. In this article, inspired by the network-based
resource-allocation dynamics, we raise a weighting method, which can be
directly applied in extracting the hidden information of networks, with
remarkably better performance than the widely used global ranking method as
well as collaborative filtering. This work not only provides a creditable
method in compressing bipartite networks, but also highlights a possible way
for the better solution of a long-standing challenge in modern information
science: How to do personal recommendation? | | Source: | arXiv, arxiv.0707.0540 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER