Density-Based Top-K Spatial Textual Clusters Retrieval

Dingming Wu, Ilkcan Keles, Song Wu, Hao Zhou, Simonas Saltenis, Christian S. Jensen, Kezhong Lu*


Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

62 Downloads (Pure)


So-called spatial web queries retrieve web content representing points of interest, such that the points of interest have descriptions that are relevant to query keywords and are located close to a query location. Two broad categories of such queries exist. The first encompasses queries that retrieve single spatial web objects that each satisfy the query arguments. Most proposals belong to this category. The second category, to which this paper's proposal belongs, encompasses queries that support exploratory user behavior and retrieve sets of objects that represent regions of space that may be of interest to the user. Specifically, the paper proposes a new type of query, the top-k spatial textual cluster retrieval (k-STC) query that returns the top-k clusters that (i) are located close to a query location, (ii) contain objects that are relevant with regard to given query keywords, and (iii) have an object density that exceeds a given threshold. To compute this query, we propose a DBSCAN-based approach and an OPTICS-based approach that rely on on-line density-based clustering and that exploit early stop conditions. Empirical studies on real data sets offer evidence that the paper's proposals can find good quality clusters and are capable of excellent performance.

TidsskriftIEEE Transactions on Knowledge and Data Engineering
Udgave nummer11
Sider (fra-til)5263-5277
Antal sider15
StatusUdgivet - 1 nov. 2022

Bibliografisk note

Publisher Copyright:
© 1989-2012 IEEE.


Dyk ned i forskningsemnerne om 'Density-Based Top-K Spatial Textual Clusters Retrieval'. Sammen danner de et unikt fingeraftryk.