期刊文献+

一种面向空间对象群的聚类算法 被引量:2

A Clustering Algorithm for Spatial Object Groups
下载PDF
导出
摘要 将空间对象按一定的空间关系分组,构成空间对象群,每个空间对象群包含类型多样、数量不等的空间对象。提出一种空间对象群的相异度计算方法,并提出空间对象群聚类算法SOGC。它将类型多样的空间数据集分层表示,计算空间对象群中对象在不同层上属性分布的隶属度,以此计算空间对象群的相异度。与一般的聚类算法不同,SOGC考虑了空间数据的复杂性和数据之间的联系。实验结果表明算法SOGC是有效的,对地理空间数据分析具有实用价值。 There are spatial relationship between objects in the spatial database. The objects are divided into several groups by spatial relationship, which are named spatial object groups. There are numerous objects and many spatial data types in every spatial object group. The clustering algorithm for spatial ob- ject groups has seldom been studied. A computing method of dissimilarity between spatial object groups is proposed and a algorithm(named SOGC) is presented for clustering spatial object groups. The spatial objects are partitioned into layer by their types. The subjection of attribute distribution of the objects in spatial object groups is computed and the dissimilarity between spatial object groups is calculated based on the subjection. Algorithm SOGC takes variety data types and spatial relationships between spatial objects into full account, so it is different from the other clustering algorithms. The experimental results show that algorithm SOGC is effective for spatial data analysis.
出处 《广西师范大学学报(自然科学版)》 CAS 北大核心 2009年第3期109-112,共4页 Journal of Guangxi Normal University:Natural Science Edition
基金 国家自然科学基金资助项目(40771163 40871176)
关键词 空间对象群 空间关系 聚类 spatial object groups ~spatial relationship clustering
  • 相关文献

参考文献10

  • 1NG R T,HAN J.CLARANS:a method for clustering objects for spatial data mining[J].IEEE Transactions on Knowledge and Data Engineering,2002,5 (14):1003-1016.
  • 2ESTER M,KRIEGEL H P.A density-based algorithm for discovering clustering in large spatial databases with noise[C]//Proceeding of 2nd KDD.Piscataway:IEEE Press,1996:226-231.
  • 3佟兆廷,张果,许辉熙.我国城市人力资本投资类型及空间分布研究[J].四川师范大学学报(自然科学版),2005,28(3):354-357. 被引量:3
  • 4SANDER J,ESTER M,KRIEGEL H P.Density-based clustering in spatial databases:the algorithm GDBSCAN and its applications[J].Data Mining and Knowledge Discovery,1998,2(6):169-194.
  • 5WANG Xin,HAMILTON H J.DBRS:a density-based spatial clustering method with random sampling[C]//Advances in Knowledge Discovery and Data Mining.7th Pacific-Asia Conference,PAKDD 2003.Heidelberg:SpringerVerlag,2003:563-575.
  • 6HU Cai-ping,QIN Xiao-lin.A novel spatial cluster algorithm with sampling[C]//TORRA V,NARUKAWA Y,YOSHIDA Y.MDAI 2007,LNAI 4617.Berlin Heidelberg:Springer Verlag,200?:216-225.
  • 7GRUVER O U.GRIDBSCAN:GRId density-based spatial clustering of applications with noise[J].Systems,Man and Cybernetics,2006,4 (8):2976-2981.
  • 8LIU Xi-yu,LIU Hong.Topological cluster:a generalized view for density-based spatial clustering[C]//Proceeding of the Computer Supported Cooperative Work in Design.Piseataway:IEEE Press,2007:7-12.
  • 9WANG Xin,ROSTOKER C,HAMILTON H J.Density-based spatial clustering in the presence of obstacles and facilitators[C]//Proceeding of the PKDD 2004.Heidelberg:Springer-Verlag,2004:446-458.
  • 10罗天祥.全国1 266块森林样地主要森林类型数据集[EB/OL].(2008-11-19).http://www.cern.ac.cn.

二级参考文献2

共引文献2

同被引文献14

  • 1钟一文,杨建刚,宁正元.求解TSP问题的离散粒子群优化算法[J].系统工程理论与实践,2006,26(6):88-94. 被引量:48
  • 2Kennedy J,Eberhart R.Particle swarm optimization[EB/OL].[2010-01-17].http:∥www.buffalo.edu/-zxue/Evacuation/Other_models/pso.pdf.
  • 3Hu Xiao-hui,Shi Yu-hui,Eberhart R C.Recent advances in particle swarm[EB/OL].[2010-01-20].http:∥www.swarmintelligence.org/papers/CEC2004Recent.pdf.
  • 4Kennedy J,Eberhart R.A discrete binary version of the particle swarm algorithm[EB/OL].[2010-01-25].http:∥www.ee.ac.za/main/_medialen/undergrad/subjects/ees421/kennedybinaryparticleswarmgetpdf.pdf.
  • 5Tasgetiren M F,Liang Y C,Sevkli M,et al.A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem[J].Journal of Operational Research,2007,177:1930-1947.
  • 6Tasgetiren M F,Sevkli M,Liang Y C,et al.Particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem[EQ/OL].[2010-02-05].http:∥linkinghub.elsever.com/retrieve/pii/s0377221705008453.
  • 7Cagnina L,Esquivel S,Gallard R.Particle swarm optimization for sequencing problems:a case study[EQ/OL].[2010-01-28].http:∥cat.inist.fr/?aModele=affichen&cpsidt=17479920.
  • 8Yang Shu-yuan,Wang Min.A quantum particle swarm optimization[EB/OL].[2010-02-05].http:∥web.cecs.pdx.edu/-mperkows/CLASS_573/Asynchr_Febr_2007/01330874.pdf.
  • 9Clerc M.Discrete particle swarm optimization-illustrated by the traveling salesman problem[EB/OL].[2010-02-07].http://www.mauriceclerc.net.
  • 10Gerhard Reinelt.TSPLIB[EB/OL].[2010-02-16].http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/.

引证文献2

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部