๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[ACM Press the fourth ACM international conference - Hong Kong, China (2011.02.09-2011.02.12)] Proceedings of the fourth ACM international conference on Web search and data mining - WSDM '11 - Supervised random walks

โœ Scribed by Backstrom, Lars; Leskovec, Jure

Book ID
115317539
Publisher
ACM Press
Year
2011
Tongue
English
Weight
514 KB
Volume
0
Category
Article
ISBN
1450304931

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

[ACM Press the fourth ACM international
[ACM Press the fourth ACM international conference - Hong Kong, China (2011.02.09-2011.02.12)] Proceedings of the fourth ACM international conference on Web search and data mining - WSDM '11 - #TwitterSearch
โœ Teevan, Jaime; Ramage, Daniel; Morris, Merredith Ringel ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› ACM Press ๐ŸŒ English โš– 448 KB

Social networking Web sites are not just places to maintain relationships; they can also be valuable information sources. However, little is known about how and why people search sociallygenerated content. In this paper we explore search behavior on the popular microblogging/social networking site T

[ACM Press the fourth ACM international
[ACM Press the fourth ACM international conference - Hong Kong, China (2011.02.09-2011.02.12)] Proceedings of the fourth ACM international conference on Web search and data mining - WSDM '11 - Dynamic relationship and event discovery
โœ Das Sarma, Anish; Jain, Alpa; Yu, Cong ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› ACM Press ๐ŸŒ English โš– 806 KB

This paper studies the problem of dynamic relationship and event discovery. A large body of previous work on relation extraction focuses on discovering predefined and static relationships between entities. In contrast, we aim to identify temporally defined (e.g., co-bursting) relationships that are