没有合适的资源?快使用搜索试试~ 我知道了~
首页ball tree and kd tree.pdf
资源详情
资源评论
资源推荐
Performance Evaluation: Ball-Tree and KD-Tree in the
context of MST
Hazarath Munaga
1,1
, Venkata Jarugumalli
1
1
Dept. of Information Technology
University College of Engineering
JNTUK, A.P. India
{hazarath.munaga, venkata.jarugumalli}@gmail.com
Abstract. Now a day’s many algorithms are invented / being inventing to find
the solution for Euclidean Minimum Spanning Tree (EMST) problem, as its
applicability is increasing in much wide range of fields containing spatial /
spatio – temporal data viz. astronomy which consists of millions of spatial data.
To solve this problem, we are presenting a technique by adopting the dual tree
algorithm for finding efficient EMST and experimented on a variety of real
time and synthetic datasets. This paper presents the observed experimental
observations and the efficiency of the dual tree framework, in the context of kd-
tree and ball-tree on spatial datasets of different dimensions.
Keywords: Euclidean Minimum Spanning Tree (EMST), dual Tree, kd-tree,
ball-tree
1 Introduction
Minimum Spanning Tree (hereinafter, MST) is the one of the oldest and most
thoroughly studied problem in computational geometry [1]. The Minimum-weight
Spanning Tree or simply MST problem is one of the well-known optimization
problems for finding minimum weighted spanning tree for both undirected and
directed graphs. MST have many applications in computer design, communication,
transportation and some other problems that can apply directly/indirectly are wireless
network connectivity, clustering and classification of different data namely spatial
data. In literature, several authors proposed a variety of greedy algorithms [2, 3, 4].
The general drawback with these greedy algorithms is that these cannot handle large
amount of data and performance bottleneck will happened and later some more
advanced algorithms are developed to solve this problem [5]. In this paper, authors
evaluated the performance of dual tree algorithmic framework [6] using single linkage
clustering [7] and compared the performance of the dual tree framework in the
context of kd-tree and ball-tree. As per the Ref. [8] theoretically single-linkage
clustering provides optimal clusters.
1
Dr MHM Krishna Prasad, Associate Professor & Head
minuxAE
- 粉丝: 1w+
- 资源: 479
上传资源 快速赚钱
- 我的内容管理 收起
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
会员权益专享
最新资源
- c++校园超市商品信息管理系统课程设计说明书(含源代码) (2).pdf
- 建筑供配电系统相关课件.pptx
- 企业管理规章制度及管理模式.doc
- vb打开摄像头.doc
- 云计算-可信计算中认证协议改进方案.pdf
- [详细完整版]单片机编程4.ppt
- c语言常用算法.pdf
- c++经典程序代码大全.pdf
- 单片机数字时钟资料.doc
- 11项目管理前沿1.0.pptx
- 基于ssm的“魅力”繁峙宣传网站的设计与实现论文.doc
- 智慧交通综合解决方案.pptx
- 建筑防潮设计-PowerPointPresentati.pptx
- SPC统计过程控制程序.pptx
- SPC统计方法基础知识.pptx
- MW全能培训汽轮机调节保安系统PPT教学课件.pptx
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功
评论0