ABSTRACT
Spatial keyword queries retrieve spatial textual objects that are near a query location and are relevant to query keywords. The paper defines the top-k spatial textual clusters (k-STC) query that returns the top-k clusters that are located close to a given query location, contain relevant objects with regard to given query keywords, and have an object density that exceeds a given threshold. This query aims to support users who wish to explore nearby regions with many relevant objects. To compute this query, the paper proposes a basic and an advanced algorithm that rely on on-line density-based clustering. An empirical study offers insight into the performance properties of the proposed algorithms.
- M. Ankerst, M. M. Breunig, H.-P. Kriegel, and J. Sander. OPTICS: ordering points to identify the clustering structure. In SIGMOD, pages 49--60, 1999. Google ScholarDigital Library
- K. Bøgh, A. Skovsgaard, and C. S. Jensen. Groupfinder: A new approach to top-k point-of-interest group retrieval. PVLDB, 6(12):1226--1229, 2013. Google ScholarDigital Library
- X. Cao, G. Cong, T. Guo, C. S. Jensen, and B. C. Ooi. Efficient processing of spatial group keyword queries. ACM TODS, 40(2):13, 2015. Google ScholarDigital Library
- X. Cao, G. Cong, and C. S. Jensen. Retrieving top-k prestige-based relevant spatial web objects. PVLDB, 3(1):373--384, 2010. Google ScholarDigital Library
- X. Cao, G. Cong, C. S. Jensen, and B. C. Ooi. Collective spatial keyword querying. In SIGMOD, pages 373--384, 2011. Google ScholarDigital Library
- X. Cao, G. Cong, C. S. Jensen, and M. L. Yiu. Retrieving regions of interest for user exploration. PVLDB, 7(9):733--744, 2014. Google ScholarDigital Library
- D.-W. Choi, C.-W. Chung, and Y. Tao. A scalable algorithm for maximizing range sum in spatial databases. PVLDB, 5(11):1088--1099, 2012. Google ScholarDigital Library
- G. Cong, C. S. Jensen, and D. Wu. Efficient retrieval of the top-k most relevant spatial web objects. PVLDB, 2(1):337--348, 2009. Google ScholarDigital Library
- M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In KDD, pages 226--231, 1996. Google ScholarDigital Library
- J. K. Lawder and P. J. H. King. Using space-filling curves for multi-dimensional indexing. In BNCOD, pages 20--35, 2000. Google ScholarDigital Library
- Z. Li, K. C. K. Lee, B. Zheng, W.-C. Lee, D. L. Lee, and X. Wang. IR-tree: an efficient index for geographic document search. IEEE TKDE, 23(4):585--599, 2011. Google ScholarDigital Library
- J. Liu, G. Yu, and H. Sun. Subject-oriented top-k hot region queries in spatial dataset. In CIKM, pages 2409--2412, 2011. Google ScholarDigital Library
- P. Liu, D. Zhou, and N. Wu. VDBSCAN: Varied density based spatial clustering of applications with noise. In Service Systems and Service Management, pages 1--4, 2007.Google ScholarCross Ref
- C. Long, R. C.-W. Wong, K. Wang, and A. W.-C. Fu. Collective spatial keyword queries: a distance owner-driven approach. In SIGMOD, pages 689--700, 2013. Google ScholarDigital Library
- J. M. Ponte and W. B. Croft. A language modeling approach to information retrieval. In SIGIR, pages 275--281, 1998. Google ScholarDigital Library
- G. Salton, A. Wong, and C. S. Yang. A vector space model for automatic indexing. Commun. ACM, 18:613--620, 1975. Google ScholarDigital Library
- J. Sander, M. Ester, H.-P. Kriegel, and X. Xu. Density-based clustering in spatial databases: The algorithm GDBSCAN and its applications. Data Min. Knowl. Discov., 2(2):169--194, 1998. Google ScholarDigital Library
- A. Skovsgaard and C. S. Jensen. Finding top-phk relevant groups of spatial web objects. VLDB J., 24(4):537--555, 2015. Google ScholarDigital Library
- Y. Tao, X. Hu, D.-W. Choi, and C.-W. Chung. Approximate maxrs in spatial databases. PVLDB, 6(13):1546--1557, 2013. Google ScholarDigital Library
- X. Wang and H. J. Hamilton. DBRS: A density-based spatial clustering method with random sampling. In PAKDD, pages 563--575, 2003. Google ScholarDigital Library
- D. Wu, G. Cong, and C. S. Jensen. A framework for efficient spatial web object retrieval. VLDB J., 21(6):797--822, 2012. Google ScholarDigital Library
- D. Wu and C. S. Jensen. A density-based approach to the retrieval of top-k spatial textual clusters. CoRR, abs/1607.08681, 2016.Google Scholar
- D. Wu, M. L. Yiu, G. Cong, and C. S. Jensen. Joint top-k spatial keyword query processing. IEEE TKDE, 24(10):1889--1903, 2012. Google ScholarDigital Library
- J. Zobel and A. Moffat. Inverted files for text search engines. In ACM Comput. Surv., volume 38, article 6, 2006. Google ScholarDigital Library
Index Terms
- A Density-Based Approach to the Retrieval of Top-K Spatial Textual Clusters
Recommendations
Efficient retrieval of the top-k most relevant spatial web objects
The conventional Internet is acquiring a geo-spatial dimension. Web documents are being geo-tagged, and geo-referenced objects such as points of interest are being associated with descriptive text documents. The resulting fusion of geo-location and ...
Batch processing of Top-k Spatial-textual Queries
GeoRich'15: Second International ACM Workshop on Managing and Mining Enriched Geo-Spatial DataTop-k spatial-textual queries have received significant attention in the research community. Several techniques to efficiently process this class of queries are now widely used in a variety of applications. However, the problem of how best to process ...
Density-based spatial keyword querying
With the rocket development of the Internet, WWW(World Wide Web), mobile computing and GPS (Global Positioning System) services, location-based services like Web GIS (Geographical Information System) portals are becoming more and more popular. Spatial ...
Comments