Abstract
This paper examines grid-clustering method. Unlike the conventional methods, this method organizes the space surrounding the patterns. It uses a multidimensional grid data structure. The resulting block partitioning of the value space is clustered via a neighbor search. The mathematical description of the algorithms employed is given. Some case studies and ideas on how to use the algorithms are described.
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 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.
