AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Article Link
Collect
Submit Manuscript
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Regular Paper

Location and Trajectory Identification from Microblogs

School of Journalism and Communication, Renmin University of China, Beijing 100872, China
Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China
Airbnb Network (Beijing) Inc., Beijing 100020, China

A preliminary version of the paper was published in the Proceedings of ICDE 2014.

Show Author Information

Abstract

The rapid development of social networks has resulted in a proliferation of user-generated content (UGC), which can benefit many applications. In this paper, we study the problem of identifying a user’s locations from microblogs, to facilitate effective location-based advertisement and recommendation. Since the location information in a microblog is incomplete, we cannot get an accurate location from a local microblog. As such, we propose a global location identification method, GLITTER. GLITTER combines multiple microblogs of a user and utilizes them to identify the user’s locations. GLITTER not only improves the quality of identifying a user’s location but also supplements the location of a microblog so as to obtain an accurate location of a microblog. To facilitate location identification, GLITTER organizes points of interest (POIs) into a tree structure where leaf nodes are POIs and non-leaf nodes are segments of POIs, e.g., countries, cities, and streets. Using the tree structure, GLITTER first extracts candidate locations from each microblog of a user which correspond to some tree nodes. Then GLITTER aggregates these candidate locations and identifies top-k locations of the user. Using the identified top-k user locations, GLITTER refines the candidate locations and computes top-k locations of each microblog. To achieve high recall, we enable fuzzy matching between locations and microblogs. We propose an incremental algorithm to support dynamic updates of microblogs. We also study how to identify users’ trajectories based on the extracted locations. We propose an effective algorithm to extract high-quality trajectories. Experimental results on real-world datasets show that our method achieves high quality and good performance, and scales well.

Electronic Supplementary Material

Download File(s)
jcst-34-4-727-Highlights.pdf (361 KB)

References

[1]
Li R, Wang S, Deng H, Wang R, Chang K. Towards social user profiling: Unified and discriminative influence model for inferring home locations. In Proc. the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 2012, pp.1023-1031.
[2]
Chakrabarti K, Chaudhuri S, Ganti V, Xin D. An efficient filter for approximate membership checking. In Proc. the 2008 ACM SIGMOD International Conference on Management of Data, June 2008, pp.805-818.
[3]
Li G, Deng D, Feng J. Faerie: Efficient filtering algorithms for approximate dictionary-based entity extraction. In Proc. the 2011 ACM SIGMOD International Conference on Management of Data, June 2011, pp.529-540.
[4]
Li G, Deng D, Feng J. An efficient trie-based method for approximate entity extraction with edit-distance constraints. In Proc. the 28th International Conference on Data Engineering, April 2012, pp.762-773.
[5]

Hoffart J, Suchanek F M, Berberich K, Weikum G. YAGO2: A spatially and temporally enhanced knowledge base from Wikipedia. Artificial Intelligence, 2013, 194: 28-61.

[6]
Cheng Z, Caverlee J, Lee K. You are where you tweet: A content-based approach to geo-locating Twitter users. In Proc. the 19th ACM International Conference on Information and Knowledge Management, June 2010, pp.759-768.
[7]
Chandra S, Khan L, Muhaya F B. Estimating Twitter user location using social interactions — A content based approach. In Proc. the 3rd International Conference on Social Computing, October 2011, pp.838-843.
[8]
Amitay E, Harel N, Sivan R, Soffer A. Web-a-where: Geotagging web content. In Proc. the 27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, July 2004, pp.273-280.
[9]
Backstrom L, Kleinberg J M, Kumar R, Novak J. Spatial variation in search engine queries. In Proc. the 17th International Conference on World Wide Web, April 2008, pp.357-366.
[10]
Li G, Hu J, Feng J, Tan K. Effective location identification from microblogs. In Proc. the 30th International Conference on Data Engineering, March 2014, pp.880-891.
[11]
Chandel A, Nagesh P C, Sarawagi S. Efficient batch top-k search for dictionary-based entity recognition. In Proc. the 22nd International Conference on Data Engineering, April 2006, Article No. 28.
[12]
Sun C, Naughton J F. The token distribution filter for approximate string membership. In Proc. the 14th International Workshop on the Web and Databases, June 2011, Article No. 5.
[13]
Lu J, Han J, Meng X. Efficient algorithms for approximate member extraction using signature-based inverted lists. In Proc. the 18th ACM Conference on Information and Knowledge Management, November 2009, pp.315-324.
[14]
Wang W, Xiao C, Lin X, Zhang C. Efficient approximate entity extraction with edit distance constraints. In Proc. the 2009 ACM SIGMOD International Conference on Management of Data, June 2009, pp.759-770.
[15]

Chaudhuri S, Ganti V, Xin D. Mining document collections to facilitate accurate approximate entity matching. Proceedings of the VLDB Endowment, 2009, 2(1): 395-406.

[16]

Agrawal S, Chakrabarti K, Chaudhuri S, Ganti V. Scalable ad-hoc entity extraction from text collections. Proceedings of the VLDB Endowment, 2008, 1(1): 945-957.

[17]

Deng D, Li G, Feng J, Duan Y, Gong Z. A unified framework for approximate dictionary-based entity extraction. Proceedings of the VLDB Endowment, 2015, 24(1): 143-167.

[18]

Li K, Li G. Approximate query processing: What is new and where to go? — A survey on approximate query processing. Data Science and Engineering, 2018, 3(4): 379-397.

[19]

Gao D, Tong Y, She J, Song T, Chen L, Xu K. Top-k team recommendation and its variants in spatial crowdsourcing. Data Science and Engineering, 2017, 2(2): 136-150.

[20]

Leal F, Malheiro B, González-Vélez H, Burguillo J. Trust-based modelling of multi-criteria crowdsourced data. Data Science and Engineering, 2017, 2(3): 199-209.

[21]
Mei Q, Liu C, Su H, Zhai C. A probabilistic approach to spatiotemporal theme pattern mining on weblogs. In Proc. the 15th International Conference on World Wide Web, May 2006, pp.533-542.
[22]
Rattenbury T, Good N, Naaman M, Towards automatic extraction of event and place semantics from flickr tags. In Proc. the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, July 2007, pp.103-110.
[23]
Backstrom L, Sun E, Marlow C. Find me if you can: Improving geographical prediction with social and spatial proximity. In Proc. the 19th International Conference on World Wide Web, April 2010, pp.61-70.
[24]
Hao Q, Cai R, Wang C, Xiao R, Yang J, Pang Y, Zhang L. Equip tourists with knowledge mined from travelogues. In Proc. the 19th International Conference on World Wide Web, April 2010, pp.401-410.
[25]
Yin Z, Cao L, Han J, Zhai C, Huang T. Geographical topic discovery and comparison. In Proc. the 20th International Conference on World Wide Web, March 2011, pp.247-256.
[26]
Hong L, Ahmed A, Gurumurthy S, Smola A, Tsioutsiouliklis K. Discovering geographical topics in the Twitter stream. In Proc. the 21st International Conference on World Wide Web, April 2012, pp.769-778.
[27]

Li G, Deng D, Wang J, Feng J. PASS-JOIN: A partition-based method for similarity joins. Proceedings of the VLDB Endowment, 2011, 5(3): 253-264.

[28]

Li G, Deng D, Feng J. A partition-based method for string similarity joins with edit-distance constraints. ACM Transactions on Database Systems, 2013, 38(2): Article No. 9.

[29]

Wang J, Li G, Feng J. Trie-join: Efficient trie-based string similarity joins with edit-distance constraints. Proceedings of the VLDB Endowment, 2010, 3(1): 1219-1230.

[30]
Xu L, Ling T W, Wu H, Bao Z. DDE: From Dewey to a fully dynamic XML labeling scheme. In Proc. the 2009 ACM SIGMOD International Conference on Management of Data, June 2009, pp.719-730.
Journal of Computer Science and Technology
Pages 727-746
Cite this article:
Ta N, Li G-L, Hu J, et al. Location and Trajectory Identification from Microblogs. Journal of Computer Science and Technology, 2019, 34(4): 727-746. https://doi.org/10.1007/s11390-019-1939-3

398

Views

1

Crossref

N/A

Web of Science

1

Scopus

1

CSCD

Altmetrics

Received: 31 January 2019
Revised: 10 March 2019
Published: 19 July 2019
© 2019 Springer Science + Business Media, LLC & Science Press, China
Return