Efficiently Mining High Average Utility Co-location Patterns Using Maximal Cliques and Pruning Strategies
- 17 October 2024
- book chapter
- Published by Springer Nature
- p. 121-134
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Mining Maximal High Utility Co-location Patterns from Large-Scale Spatial Data2024
- EHUCM: An Efficient Algorithm for Mining High Utility Co-location Patterns from Spatial Datasets with Feature-specific Utilities2021
- MCHT: A maximal clique and hash table-based maximal prevalent co-location pattern mining algorithmExpert Systems with Applications, 2021
- A spatial co-location pattern mining framework insensitive to prevalence thresholds based on overlapping cliquesDistributed and Parallel Databases, 2021
- An adaptive detection of multilevel co-location patterns based on natural neighborhoodsInternational Journal of Geographical Information Science, 2020
- A clique-based approach for co-location pattern miningInformation Sciences, 2019
- Efficient Maximal Clique Enumeration Over Graph DataData Science and Engineering, 2016
- Spatial co-location pattern mining for location-based services in road networksExpert Systems with Applications, 2016
- A framework for mining spatial high utility co-location patterns2015
- Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time2010