A clique-based approach for co-location pattern mining
- 1 July 2019
- journal article
- research article
- Published by Elsevier in Information Sciences
- Vol. 490, 244-264
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61472346, 61662086, 2016FA026, 2015FB114)
- Innovation Research Team of Yunnan Province (2018HC019)
This publication has 11 references indexed in Scilit:
- Redundancy Reduction for Prevalent Co-Location PatternsIEEE Transactions on Knowledge and Data Engineering, 2017
- Context-aware profiling of concepts from a semantic topological spaceKnowledge-Based Systems, 2017
- A fast space-saving algorithm for maximal co-location pattern miningExpert Systems with Applications, 2016
- Discovering Latent Semantics in Web Documents Using Fuzzy ClusteringIEEE Transactions on Fuzzy Systems, 2015
- Finding Probabilistic Prevalent Colocations in Spatially Uncertain Data SetsIEEE Transactions on Knowledge and Data Engineering, 2011
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graphInformation Processing Letters, 2011
- An order-clique-based approach for mining maximal co-locationsInformation Sciences, 2009
- Discovering colocation patterns from spatial data sets: a general approachIEEE Transactions on Knowledge and Data Engineering, 2004
- Finding All Maximal Cliques in Dynamic GraphsComputational Optimization and Applications, 2004
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973