Jaber, Mohammad and Papapetrou, Panagiotis and Helmer, Sven and Wood, Peter T. (2014) Using time-sensitive rooted PageRank to detect hierarchical social relationships. In: Blockeel, H. and van Leeuwen, M. and Vinciotti, V. (eds.) Advances in Intelligent Data Analysis XIII - 13th International Symposium, IDA 2014, Leuven, Belgium, October 30 - November 1, 2014. Proceedings. Lecture Notes in Computer Science 8819. New York, U.S.: Springer, pp. 143-154. ISBN 9783319125701.
|
Text
IDA_MP.pdf - Author's Accepted Manuscript Download (457kB) | Preview |
Abstract
We study the problem of detecting hierarchical ties in a social network by exploiting the interaction patterns between the actors (members) involved in the network. Motivated by earlier work using a rank-based approach, i.e., Rooted-PageRank, we introduce a novel time-sensitive method, called T-RPR, that captures and exploits the dynamics and evolution of the interaction patterns in the network in order to identify the underlying hierarchical ties. Experiments on two real datasets demonstrate the performance of T-RPR in terms of recall and show its superiority over a recent competitor method.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-12571-8” |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Research Centres and Institutes: | Birkbeck Knowledge Lab |
| Depositing User: | Peter Wood |
| Date Deposited: | 11 Nov 2014 09:45 |
| Last Modified: | 09 Aug 2023 12:35 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/10940 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
