Grid-Based Hierarchical Spatial Clustering Algorithm in Presence of Obstacle and Constraints

Clustering of spatial data in the presence of obstacles and constraints has the very strong practical value, and becomes to an important research issue. Most of the existing spatial clustering algorithm in presence of obstacles and constraints can't cluster with irregular obstacles and the vera...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International Conference on Internet Computing for Science and Engineering s. 383 - 388
Hlavní autoři: Yue Yang, Jian-pei Zhang, Jing Yang
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.01.2008
Témata:
Clustering algorithms
Costs
Data engineering
Data mining
Educational institutions
Graphics
grid
Grid computing
hierarchical
Internet
obstacles
Partitioning algorithms
Shape
spatial clustering
ISSN:2330-9857
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Clustering of spatial data in the presence of obstacles and constraints has the very strong practical value, and becomes to an important research issue. Most of the existing spatial clustering algorithm in presence of obstacles and constraints can't cluster with irregular obstacles and the veracity of clustering result is affected. The algorithm complexity is affected by complexity of computing obstacle-distance. Grid-based hierarchical spatial clustering algorithm which is abbreviated as GSHCOC is proposed. The advantage of grid-based clustering algorithm is inherited. The obstacle-grid is defined and the algorithm processes arbitrary shape obstacle and finds arbitrary shape clusters efficiently. Meanwhile, the hierarchical strategy is used to reduce the complexity of clustering in presence of obstacles and constraints and the operation efficiency of algorithm is improved. The results of experiment show that GSHCOC algorithm can process spatial clustering in presence of obstacles and constraints and has higher clustering quality and better performance.
AbstractList Clustering of spatial data in the presence of obstacles and constraints has the very strong practical value, and becomes to an important research issue. Most of the existing spatial clustering algorithm in presence of obstacles and constraints can't cluster with irregular obstacles and the veracity of clustering result is affected. The algorithm complexity is affected by complexity of computing obstacle-distance. Grid-based hierarchical spatial clustering algorithm which is abbreviated as GSHCOC is proposed. The advantage of grid-based clustering algorithm is inherited. The obstacle-grid is defined and the algorithm processes arbitrary shape obstacle and finds arbitrary shape clusters efficiently. Meanwhile, the hierarchical strategy is used to reduce the complexity of clustering in presence of obstacles and constraints and the operation efficiency of algorithm is improved. The results of experiment show that GSHCOC algorithm can process spatial clustering in presence of obstacles and constraints and has higher clustering quality and better performance.
Author Yue Yang
Jing Yang
Jian-pei Zhang
Author_xml – sequence: 1
  surname: Yue Yang
  fullname: Yue Yang
  organization: Coll. of Comput. Sci. & Technol., Harbin Eng. Univ., Harbin
– sequence: 2
  surname: Jian-pei Zhang
  fullname: Jian-pei Zhang
  organization: Coll. of Comput. Sci. & Technol., Harbin Eng. Univ., Harbin
– sequence: 3
  surname: Jing Yang
  fullname: Jing Yang
  organization: Coll. of Comput. Sci. & Technol., Harbin Eng. Univ., Harbin
BookMark eNotjEFrwjAYQDNQmDqvu-ySP1D3JU3a5OiKU0FwoMeBJOlXzaipJNlh_37CdnrweLwpGYUhICHPDBaMgX7dNtvmsFpwALVg6oHMda2grrQsGeMwIhNellBoJesxmd6rWgumOX8k85S-AOCuGJN8Qj7X0bfFm0nY0o3HaKK7eGd6eriZ7O9s-u-UMfpwpsv-PESfL1fqA_2ImDA4pENH9zZl43qkJrS0GULK0fiQ0xMZd6ZPOP_njBzfV8dmU-z2622z3BVeQy6UEwJtV3EumLOgrXGstqZEU3VMChBgpKwAO2slMxVW1lrnjFUKrBW8LWfk5W_rEfF0i_5q4s9JSKG4rspfShFYXg
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICICSE.2008.18
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9780769531120
0769531121
EndPage 388
ExternalDocumentID 4548296
Genre orig-research
GroupedDBID 6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
OCL
RIE
RIL
ID FETCH-LOGICAL-i90t-8c44ebf62241cb09bac17ba3ea6f154040a5560efbb51a6e6bbbccab880bb42d3
IEDL.DBID RIE
ISSN 2330-9857
IngestDate Wed Aug 27 02:14:08 EDT 2025
IsPeerReviewed false
IsScholarly false
LCCN 2007941922
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-8c44ebf62241cb09bac17ba3ea6f154040a5560efbb51a6e6bbbccab880bb42d3
PageCount 6
ParticipantIDs ieee_primary_4548296
PublicationCentury 2000
PublicationDate 2008-Jan.
PublicationDateYYYYMMDD 2008-01-01
PublicationDate_xml – month: 01
  year: 2008
  text: 2008-Jan.
PublicationDecade 2000
PublicationTitle International Conference on Internet Computing for Science and Engineering
PublicationTitleAbbrev ICICSE
PublicationYear 2008
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0002001152
ssib015831539
Score 1.3907535
Snippet Clustering of spatial data in the presence of obstacles and constraints has the very strong practical value, and becomes to an important research issue. Most...
SourceID ieee
SourceType Publisher
StartPage 383
SubjectTerms Clustering algorithms
Costs
Data engineering
Data mining
Educational institutions
Graphics
grid
Grid computing
hierarchical
Internet
obstacles
Partitioning algorithms
Shape
spatial clustering
Title Grid-Based Hierarchical Spatial Clustering Algorithm in Presence of Obstacle and Constraints
URI https://ieeexplore.ieee.org/document/4548296
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwELVKxcBUoEV8ywMjpvlyEo8QtbQSKpXo0AGp8sUORCoJalN-P2cnLQwsbJGHJPLd6Z7P9-4RcqM5BzwlSOZESrFAOzGTeAxjWZwqnQrO_czOmX2KJpN4PhfTFrndcWG01rb5TN-ZR3uXr8p0Y0pl_QDhtSfCPbIXRWHN1dr6jstjH4NX7OorngU7ntWW8x0mYh41MxtdR_THyTh5GdStlEbv45eyik0sw87_fumQ9H4YenS6yz1HpKWLY9LZSjTQJmK75PVxlSv2gKlK0VFuyMZW-2RJjRQxuh5NlhszKgFfQu-Xb-Uqr94_aF7QqaUl4VfKjD4DQkh0LyoLRY3Cp9WVqNY9MhsOZsmINYIKLBdOxeI0CDRkocnaKTgCZOpGIH0twwyRFIaz5AiAdAbAXRnqEADQwIAhDhB4yj8h7aIs9KlpiHIlFwLCCC0rfQkq1K70M4kQwIgZn5Gu2avFZz0yY9Fs0_nfyxfkoG7DMJWNS9KuVht9RfbTrypfr66tnb8B1AKoMA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwELVKQYKpQIv4xgMjpvlyEo8QtbSilEp06IBU2bEDkUqC0pTfz9lJCwMLW-QhiXx3uufzvXsIXStKBZwSOLECKYmnrJBwOIaRJIylihmlbmLmzI6C8TiczdikgW42XBillGk-U7f60dzlyzxe6VJZ1wN47TB_C21Tz3Osiq219h6bhi6EL9tUWBwDdxyjLudahIU0qKc22hbrDqNh9NKrmim14scvbRWTWvqt__3UPur8cPTwZJN9DlBDZYeotRZpwHXMttHrQ5FKcg_JSuJBqunGRv1kgbUYMTgfjhYrPSwBXoLvFm95kZbvHzjN8MQQk-AreYKfBYBIcDDMM4m1xqdRliiXHTTt96bRgNSSCiRlVknC2POUSHydt2NhMcFjOxDcVdxPAEtBQHMKEEglQlCb-8oXQoCJBQS5EJ4j3SPUzPJMHeuWKJtTxoQfgG25y4X0lc3dhAMI0HLGJ6it92r-WQ3NmNfbdPr38hXaHUyfRvPRcPx4hvaqpgxd5zhHzbJYqQu0E3-V6bK4NDb_BsLfq3c
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%3Abook&rft.genre=proceeding&rft.title=International+Conference+on+Internet+Computing+for+Science+and+Engineering&rft.atitle=Grid-Based+Hierarchical+Spatial+Clustering+Algorithm+in+Presence+of+Obstacle+and+Constraints&rft.au=Yue+Yang&rft.au=Jian-pei+Zhang&rft.au=Jing+Yang&rft.date=2008-01-01&rft.pub=IEEE&rft.issn=2330-9857&rft.spage=383&rft.epage=388&rft_id=info:doi/10.1109%2FICICSE.2008.18&rft.externalDocID=4548296
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2330-9857&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2330-9857&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2330-9857&client=summon