Clustering Algorithm of Uncertain Data in Obstacle Space

In recent years, uncertain data is generated widely in location data due to the inaccuracy of measurement instruction or the data attributes itself. The existence of obstacles in space brings the new challenges to spatial uncertain data clustering. This paper proposes OBS-UK-means (obstacle uncertai...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Jisuanji Kexue yu Tansuo / Journal of Computer Science and Frontiers Ročník 6; číslo 12; s. 1087 - 1097
Hlavní autori: Cao, Keyan, Wang, Guoren, Han, Donghong, Yuan, Ye, Hu, Yachao, Qi, Baolei
Médium: Journal Article
Jazyk:Chinese
Vydavateľské údaje: 01.12.2012
Predmet:
Algorithms
Clustering
Clusters
Computational efficiency
Computing time
Obstacles
Pruning
Strategy
ISSN:1673-9418
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract In recent years, uncertain data is generated widely in location data due to the inaccuracy of measurement instruction or the data attributes itself. The existence of obstacles in space brings the new challenges to spatial uncertain data clustering. This paper proposes OBS-UK-means (obstacle uncertain K-means) algorithm to cluster uncertain data in obstacle space, and also proposes two pruning strategies based on R-tree and Voronoi diagram and the shortest distance area concept, that greatly reduces the calculations. Finally, the experiment demonstrates that the efficiency and accuracy of the OBS-UK-means algorithm, and the pruning approach can improve the efficiency of the clustering algorithm, meanwhile, it doesn't damage the cluster effectiveness.
AbstractList In recent years, uncertain data is generated widely in location data due to the inaccuracy of measurement instruction or the data attributes itself. The existence of obstacles in space brings the new challenges to spatial uncertain data clustering. This paper proposes OBS-UK-means (obstacle uncertain K-means) algorithm to cluster uncertain data in obstacle space, and also proposes two pruning strategies based on R-tree and Voronoi diagram and the shortest distance area concept, that greatly reduces the calculations. Finally, the experiment demonstrates that the efficiency and accuracy of the OBS-UK-means algorithm, and the pruning approach can improve the efficiency of the clustering algorithm, meanwhile, it doesn't damage the cluster effectiveness.
Author Cao, Keyan
Qi, Baolei
Hu, Yachao
Yuan, Ye
Han, Donghong
Wang, Guoren
Author_xml – sequence: 1
  givenname: Keyan
  surname: Cao
  fullname: Cao, Keyan
– sequence: 2
  givenname: Guoren
  surname: Wang
  fullname: Wang, Guoren
– sequence: 3
  givenname: Donghong
  surname: Han
  fullname: Han, Donghong
– sequence: 4
  givenname: Ye
  surname: Yuan
  fullname: Yuan, Ye
– sequence: 5
  givenname: Yachao
  surname: Hu
  fullname: Hu, Yachao
– sequence: 6
  givenname: Baolei
  surname: Qi
  fullname: Qi, Baolei
BookMark eNqFjL1qwzAURjWk0DTNO3jo0MWuriRLumNwf1IIZGg6B9m-Sl0c2bXk92-gpWvhwIHDx3fDFmEIxNgd8EIaYx8-iy7GUIA2MkcFthAcRHGBc7lgy79-zdYxdjUvlRJgtF0yW_VzTDR14ZRt-tMwdenjnA0-ew8NTcl1IXt0yWUX7-uYXNNT9ja6hm7ZlXd9pPWvV-zw_HSotvlu__JabXb5qLXJZW0BW0RhHGq06JUQrROtcqL2JNBrb40BdEq1XIJARWgllkY6RVRyuWL3P7fjNHzNFNPx3MWG-t4FGuZ4BMOBG11K8_9UQqkRoQT5DR3DWl0
ContentType Journal Article
DBID 7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.3778/j.issn.1673-9418.2012.12.003
DatabaseName Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
EndPage 1097
GroupedDBID 7SC
8FD
ALMA_UNASSIGNED_HOLDINGS
JQ2
L7M
L~C
L~D
M~E
ID FETCH-LOGICAL-p667-3b819d9927a96989f422da2d4a2bfe29f6f87719a44d031294e9839573a4ee503
ISSN 1673-9418
IngestDate Thu Jul 10 18:00:58 EDT 2025
Thu Oct 02 05:56:24 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 12
Language Chinese
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-p667-3b819d9927a96989f422da2d4a2bfe29f6f87719a44d031294e9839573a4ee503
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
PQID 1315699151
PQPubID 23500
PageCount 11
ParticipantIDs proquest_miscellaneous_1701076537
proquest_miscellaneous_1315699151
PublicationCentury 2000
PublicationDate 20121201
PublicationDateYYYYMMDD 2012-12-01
PublicationDate_xml – month: 12
  year: 2012
  text: 20121201
  day: 01
PublicationDecade 2010
PublicationTitle Jisuanji Kexue yu Tansuo / Journal of Computer Science and Frontiers
PublicationYear 2012
SSID ssib054421768
ssib002040941
ssib002423894
ssib051375751
ssib023646573
ssib036438069
ssib002040926
Score 1.9156779
Snippet In recent years, uncertain data is generated widely in location data due to the inaccuracy of measurement instruction or the data attributes itself. The...
SourceID proquest
SourceType Aggregation Database
StartPage 1087
SubjectTerms Algorithms
Clustering
Clusters
Computational efficiency
Computing time
Obstacles
Pruning
Strategy
Title Clustering Algorithm of Uncertain Data in Obstacle Space
URI https://www.proquest.com/docview/1315699151
https://www.proquest.com/docview/1701076537
Volume 6
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  issn: 1673-9418
  databaseCode: M~E
  dateStart: 20070101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://road.issn.org
  omitProxy: false
  ssIdentifier: ssib054421768
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Nb9MwFLfKQGgXBALEBkyZNHGpAontxPERdS2TVjoOmSinykmctagkZW2mjgNn_mzeS5yPgTSNA5e0tqJEzvvp9z7tR8gREBwTMnVsHnNwUKI4slWshJ34KvZSFrG4Omd2LCaTYDqVn3q9X_VemKulyLJgu5Wr_ypqmANh49bZfxB381CYgP8gdLiC2OF6J8EPlgUeflCGO5YXOTj_829oEp6DeMv0P0h6ozDOcRaBaRhjMSE4zjdLghbrQmVfF_1TvS10_7roh6DSiryPh5x3bNi6J0RDERiGH-GZCAvdpokGKq-2AF23UPxs4tQfiryzG-2kCsce59nFPDc6tewaVs1_0d0ghUs7BR8Vr_qC2ZIbqjXE63fxRTss6jpGCWszrEp4_2R7JkRQsj2-4m3zCqzXo2WM12Gtlqsz-5Oz2eh8PJ6Fw2n4ZvXdxv5jmKc3zVjukftUeBKLAz_-HLaGDHCd7DpiOOY3dgSD5dcwG57K73utYQhDFjh-Yzh6LhOY8GrGnINrWO3brJfxkByZNb67bYV_2RClYRQ-Jo8MGqz3FRKfkN6P-VMStCi0GhRaeWo1KLQQhRb81ii0ShQ-I-FoGA5ObNOkw175oGNZBCZlIiUVSmIv0pRTmiiacEWjVFOZ-mkghCsV5wnoDyq5lgHmhpniWnsOe052sjzTL4gFnwy1i6cVPEWxQGmWgv_sasGAMxjdI4f1SmfAgZjYUpnOi_XMZa7ng6PjubfcIxzXEb7HxP4d7nlJdlsYvyI7m8tCvyYP4qvNYn15UGLjN-lVfJQ
linkProvider ISSN International Centre
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+Algorithm+of+Uncertain+Data+in+Obstacle+Space&rft.jtitle=Jisuanji+Kexue+yu+Tansuo+%2F+Journal+of+Computer+Science+and+Frontiers&rft.au=Cao%2C+Keyan&rft.au=Wang%2C+Guoren&rft.au=Han%2C+Donghong&rft.au=Yuan%2C+Ye&rft.date=2012-12-01&rft.issn=1673-9418&rft.volume=6&rft.issue=12&rft.spage=1087&rft.epage=1097&rft_id=info:doi/10.3778%2Fj.issn.1673-9418.2012.12.003&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1673-9418&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1673-9418&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1673-9418&client=summon