Clustering with obstacles for Geographical Data Mining

Clustering algorithms typically use the Euclidean distance. However, spatial proximity is dependent on obstacles, caused by related information in other layers of the spatial database. We present a clustering algorithm suitable for large spatial databases with obstacles. The algorithm is free of use...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:ISPRS journal of photogrammetry and remote sensing Jg. 59; H. 1; S. 21 - 34
Hauptverfasser: Estivill-Castro, Vladimir, Lee, Ickjai
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.08.2004
Schlagworte:
ISSN:0924-2716, 1872-8235
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Clustering algorithms typically use the Euclidean distance. However, spatial proximity is dependent on obstacles, caused by related information in other layers of the spatial database. We present a clustering algorithm suitable for large spatial databases with obstacles. The algorithm is free of user-supplied arguments and incorporates global and local variations. The algorithm detects clusters in complex scenarios and successfully supports association analysis between layers. All this occurs within O( n log n+[ s+ t] log n) expected time, where n is the number of points, s is the number of line segments that determine the obstacles and t is the number of Delaunay edges intersecting the obstacles.
AbstractList Clustering algorithms typically use the Euclidean distance. However, spatial proximity is dependent on obstacles, caused by related information in other layers of the spatial database. We present a clustering algorithm suitable for large spatial databases with obstacles. The algorithm is free of user-supplied arguments and incorporates global and local variations. The algorithm detects clusters in complex scenarios and successfully supports association analysis between layers. All this occurs within O( n log n+[ s+ t] log n) expected time, where n is the number of points, s is the number of line segments that determine the obstacles and t is the number of Delaunay edges intersecting the obstacles.
Author Lee, Ickjai
Estivill-Castro, Vladimir
Author_xml – sequence: 1
  givenname: Vladimir
  surname: Estivill-Castro
  fullname: Estivill-Castro, Vladimir
  email: v.estivill-castro@griffith.edu.au
  organization: School of Computing and Information Technology, Nathan Campus, Griffith University, Brisbane 4111, QLD, Australia
– sequence: 2
  givenname: Ickjai
  surname: Lee
  fullname: Lee, Ickjai
  organization: School of Information Technology, James Cook University, Townsville 4181, QLD, Australia
BookMark eNqNj81KAzEUhYNUsK0-g_MCM-YmnSRduChVq1Bxo-uQ5qfNME5KEhXf3pSKCze6uBy4nO_AN0GjIQwWoUvADWBgV13j0z6mrlxDMKYNkKbECRqD4KQWhLYjNMZzMqsJB3aGJil1GGNomRgjtuzfUrbRD9vqw-ddFTYpK93bVLkQq5UN26j2O69VX92orKpHP5TuOTp1qk_24jun6OXu9nl5X6-fVg_LxbrWFGiuHeZYcQMw42KuGeFCCWY4lJczGhSeW6Za0gormFZ0M2PA3IZiY412rQM6Rfy4q2NIKVon99G_qvgpAcuDvuzkj7486EsgskQhr3-R2meVfRhyVL7_B7848rbovXsbZdLeDtoaH63O0gT_58YX3NB_fg
CitedBy_id crossref_primary_10_1111_cgf_70100
crossref_primary_10_1016_j_cageo_2013_03_002
crossref_primary_10_4304_jnw_8_7_1582_1588
crossref_primary_10_1080_13658816_2013_769136
crossref_primary_10_1155_2014_160730
crossref_primary_10_1155_2022_5659280
Cites_doi 10.1109/T-C.1971.223083
10.1093/comjnl/41.8.578
10.1109/2.781637
10.1139/geomat-1991-0005
10.1016/0031-3203(94)00125-6
10.1145/568574.568575
10.1016/S0198-9715(01)00044-8
10.1080/136588198241734
10.1023/A:1015279009755
10.1007/BF01584648
10.1016/0734-189X(89)90146-1
10.1023/A:1016308404627
10.1080/02693798708927821
ContentType Journal Article
Copyright 2004 Elsevier B.V.
Copyright_xml – notice: 2004 Elsevier B.V.
DBID AAYXX
CITATION
DOI 10.1016/j.isprsjprs.2003.12.003
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Geography
Engineering
EISSN 1872-8235
EndPage 34
ExternalDocumentID 10_1016_j_isprsjprs_2003_12_003
S0924271603000765
GroupedDBID --K
--M
.~1
0R~
1B1
1RT
1~.
1~5
29J
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAIAV
AAIKC
AAIKJ
AAKOC
AALRI
AAMNW
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABBOA
ABFNM
ABJNI
ABMAC
ABQEM
ABQYD
ABXDB
ABYKQ
ACDAQ
ACGFS
ACLVX
ACNNM
ACRLP
ACSBN
ACZNC
ADBBV
ADEZE
ADJOM
ADMUD
AEBSH
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
ATOGT
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBLVA
GBOLZ
HMA
HVGLF
HZ~
H~9
IHE
IMUCA
J1W
KOM
LY3
M41
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
RNS
ROL
RPZ
SDF
SDG
SEP
SES
SEW
SPC
SPCBC
SSE
SSV
SSZ
T5K
T9H
WUQ
ZMT
~02
~G-
9DU
AAHBH
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABUFD
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
ID FETCH-LOGICAL-c313t-f070a7d114789c6278a86d717d1fdc1a09e6a5258e86ca3b4616fb30dedcf5f13
ISICitedReferencesCount 11
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000223116800003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0924-2716
IngestDate Tue Nov 18 22:36:06 EST 2025
Sat Nov 29 05:54:49 EST 2025
Fri Feb 23 02:21:02 EST 2024
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords delaunay triangulation
clustering
association analysis
large spatial databases
Geographical Data Mining
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c313t-f070a7d114789c6278a86d717d1fdc1a09e6a5258e86ca3b4616fb30dedcf5f13
PageCount 14
ParticipantIDs crossref_primary_10_1016_j_isprsjprs_2003_12_003
crossref_citationtrail_10_1016_j_isprsjprs_2003_12_003
elsevier_sciencedirect_doi_10_1016_j_isprsjprs_2003_12_003
PublicationCentury 2000
PublicationDate 2004-08-01
PublicationDateYYYYMMDD 2004-08-01
PublicationDate_xml – month: 08
  year: 2004
  text: 2004-08-01
  day: 01
PublicationDecade 2000
PublicationTitle ISPRS journal of photogrammetry and remote sensing
PublicationYear 2004
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References (BIB30) 2001
Estivill-Castro, Murray (BIB10) 1998; vol. 1394
Kang, Kim, Li (BIB22) 1997
Estivill-Castro (BIB8) 2000; vol. 1886
Guha, Rastogi, Shim (BIB20) 1998; vol. 27
Gold (BIB18) 1992; vol. 639
Bezdek (BIB3) 1981
Openshaw (BIB33) 1994
Estivill-Castro, Lee (BIB15) 2002; 6
Cherkassky, Muller (BIB5) 1998
Gold (BIB17) 1991; 45
Knorr, Ng, Shilvock (BIB25) 1997; vol. 1262
Kuhn (BIB27) 1973; 4
Veloso, Stone, Han (BIB45) 1998; 19
Ahuja, Tuceryan (BIB2) 1989; 48
Openshaw, Charlton, Wymer, Craft (BIB36) 1987; 1
Posse, C., 1999. Hierarchical Model-Based Clustering for Large Datasets. Technical Report 363, Department of Statistics, University of Washington.
Celeux, Govaret (BIB4) 1995; 28
Estivill-Castro, Houle (BIB11) 1999; vol. 1574
Liotta, G., 1996. Low Degree Algorithm for Computing and Checking Gabriel Graphs. Technical Report 96-28, Department of Computer Science, Brown University.
Tung, Hou, Han (BIB44) 2001
Wang, Yang, Muntz (BIB47) 1999
Grabmeier, Rudolph (BIB19) 2002; 6
Lee, Estivill-Castro (BIB28) 2001
Zhang, Ramakrishnan, Livny (BIB50) 1996; vol. 25 (2)
Rousseeuw, Leroy (BIB38) 1987
Ester, Kriegel, Sander, Xu (BIB7) 1996
Keil, Gutwin (BIB24) 1989; vol. 382
Aho, Hopcroft, Ullman (BIB1) 1974
Son, Kang, Kim, Li (BIB41) 1998
Estivill-Castro, Lee (BIB13) 2001
Witten, Frank (BIB48) 2000
Estivill-Castro, Lee (BIB14) 2002; 26
Openshaw, Alvanides (BIB35) 1999; vol. 1
Karypis, Han, Kumar (BIB23) 1999; 32
Tsoukatos, Gunopulos (BIB42) 2001; vol. 2121
Tung, Hou, Han (BIB43) 2000; vol. 1805
Wang, Yang, Muntz (BIB46) 1997
Estivill-Castro, Lee (BIB12) 2001; vol. 2007
Hastie, Tibshirani, Friedman (BIB21) 2001
Openshaw (BIB34) 1999
Schikuta, Erhart (BIB39) 1997; vol. 1280
Eldershaw, Hegland (BIB6) 1997
Shekhar, Huang (BIB40) 2001; vol. 2121
Ng, Han (BIB32) 1994
Zahn (BIB49) 1971; 20
Estivill-Castro (BIB9) 2002; 4
Murray, Estivill-Castro (BIB31) 1998; 12
Koperski, Han (BIB26) 1995; vol. 951
Fraley, Raftery (BIB16) 1998; 41
Zhang (10.1016/j.isprsjprs.2003.12.003_BIB50) 1996; vol. 25 (2)
Gold (10.1016/j.isprsjprs.2003.12.003_BIB17) 1991; 45
Cherkassky (10.1016/j.isprsjprs.2003.12.003_BIB5) 1998
Openshaw (10.1016/j.isprsjprs.2003.12.003_BIB33) 1994
Lee (10.1016/j.isprsjprs.2003.12.003_BIB28) 2001
Murray (10.1016/j.isprsjprs.2003.12.003_BIB31) 1998; 12
Wang (10.1016/j.isprsjprs.2003.12.003_BIB46) 1997
Estivill-Castro (10.1016/j.isprsjprs.2003.12.003_BIB9) 2002; 4
Guha (10.1016/j.isprsjprs.2003.12.003_BIB20) 1998; vol. 27
Eldershaw (10.1016/j.isprsjprs.2003.12.003_BIB6) 1997
Estivill-Castro (10.1016/j.isprsjprs.2003.12.003_BIB14) 2002; 26
Tung (10.1016/j.isprsjprs.2003.12.003_BIB44) 2001
Ng (10.1016/j.isprsjprs.2003.12.003_BIB32) 1994
Keil (10.1016/j.isprsjprs.2003.12.003_BIB24) 1989; vol. 382
Gold (10.1016/j.isprsjprs.2003.12.003_BIB18) 1992; vol. 639
Kang (10.1016/j.isprsjprs.2003.12.003_BIB22) 1997
Kuhn (10.1016/j.isprsjprs.2003.12.003_BIB27) 1973; 4
Estivill-Castro (10.1016/j.isprsjprs.2003.12.003_BIB15) 2002; 6
Estivill-Castro (10.1016/j.isprsjprs.2003.12.003_BIB13) 2001
Schikuta (10.1016/j.isprsjprs.2003.12.003_BIB39) 1997; vol. 1280
Grabmeier (10.1016/j.isprsjprs.2003.12.003_BIB19) 2002; 6
Zahn (10.1016/j.isprsjprs.2003.12.003_BIB49) 1971; 20
Fraley (10.1016/j.isprsjprs.2003.12.003_BIB16) 1998; 41
Knorr (10.1016/j.isprsjprs.2003.12.003_BIB25) 1997; vol. 1262
Rousseeuw (10.1016/j.isprsjprs.2003.12.003_BIB38) 1987
Tung (10.1016/j.isprsjprs.2003.12.003_BIB43) 2000; vol. 1805
Ahuja (10.1016/j.isprsjprs.2003.12.003_BIB2) 1989; 48
Ester (10.1016/j.isprsjprs.2003.12.003_BIB7) 1996
Openshaw (10.1016/j.isprsjprs.2003.12.003_BIB36) 1987; 1
Shekhar (10.1016/j.isprsjprs.2003.12.003_BIB40) 2001; vol. 2121
Veloso (10.1016/j.isprsjprs.2003.12.003_BIB45) 1998; 19
Witten (10.1016/j.isprsjprs.2003.12.003_BIB48) 2000
10.1016/j.isprsjprs.2003.12.003_BIB29
Estivill-Castro (10.1016/j.isprsjprs.2003.12.003_BIB8) 2000; vol. 1886
Openshaw (10.1016/j.isprsjprs.2003.12.003_BIB35) 1999; vol. 1
Hastie (10.1016/j.isprsjprs.2003.12.003_BIB21) 2001
Estivill-Castro (10.1016/j.isprsjprs.2003.12.003_BIB11) 1999; vol. 1574
Estivill-Castro (10.1016/j.isprsjprs.2003.12.003_BIB10) 1998; vol. 1394
Koperski (10.1016/j.isprsjprs.2003.12.003_BIB26) 1995; vol. 951
(10.1016/j.isprsjprs.2003.12.003_BIB30) 2001
Son (10.1016/j.isprsjprs.2003.12.003_BIB41) 1998
Aho (10.1016/j.isprsjprs.2003.12.003_BIB1) 1974
Tsoukatos (10.1016/j.isprsjprs.2003.12.003_BIB42) 2001; vol. 2121
Karypis (10.1016/j.isprsjprs.2003.12.003_BIB23) 1999; 32
Estivill-Castro (10.1016/j.isprsjprs.2003.12.003_BIB12) 2001; vol. 2007
Celeux (10.1016/j.isprsjprs.2003.12.003_BIB4) 1995; 28
10.1016/j.isprsjprs.2003.12.003_BIB37
Wang (10.1016/j.isprsjprs.2003.12.003_BIB47) 1999
Bezdek (10.1016/j.isprsjprs.2003.12.003_BIB3) 1981
Openshaw (10.1016/j.isprsjprs.2003.12.003_BIB34) 1999
References_xml – volume: vol. 1
  start-page: 267
  year: 1999
  end-page: 282
  ident: BIB35
  article-title: Applying geocomputation to the analysis of spatial distributions
  publication-title: Geographical Information Systems: Principles and Technical Issues
– year: 1998
  ident: BIB5
  article-title: Learning from Data—Concept, Theory and Methods
– volume: vol. 1886
  start-page: 424
  year: 2000
  end-page: 434
  ident: BIB8
  article-title: Hybrid genetic algorithms are better for spatial clustering
  publication-title: Proceedings of Sixth Pacific Rim International Conference on Artificial Intelligence PRICAI 2000, Melbourne, Australia
– volume: 4
  start-page: 98
  year: 1973
  end-page: 107
  ident: BIB27
  article-title: A note on Fermat's problem
  publication-title: Mathematical Programming
– volume: vol. 27
  start-page: 73
  year: 1998
  end-page: 84
  ident: BIB20
  article-title: CURE: an efficient clustering algorithm for large databases
  publication-title: Proceedings of ACM SIGMOD International Conference on Management of Data
– volume: 6
  start-page: 303
  year: 2002
  end-page: 360
  ident: BIB19
  article-title: Techniques of Cluster Algorithms in Data Mining
  publication-title: Data Mining and Knowledge Discovery
– volume: 28
  start-page: 781
  year: 1995
  end-page: 793
  ident: BIB4
  article-title: Gaussian parsimonious clustering models
  publication-title: Pattern Recognition
– volume: vol. 1574
  start-page: 327
  year: 1999
  end-page: 337
  ident: BIB11
  article-title: Robust clustering of large geo-referenced data sets
  publication-title: Proceedings of the 3rd Pacific–Asia Conference on Knowledge Discovery and Data Mining (PAKDD-99)
– start-page: 157
  year: 1998
  end-page: 158
  ident: BIB41
  article-title: A spatial data mining method by clustering analysis
  publication-title: Proceedings of the Sixth International Symposium on Advances in Geographical Information Systems ACM-GIS
– volume: 48
  start-page: 304
  year: 1989
  end-page: 356
  ident: BIB2
  article-title: Extraction of early perceptual structure in dot patterns: integrating region, boundary, and component gestalt
  publication-title: Computer Vision, Graphics, and Image Processing
– start-page: 186
  year: 1997
  end-page: 195
  ident: BIB46
  article-title: STING: a statistical information grid approach to spatial data mining
  publication-title: Proceedings of the 23rd International Conference on Very Large Data Bases, Athens, Greece
– start-page: 87
  year: 2001
  end-page: 96
  ident: BIB28
  article-title: Effective and efficient boundary-based clustering for three-dimensional geoinformation studies
  publication-title: Proceedings of the Third International Symposium on Cooperative Database Systems for Advanced Applications CODAS, April 23–24, Beijing, China
– volume: vol. 25 (2)
  start-page: 103
  year: 1996
  end-page: 114
  ident: BIB50
  article-title: BIRCH: an efficient data clustering method for very large databases
  publication-title: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data
– year: 1974
  ident: BIB1
  article-title: The Design and Analysis of Computer Algorithms
– volume: vol. 951
  start-page: 47
  year: 1995
  end-page: 66
  ident: BIB26
  article-title: Discovery of spatial association rules in geographic information databases
  publication-title: Proceedings 4th International Symposium on Advances in Spatial Databases
– year: 2001
  ident: BIB13
  article-title: Data mining techniques for autonomous exploration of large volumes of geo-referenced crime data
  publication-title: Proceedings of the 6th International Conference on Geocomputation
– start-page: 83
  year: 1994
  end-page: 104
  ident: BIB33
  article-title: Two exploratory space–time–attribute pattern analysers relevant to GIS
  publication-title: Spatial Analysis and GIS
– start-page: 144
  year: 1994
  end-page: 155
  ident: BIB32
  article-title: Efficient and effective clustering methods for spatial data mining
  publication-title: Proceedings of the 20th Conference on Very Large Data Bases (VLDB), Santiago, Chile
– volume: 26
  start-page: 315
  year: 2002
  end-page: 334
  ident: BIB14
  article-title: Argument free clustering for large spatial point-data sets
  publication-title: Computers, Environment and Urban Systems
– year: 1981
  ident: BIB3
  article-title: Pattern Recognition with Fuzzy Objective Function Algorithms
– volume: vol. 1262
  start-page: 29
  year: 1997
  end-page: 46
  ident: BIB25
  article-title: Finding boundary shape matching relations in spatial data
  publication-title: Advances in Spatial Databases, 5th International Symposium, SDD-97
– year: 1999
  ident: BIB34
  article-title: Geographical data mining: key design issues
– volume: vol. 382
  start-page: 47
  year: 1989
  end-page: 56
  ident: BIB24
  article-title: The Delaunay triangulation closely approximates the complete graph
  publication-title: Proceedings of the First Workshop on Algorithms and Data Structures WADS-89
– year: 2000
  ident: BIB48
  article-title: Data Mining—Practical Machine Learning Tools and Technologies with JAVA Implementations
– start-page: 226
  year: 1996
  end-page: 231
  ident: BIB7
  article-title: A density-based algorithm for discovering clusters in large spatial databases with noise
  publication-title: Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96)
– volume: vol. 2007
  start-page: 133
  year: 2001
  end-page: 146
  ident: BIB12
  article-title: AUTOCLUST+: automatic clustering of point—data sets in the presence of obstacles
  publication-title: Proceedings of the International Workshop on Temporal, Spatial and Spatio-Temporal Data Mining—TSDM2000, in conjunction with the 4th European Conference on Principles and Practices of Knowledge Discovery and Databases, Lyon, France
– reference: Liotta, G., 1996. Low Degree Algorithm for Computing and Checking Gabriel Graphs. Technical Report 96-28, Department of Computer Science, Brown University.
– reference: Posse, C., 1999. Hierarchical Model-Based Clustering for Large Datasets. Technical Report 363, Department of Statistics, University of Washington.
– volume: 32
  start-page: 68
  year: 1999
  end-page: 75
  ident: BIB23
  article-title: Chameleon: hierarchical clustering using dynamic modeling
  publication-title: IEEE Computer
– volume: vol. 639
  start-page: 220
  year: 1992
  end-page: 235
  ident: BIB18
  article-title: The meaning of Neighbour
  publication-title: Theories and Methods of Spatio-Temporal Reasoning in Geographic Space
– volume: 20
  start-page: 68
  year: 1971
  end-page: 86
  ident: BIB49
  article-title: Graph-theoretical methods for detecting and describing gestalt clusters
  publication-title: IEEE Transactions on Computers
– start-page: 359
  year: 2001
  end-page: 367
  ident: BIB44
  article-title: Spatial clustering in the presence of obstacles
  publication-title: Proceedings of the International Conference on Data Engineering
– start-page: 201
  year: 1997
  end-page: 208
  ident: BIB6
  article-title: Cluster analysis using triangulation
  publication-title: Proceedings of Computational Techniques with Applications CTAC97
– volume: 12
  start-page: 431
  year: 1998
  end-page: 443
  ident: BIB31
  article-title: Cluster discovery techniques for exploratory spatial data analysis
  publication-title: International Journal of Geographical Information Systems
– volume: vol. 1394
  start-page: 110
  year: 1998
  end-page: 121
  ident: BIB10
  article-title: Discovering associations in spatial data—an efficient medoid based approach
  publication-title: Proceedings of the 2nd Pacific–Asia Conference on Knowledge Discovery and Data Mining (PAKDD-98), Melbourne, Australia
– volume: 1
  start-page: 335
  year: 1987
  end-page: 358
  ident: BIB36
  article-title: A Mark 1 geographical analysis machine for the automated analysis of point data sets
  publication-title: International Journal of Geographical Information Systems
– start-page: 116
  year: 1999
  end-page: 125
  ident: BIB47
  article-title: STING+: an approach to active spatial data mining
  publication-title: Proceedings of the Fifteenth International Conference on Data Engineering, Sydney, Australia
– volume: vol. 1805
  start-page: 165
  year: 2000
  end-page: 168
  ident: BIB43
  article-title: COE: clustering with obstacles entities: a preliminary study
  publication-title: Proceedings of the 4th Pacific–Asia conference on Knowledge Discovery and Data Mining, Kyoto, Japan
– volume: vol. 1280
  start-page: 513
  year: 1997
  end-page: 524
  ident: BIB39
  article-title: The BANG-clustering system: grid-based data analysis
  publication-title: Proceedings of the Second International Symposium Intelligent Data Analysis IDA-97
– volume: 4
  start-page: 65
  year: 2002
  end-page: 75
  ident: BIB9
  article-title: Why so many clustering algorithms: a position paper
  publication-title: SIGKDD Explorations
– start-page: 35
  year: 1997
  end-page: 39
  ident: BIB22
  article-title: A spatial data mining method by Delaunay triangulation
  publication-title: Proceedings of the Fifth ACM Workshop on Geographic Information Systems, Las Vegas, Nevada
– volume: 19
  start-page: 61
  year: 1998
  end-page: 69
  ident: BIB45
  article-title: CMUnited-97: RoboCup-97 small-robot world champion team
  publication-title: AI Magazine
– volume: 6
  start-page: 123
  year: 2002
  end-page: 152
  ident: BIB15
  article-title: Multilevel clustering and its visualization for exploratory data analysis
  publication-title: GeoInformatica
– year: 2001
  ident: BIB21
  article-title: The Elements of Statistical Learning: Data Mining, Inference, and Prediction
– year: 2001
  ident: BIB30
  publication-title: Geographic Data Mining and Knowledge Discovery. Research Monographs in Geographic Information Systems
– volume: vol. 2121
  start-page: 425
  year: 2001
  end-page: 442
  ident: BIB42
  article-title: Efficient mining of spatiotemporal patterns
  publication-title: Proceedings of the 7th International Symposium on Spatial and Temporal Databases SSTD-2001, Redondo Beach, CA
– volume: 41
  start-page: 578
  year: 1998
  end-page: 588
  ident: BIB16
  article-title: How many clusters? Which clustering method? Answers via model-based cluster analysis
  publication-title: Computer Journal
– volume: 45
  start-page: 65
  year: 1991
  end-page: 80
  ident: BIB17
  article-title: Problems with handling spatial data—the Voronoi approach
  publication-title: CISM Journal ACSGC
– year: 1987
  ident: BIB38
  article-title: Robust Regression and Outlier Detection
– volume: vol. 2121
  start-page: 236
  year: 2001
  end-page: 256
  ident: BIB40
  article-title: Discovering spatial co-location patterns: a summary of results
  publication-title: Proceedings of the 7th International Symposium on Spatial and Temporal Databases SSTD-2001, Redondo Beach, CA
– start-page: 87
  year: 2001
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB28
  article-title: Effective and efficient boundary-based clustering for three-dimensional geoinformation studies
– volume: 19
  start-page: 61
  issue: 3
  year: 1998
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB45
  article-title: CMUnited-97: RoboCup-97 small-robot world champion team
  publication-title: AI Magazine
– volume: 20
  start-page: 68
  issue: 1
  year: 1971
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB49
  article-title: Graph-theoretical methods for detecting and describing gestalt clusters
  publication-title: IEEE Transactions on Computers
  doi: 10.1109/T-C.1971.223083
– ident: 10.1016/j.isprsjprs.2003.12.003_BIB29
– year: 1974
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB1
– volume: vol. 1394
  start-page: 110
  year: 1998
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB10
  article-title: Discovering associations in spatial data—an efficient medoid based approach
– volume: vol. 2007
  start-page: 133
  year: 2001
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB12
  article-title: AUTOCLUST+: automatic clustering of point—data sets in the presence of obstacles
– volume: 41
  start-page: 578
  issue: 8
  year: 1998
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB16
  article-title: How many clusters? Which clustering method? Answers via model-based cluster analysis
  publication-title: Computer Journal
  doi: 10.1093/comjnl/41.8.578
– volume: 32
  start-page: 68
  issue: 8
  year: 1999
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB23
  article-title: Chameleon: hierarchical clustering using dynamic modeling
  publication-title: IEEE Computer
  doi: 10.1109/2.781637
– volume: 45
  start-page: 65
  issue: 1
  year: 1991
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB17
  article-title: Problems with handling spatial data—the Voronoi approach
  publication-title: CISM Journal ACSGC
  doi: 10.1139/geomat-1991-0005
– volume: vol. 639
  start-page: 220
  year: 1992
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB18
  article-title: The meaning of Neighbour
– year: 2001
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB21
– start-page: 116
  year: 1999
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB47
  article-title: STING+: an approach to active spatial data mining
– year: 1981
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB3
– volume: 28
  start-page: 781
  issue: 5
  year: 1995
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB4
  article-title: Gaussian parsimonious clustering models
  publication-title: Pattern Recognition
  doi: 10.1016/0031-3203(94)00125-6
– volume: 4
  start-page: 65
  issue: 1
  year: 2002
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB9
  article-title: Why so many clustering algorithms: a position paper
  publication-title: SIGKDD Explorations
  doi: 10.1145/568574.568575
– volume: vol. 382
  start-page: 47
  year: 1989
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB24
  article-title: The Delaunay triangulation closely approximates the complete graph
– volume: vol. 2121
  start-page: 425
  year: 2001
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB42
  article-title: Efficient mining of spatiotemporal patterns
– volume: 26
  start-page: 315
  issue: 4
  year: 2002
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB14
  article-title: Argument free clustering for large spatial point-data sets
  publication-title: Computers, Environment and Urban Systems
  doi: 10.1016/S0198-9715(01)00044-8
– start-page: 35
  year: 1997
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB22
  article-title: A spatial data mining method by Delaunay triangulation
– volume: 12
  start-page: 431
  issue: 5
  year: 1998
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB31
  article-title: Cluster discovery techniques for exploratory spatial data analysis
  publication-title: International Journal of Geographical Information Systems
  doi: 10.1080/136588198241734
– start-page: 83
  year: 1994
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB33
  article-title: Two exploratory space–time–attribute pattern analysers relevant to GIS
– volume: vol. 1280
  start-page: 513
  year: 1997
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB39
  article-title: The BANG-clustering system: grid-based data analysis
– start-page: 186
  year: 1997
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB46
  article-title: STING: a statistical information grid approach to spatial data mining
– start-page: 157
  year: 1998
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB41
  article-title: A spatial data mining method by clustering analysis
– volume: 6
  start-page: 123
  issue: 2
  year: 2002
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB15
  article-title: Multilevel clustering and its visualization for exploratory data analysis
  publication-title: GeoInformatica
  doi: 10.1023/A:1015279009755
– volume: 4
  start-page: 98
  issue: 1
  year: 1973
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB27
  article-title: A note on Fermat's problem
  publication-title: Mathematical Programming
  doi: 10.1007/BF01584648
– year: 1987
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB38
– ident: 10.1016/j.isprsjprs.2003.12.003_BIB37
– volume: vol. 25 (2)
  start-page: 103
  year: 1996
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB50
  article-title: BIRCH: an efficient data clustering method for very large databases
– volume: vol. 1886
  start-page: 424
  year: 2000
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB8
  article-title: Hybrid genetic algorithms are better for spatial clustering
– volume: 48
  start-page: 304
  issue: 3
  year: 1989
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB2
  article-title: Extraction of early perceptual structure in dot patterns: integrating region, boundary, and component gestalt
  publication-title: Computer Vision, Graphics, and Image Processing
  doi: 10.1016/0734-189X(89)90146-1
– volume: vol. 1262
  start-page: 29
  year: 1997
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB25
  article-title: Finding boundary shape matching relations in spatial data
– volume: vol. 1574
  start-page: 327
  year: 1999
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB11
  article-title: Robust clustering of large geo-referenced data sets
– year: 2000
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB48
– year: 1999
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB34
  article-title: Geographical data mining: key design issues
– volume: vol. 27
  start-page: 73
  year: 1998
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB20
  article-title: CURE: an efficient clustering algorithm for large databases
– start-page: 359
  year: 2001
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB44
  article-title: Spatial clustering in the presence of obstacles
– volume: 6
  start-page: 303
  issue: 4
  year: 2002
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB19
  article-title: Techniques of Cluster Algorithms in Data Mining
  publication-title: Data Mining and Knowledge Discovery
  doi: 10.1023/A:1016308404627
– year: 1998
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB5
– start-page: 201
  year: 1997
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB6
  article-title: Cluster analysis using triangulation
– year: 2001
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB13
  article-title: Data mining techniques for autonomous exploration of large volumes of geo-referenced crime data
– volume: vol. 2121
  start-page: 236
  year: 2001
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB40
  article-title: Discovering spatial co-location patterns: a summary of results
– year: 2001
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB30
– start-page: 226
  year: 1996
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB7
  article-title: A density-based algorithm for discovering clusters in large spatial databases with noise
– volume: 1
  start-page: 335
  issue: 4
  year: 1987
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB36
  article-title: A Mark 1 geographical analysis machine for the automated analysis of point data sets
  publication-title: International Journal of Geographical Information Systems
  doi: 10.1080/02693798708927821
– start-page: 144
  year: 1994
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB32
  article-title: Efficient and effective clustering methods for spatial data mining
– volume: vol. 951
  start-page: 47
  year: 1995
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB26
  article-title: Discovery of spatial association rules in geographic information databases
– volume: vol. 1805
  start-page: 165
  year: 2000
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB43
  article-title: COE: clustering with obstacles entities: a preliminary study
– volume: vol. 1
  start-page: 267
  year: 1999
  ident: 10.1016/j.isprsjprs.2003.12.003_BIB35
  article-title: Applying geocomputation to the analysis of spatial distributions
SSID ssj0001568
Score 1.8109711
Snippet Clustering algorithms typically use the Euclidean distance. However, spatial proximity is dependent on obstacles, caused by related information in other layers...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 21
SubjectTerms association analysis
clustering
delaunay triangulation
Geographical Data Mining
large spatial databases
Title Clustering with obstacles for Geographical Data Mining
URI https://dx.doi.org/10.1016/j.isprsjprs.2003.12.003
Volume 59
WOSCitedRecordID wos000223116800003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-8235
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001568
  issn: 0924-2716
  databaseCode: AIEXJ
  dateStart: 19950201
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Pb9MwFLZQhwQ7IBggBgPlwG2K5NiJ43Cbqk0UwTSxMfUWOf6hpWRplWTT-O-xY8dNYVLZgUOjKtJL03xfn59fv_ceAB9xKiASKAsxylAYKyZDlkAccgEx5Ygz0qt8L7-mp6d0Ps_OXEK_7ccJpHVN7-6y1X-FWp_TYJvS2QfA7S-qT-j3GnR91LDr4z8BP61uTPMDn2RdFjoANNq3XlHohp5fWX_HOnb4rR8RMQ5SZ-dn38_HPSVWV8uul3Fdy66xDZsaqTGWh63RvztrE5e3ZhhFVYVT1na2guayYqK8Lr0G2Cl_ZvzngpUbOYfYK9588hDFIUptleTgR11n73KjqHFwi6MF1iYv_3LdNouw0Parpl3oV9-stc_VQrxerYZ_6P9YxLy0cFCtLXJ_ITNqE-cRyvu2sDsoTTI6ATtHs-P5F79qR7Zs0n-zDS3gvfd0fyQzik4unoNnblsRHFk6vACPZL0HdkfNJvfAkwH6Xy8BWZMkMCQJPEkCTZJgTJLAkCSwJHkFfpwcX0w_h26CRshxhLtQaYfOUqH3vCnNOEEpZZQIvYMXkRI8YjCThCUooZISznARk4ioAkMhBVeJivBrMKmXtXwDAokV5jHRwUssYljwQqhCIchVhgkjXO4DMjyNnLv28mbKSZVvQWQfQG-4sh1Wtpt8Gh537gJFGwDmmkzbjN8-_PPegafrX8EBmHTNjXwPHvPbrmybD45JvwEKx5HO
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Clustering+with+obstacles+for+Geographical+Data+Mining&rft.jtitle=ISPRS+journal+of+photogrammetry+and+remote+sensing&rft.au=Estivill-Castro%2C+Vladimir&rft.au=Lee%2C+Ickjai&rft.date=2004-08-01&rft.issn=0924-2716&rft.volume=59&rft.issue=1-2&rft.spage=21&rft.epage=34&rft_id=info:doi/10.1016%2Fj.isprsjprs.2003.12.003&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_isprsjprs_2003_12_003
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0924-2716&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0924-2716&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0924-2716&client=summon