TY - JOUR
T1 - CLARANS
T2 - A method for clustering objects for spatial data mining
AU - Ng, Raymond T.
AU - Han, Jiawei
N1 - Funding Information:
R.T. Ng’s research was partially sponsored by NSERC grants OGP0138055 and STR0134419, and IRIS-3 grants. J. Han’s research was partially supported by NSERC grant OGP03723 and NCE/IRIS-3 grants.
PY - 2002/9
Y1 - 2002/9
N2 - Spatial data mining is the discovery of interesting relationships and characteristics that may exist implicitly in spatial databases. To this end, this paper has three main contributions. First, we propose a new clustering method called CLARANS, whose aim is to identify spatial structures that may be present in the data. Experimental results indicate that, when compared with existing clustering methods, CLARANS is very efficient and effective. Second, we investigate how CLARANS can handle not only points objects, but also polygon objects efficiently. One of the methods considered, called the IR-approximation, is very efficient in clustering convex and nonconvex polygon objects. Third, building on top of CLARANS, we develop two spatial data mining algorithms that aim to discover relationships between spatial and nonspatial attributes. Both algorithms can discover knowledge that is difficult to find with existing spatial data mining algorithms.
AB - Spatial data mining is the discovery of interesting relationships and characteristics that may exist implicitly in spatial databases. To this end, this paper has three main contributions. First, we propose a new clustering method called CLARANS, whose aim is to identify spatial structures that may be present in the data. Experimental results indicate that, when compared with existing clustering methods, CLARANS is very efficient and effective. Second, we investigate how CLARANS can handle not only points objects, but also polygon objects efficiently. One of the methods considered, called the IR-approximation, is very efficient in clustering convex and nonconvex polygon objects. Third, building on top of CLARANS, we develop two spatial data mining algorithms that aim to discover relationships between spatial and nonspatial attributes. Both algorithms can discover knowledge that is difficult to find with existing spatial data mining algorithms.
KW - Clustering algorithms
KW - Computational geometry
KW - Randomized search
KW - Spatial data mining
UR - http://www.scopus.com/inward/record.url?scp=0036709106&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0036709106&partnerID=8YFLogxK
U2 - 10.1109/TKDE.2002.1033770
DO - 10.1109/TKDE.2002.1033770
M3 - Article
AN - SCOPUS:0036709106
SN - 1041-4347
VL - 14
SP - 1003
EP - 1016
JO - IEEE Transactions on Knowledge and Data Engineering
JF - IEEE Transactions on Knowledge and Data Engineering
IS - 5
ER -