Skip to Main content Skip to Navigation
Conference papers

Temporal-Based Ranking in Heterogeneous Networks

Abstract : Ranking is a fundamental task for network analysis, benefiting to filter and find valuable information. Time information impacts results in content that is sensitive to trends and events ranking. The current ranking either assumes that user’s interest and concerns remain static and never change over time or focuses on detecting recency information. Meanwhile most prevalent networks like social network are heterogeneous, that composed of multiple types of node and complex reliance structures. In this paper, we propose a general Temporal based Heterogeneous Ranking (TemporalHeteRank) method. We demonstrate that TemporalHeteRank is suitable for heterogeneous networks on the intuition that there is a mutually information balance relationship between different types of nodes that could be reflected on ranking results. We also explore the impact of node temporal feature in ranking, then we use the node life span by carefully investigating the issues of feasibility and generality. The experimental results on sina weibo ranking prove the effectiveness of our proposed approach.
Document type :
Conference papers
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/hal-01403054
Contributor : Hal Ifip <>
Submitted on : Friday, November 25, 2016 - 2:20:33 PM
Last modification on : Thursday, March 5, 2020 - 5:40:21 PM
Long-term archiving on: : Tuesday, March 21, 2017 - 8:08:43 AM

File

978-3-662-44917-2_3_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Chen Yu, Ruidan Li, Dezhong Yao, Feng Lu, Hai Jin. Temporal-Based Ranking in Heterogeneous Networks. 11th IFIP International Conference on Network and Parallel Computing (NPC), Sep 2014, Ilan, Taiwan. pp.23-34, ⟨10.1007/978-3-662-44917-2_3⟩. ⟨hal-01403054⟩

Share

Metrics

Record views

165

Files downloads

322