Proceedings of the 2016 International Conference on Management of Data 2016
DOI: 10.1145/2882903.2882921
|View full text |Cite
|
Sign up to set email alerts
|

Topic Exploration in Spatio-Temporal Document Collections

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
30
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
4
2
2

Relationship

2
6

Authors

Journals

citations
Cited by 42 publications
(30 citation statements)
references
References 32 publications
0
30
0
Order By: Relevance
“…Other information associated with a location such as users' activities, and documents that induces spatio-temporal topics are also used for modeling user's mobility behavior [44,46]. These induced topics can be used to extend LoCaTe further, based on the availability of the integrated data (checkins along with location and social information).…”
Section: Related Workmentioning
confidence: 99%
“…Other information associated with a location such as users' activities, and documents that induces spatio-temporal topics are also used for modeling user's mobility behavior [44,46]. These induced topics can be used to extend LoCaTe further, based on the availability of the integrated data (checkins along with location and social information).…”
Section: Related Workmentioning
confidence: 99%
“…Another study considers the problem of selectivity estimation [52] for a user-specified region. Based on precomputed probabilistic topic models for each grid cell, a recent study [66] proposes an approach to efficiently discover topics for a user-specified region. Additionally, event detection [1] is performed for a given region over text streams [51].…”
Section: Exploratory Search and Miningmentioning
confidence: 99%
“…Computing the topic model for a topic-range query with efficiency becomes the goal of many research proposals. An algorithm named Fast Set Sampling algorithm (FSS) has been proposed for topic-range query [15]. The original FSS algorithm indexes the whole corpus with a tree, and pre-compute the topic models every node of the tree.…”
Section: Background and Motivationmentioning
confidence: 99%
“…Therefore, all these leaf nodes are added to the query result dataset. Similar to 1D range query, for the first dimension, the query time complexity is O(logn), and the number of subtrees in the Canonical Set of [5,15] is in O(logn). Therefore, for the second dimension, there will be O(logn) subtrees being queried.…”
Section: Range Treementioning
confidence: 99%
See 1 more Smart Citation