Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Cluster analysis
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Grid-based clustering === The grid-based technique is used for a [[Multidimensional scaling|multi-dimensional]] data set.<ref>{{Cite book|editor-last1=Aggarwal|editor-first1=Charu C.|editor-last2=Reddy|editor-first2=Chandan K.|title=Data Clustering : Algorithms and Applications|isbn=978-1-315-37351-5|oclc=1110589522}}</ref> In this technique, we create a grid structure, and the comparison is performed on grids (also known as cells). The grid-based technique is fast and has low computational complexity. There are two types of grid-based clustering methods: STING and CLIQUE. Steps involved in the grid-based clustering [[algorithm]] are: # Divide data space into a finite number of cells. # Randomly select a cell βcβ, where c should not be traversed beforehand. # Calculate the density of βcβ # If the density of βcβ greater than threshold density ## Mark cell βcβ as a new cluster ## Calculate the density of all the neighbors of βcβ ## If the density of a neighboring cell is greater than threshold density then, add the cell in the cluster and repeat steps 4.2 and 4.3 till there is no neighbor with a density greater than threshold density. # Repeat steps 2,3 and 4 till all the cells are traversed. # Stop.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)