Abstract
In this paper, an algorithm is presented, which takes grid clique as a whole to find its all instance points neighbor lists in 9-neighbor area, and inserts them into the candidate extension clique list, then deletes the records that dont meet the criteria in the list, finally combines grid cliques and candidate extension clique list to generate maximal clique. The paper discusses the characteristics of spatial co-location pattern algorithm, and makes statistics of its maximal clique number generated in different distance threshold. The experiment shows that the improved algorithm can find out more maximal cliques.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
