文件名称:3
下载
别用迅雷、360浏览器下载。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
介绍说明－－下载内容均来自于网络，请自行研究使用
聚类金字塔树-一种新的高维空间数据索引方法
提出了一种新的有效的高维空间数据索引方法 聚类金字塔树.它先对不均匀分布数据进行聚类 处理,然后对聚类的结果实施金字塔分割和存储,由此建立一种有效的索引结构.文中给出了聚类金字塔树的几种查询算法.实验证明:处理不均匀分布数据时,聚 类金字塔树无论在页面访问次数,还是在CPU总占用时间上都优于金字塔树.
-Pyramid Tree Cluster- A new high-dimensional data indexing method presents a new and effective method for high dimensional spatial data indexing- Pyramid clustering tree it first on the uneven distribution of data clustering, and then results clustering implementation pyramid segmentation and storage, thereby establishing an effective index structure paper presents several query clustering algorithm pyramid tree proved: when dealing with the uneven distribution of data, both in the clustering tree pyramid page visits, or in the total of occupied CPU time is better than the pyramid tree.
提出了一种新的有效的高维空间数据索引方法 聚类金字塔树.它先对不均匀分布数据进行聚类 处理,然后对聚类的结果实施金字塔分割和存储,由此建立一种有效的索引结构.文中给出了聚类金字塔树的几种查询算法.实验证明:处理不均匀分布数据时,聚 类金字塔树无论在页面访问次数,还是在CPU总占用时间上都优于金字塔树.
-Pyramid Tree Cluster- A new high-dimensional data indexing method presents a new and effective method for high dimensional spatial data indexing- Pyramid clustering tree it first on the uneven distribution of data clustering, and then results clustering implementation pyramid segmentation and storage, thereby establishing an effective index structure paper presents several query clustering algorithm pyramid tree proved: when dealing with the uneven distribution of data, both in the clustering tree pyramid page visits, or in the total of occupied CPU time is better than the pyramid tree.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
鑱氱被閲戝瓧濉旀爲-涓