Addressing time bias in bipartite graph ranking for important node identification

For online service platforms such as Netflix, it is important to propose a list of high quality movies to their users. This type of problem can be regarded as a ranking problem in a bipartite network. This is a well-known problem, that can be solved by a ranking algorithm. However, many classical ranking algorithms share a common drawback: they tend to rank higher older movies rather than newer ones, though some new movies may be of higher...