1979
DOI: 10.1016/0031-3203(79)90054-2
|View full text |Cite
|
Sign up to set email alerts
|

A heuristic clustering algorithm using union of overlapping pattern-cells

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0

Year Published

1982
1982
2019
2019

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(2 citation statements)
references
References 8 publications
0
1
0
Order By: Relevance
“…What is interesting herein is that this group of algorithms allows for the traversal of neighbour cells. The first algorithm in this group was introduced by Warnekar and Krishna [14]. Nowadays, the most well-known algorithms in this group are CLIQUE, MAFIA, ENCLUS, OptiGrid, Ocluster and CBF.…”
Section: Introductionmentioning
confidence: 99%
“…What is interesting herein is that this group of algorithms allows for the traversal of neighbour cells. The first algorithm in this group was introduced by Warnekar and Krishna [14]. Nowadays, the most well-known algorithms in this group are CLIQUE, MAFIA, ENCLUS, OptiGrid, Ocluster and CBF.…”
Section: Introductionmentioning
confidence: 99%
“…These techniques divide the data space into a finite number of cells (creating a grid structure) and then try to discover clusters from dense regions in the cells. Grids were initially proposed in [128], but they only gained popularity after the methods STING and CLIQUE were introduced. The main advantage of grid-based clustering is a significant reduction in execution time because the grouping complexity of these algorithms depends on the pre-defined number of grid cells and not on the number of samples in the data.…”
Section: Density-based and Grid-based Clusteringmentioning
confidence: 99%