A Survey on STING and CLIQUE Grid Based Clustering Methods

Article Sidebar

PDF
Published: Jun 21, 2017
DOI: https://doi.org/10.26483/ijarcs.v8i5.3616
Keywords:
Clustering, STING, CLIQUE, grid based clustering, hierarchical structure

Main Article Content

Suman Saini
kurukshetra University, Kurukshetra
Pinki Rani
Kurukshetra University, Kurukshetra

Abstract

Abstract : Clustering is the process of grouping the data into classes or clusters so that objects within a cluster have high similarity but are very dissimilar to objects in other clusters. Clustering methods can be classified as Partitioning methods, Hierarchical methods, Density-based methods, Grid-based methods and Model-based methods. This paper intends to overview the grid based clustering methods like STING and CLIQUE. The grid based clustering approach uses a multiresolution grid data structure. It quantizes the object space into a finite number of cells that form a grid structure on which all of the operations for clustering are performed. The main advantage of the approach is its fast processing time, which is typically independent of the number of data objects, yet dependent on only the number of cells in each dimension in the quantized space.

Downloads

Download data is not yet available.

Article Details

Issue
Vol. 8 No. 5 (2017): May-June 2017
Section
Articles

COPYRIGHT

Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.

Authors who publish with this journal agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
  • The journal allows the author(s) to retain publishing rights without restrictions.
  • The journal allows the author(s) to hold the copyright without restrictions.

References

REFERENCES

Jaiwei Han and Micheline Kamber, “Datamining: Concepts and Techniquesâ€, Morg Kaufman Publishers, 2001.

Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopulos, Prabhakar Raghavan, “Automatic subspace clustering of high dimensional data for data mining applicationsâ€, ACM SIGMOD inter- national conference on Management of data, vol.27, no.2, pp.94-105, June 1998.

Anne Patrikainen and Marina Meila, “Comparing Subspace Clusteringsâ€, IEEE Transactions on knowledge and data engineering, vol.18, no.7, pp.902-916, July 2006.

W.,Yang J., Muntz R. STING: A statistical information grid approach to spatial data mining. Proc. 23rd Int. conf. on very large data bases. Morgan Kaufmann, 1997, pp.186-195.

Hans-Peter Kriegel and Arthur Zimek, “Subspace clustering, Ensemble clustering, Alternative clustering, Multiview clustering: What can we learn from each otherâ€, In Proc. 1st Int’l workshop on discovering, summarizing and using multiple clusterings, 2010.

Baozhi Qiu, Xizhi zhang, Junyi shen. Grid-based clustering algorithm for multi- density. Proceedings of 2005 international conference on machine learning and cy-bernetics, p1509-1512.

E.Schikuta,“Grid Clustering: An Efficient Hierarchical Clustering Method for Very Large Data Setsâ€, Proceedings of the 13thInternational Conference on Pattern Recognition,Vol. 2, pp. 101-105, 1996.

C.S. Warnekar, G. Krishna, “A Heuristic Clustering Algorithm Using Union of Overlapping Pattern-Cells†, Pattern Reco- gnition, Vol. 11, No.2, 1979 pp. 85-93

R.Agrawal, J.Gehrke, D.Gunopulos, P. Rag- havan, “Automatic Subspace Clustering of High Dimensional Data for Data Mining Applicationsâ€, Proceedings of 1998 ACM-SIGMOD, pp. 94-105, 1998.

J. Iivarinen and A. Visa, “An adaptive texture and shape based defect classification,†Procee- dings of the 14th International Conference on Pattern Recognition, Vol. 1, pp. 117-122, 1998.