Abstract
In mining constraint frequent neighboring class set, it has been reported that the present algorithm is unsuitable for mining long constraint frequent neighboring class set in spatial database. This paper proposes a filling algorithm of mining constraint frequent neighboring class set, which is suitable for mining any length constraint frequent neighboring class set. In order to improve efficiency of mining algorithm, the algorithm uses computing subset of neighboring class set to generate candidate via top-down strategy. Meanwhile, it uses the method of filling subset to double generate candidate frequent neighboring class set, and it also uses ‘and’ operation of corresponding integer to compute support. The result of experiment indicates that the algorithm is faster and more efficient than other algorithms when mining constraint frequent neighboring class sets.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Digital Content Technology and its Applications
Disclaimer: 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.
