birch_1.1-2 (1).tar.gz

  • mannunigam
    了解作者
  • R language
    开发工具
  • 752KB
    文件大小
  • gz
    文件格式
  • 0
    收藏次数
  • 1 积分
    下载积分
  • 0
    下载次数
  • 2020-12-29 06:11
    上传日期
Birch package version 1.1.2 of R, which is not included in latest R
birch_1.1-2 (1).tar.gz
  • birch
  • src
  • ll_LeafNode.cc
    5.5KB
  • ll_other.cc
    552B
  • ll.h
    6.8KB
  • ll_Node.cc
    8.1KB
  • ll_Leaf.cc
    3KB
  • ll.cc
    4.8KB
  • inst
  • doc
  • birchAPI.pdf
    39.9KB
  • R
  • birch.R
    5.9KB
  • covMcdBirch.R
    3.4KB
  • cluster.R
    3.2KB
  • ltsBirch.R
    5.1KB
  • genericmethods.R
    6KB
  • rlgaBirch.R
    4KB
  • data
  • birchObj.rda
    702.9KB
  • man
  • birchObj.Rd
    2KB
  • birch-package.Rd
    2.4KB
  • kmeans.birch.Rd
    3KB
  • birch.Rd
    5.9KB
  • rlga.birch.Rd
    3.7KB
  • covMcd.birch.Rd
    3.7KB
  • lts.birch.Rd
    4KB
  • generic.Rd
    4.1KB
  • dist.birch.Rd
    2.1KB
  • NAMESPACE
    614B
  • DESCRIPTION
    316B
内容介绍
<html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta charset="utf-8"> <meta name="generator" content="pdf2htmlEX"> <meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"> <link rel="stylesheet" href="https://static.pudn.com/base/css/base.min.css"> <link rel="stylesheet" href="https://static.pudn.com/base/css/fancy.min.css"> <link rel="stylesheet" href="https://static.pudn.com/prod/directory_preview_static/6253cec174bc5c01050f0663/raw.css"> <script src="https://static.pudn.com/base/js/compatibility.min.js"></script> <script src="https://static.pudn.com/base/js/pdf2htmlEX.min.js"></script> <script> try{ pdf2htmlEX.defaultViewer = new pdf2htmlEX.Viewer({}); }catch(e){} </script> <title></title> </head> <body> <div id="sidebar" style="display: none"> <div id="outline"> </div> </div> <div id="pf1" class="pf w0 h0" data-page-no="1"><div class="pc pc1 w0 h0"><img class="bi x0 y0 w1 h1" alt="" src="https://static.pudn.com/prod/directory_preview_static/6253cec174bc5c01050f0663/bg1.jpg"><div class="t m0 x1 h2 y1 ff1 fs0 fc0 sc0 ls0 ws0">The BIRCH <span class="_ _0"></span>API &#8211; <span class="_ _0"></span>An interface between R and C</div><div class="t m0 x1 h3 y2 ff2 fs1 fc0 sc0 ls0 ws0">In this document we briefly document the B<span class="_ _1"></span>IRCH <span class="_ _0"></span>API interfa<span class="_ _0"></span>c<span class="_ _1"></span>e for programmers who wish to further </div><div class="t m0 x1 h3 y3 ff2 fs1 fc0 sc0 ls0 ws0">develop this package and its capabilities. </div><div class="t m0 x1 h4 y4 ff2 fs1 fc0 sc0 ls0 ws0">The perspective here is from within R, and we documen<span class="_ _1"></span>t the <span class="ff3">.Call</span> functions used and the values </div><div class="t m0 x1 h3 y5 ff2 fs1 fc0 sc0 ls0 ws0">returned. If a more in-depth look is required, then the re<span class="_ _1"></span>ader is encouraged to look at the source files, </div><div class="t m0 x1 h3 y6 ff2 fs1 fc0 sc0 ls0 ws0">which are well documented. The source files also have dOxygen tags incorporated for the class </div><div class="t m0 x1 h3 y7 ff2 fs1 fc0 sc0 ls0 ws0">descriptions, which may be of use as a quick overview<span class="_ _0"></span>. </div><div class="t m0 x1 h5 y8 ff4 fs2 fc0 sc0 ls0 ws0">LL_main</div><div class="t m0 x1 h6 y9 ff1 fs3 fc0 sc0 ls0 ws0">Syntax:</div><div class="t m0 x2 h4 ya ff3 fs1 fc0 sc0 ls0 ws0">.Call("LL_main", x, radius, compact, keeptree)</div><div class="t m0 x1 h6 yb ff1 fs3 fc0 sc0 ls0 ws0">Arguments:</div><div class="t m0 x3 h4 yc ff5 fs4 fc0 sc0 ls0 ws0">&#9679;<span class="_ _2"> </span><span class="ff3 fs1">x<span class="ff2">: a matrix of data of type double</span></span></div><div class="t m0 x3 h4 yd ff5 fs4 fc0 sc0 ls0 ws0">&#9679;<span class="_ _2"> </span><span class="ff3 fs1">radius<span class="ff2">: a scalar of type double</span></span></div><div class="t m0 x3 h4 ye ff5 fs4 fc0 sc0 ls0 ws0">&#9679;<span class="_ _2"> </span><span class="ff3 fs1">compact<span class="ff2">: a scalar of type double</span></span></div><div class="t m0 x3 h4 yf ff5 fs4 fc0 sc0 ls0 ws0">&#9679;<span class="_ _2"> </span><span class="ff3 fs1">keeptree<span class="ff2">: an integer either 0 or 1</span></span></div><div class="t m0 x1 h6 y10 ff1 fs3 fc0 sc0 ls0 ws0">Returns:</div><div class="t m0 x1 h3 y11 ff2 fs1 fc0 sc0 ls0 ws0">A<span class="_ _0"></span> pointer to the parent node</div><div class="t m0 x1 h6 y12 ff1 fs3 fc0 sc0 ls0 ws0">Example:</div><div class="t m0 x1 h4 y13 ff3 fs1 fc0 sc0 ls0 ws0">.Call("LL_main", matrix(as.double(x), ncol = ncol(x)),</div><div class="t m0 x1 h4 y14 ff3 fs1 fc0 sc0 ls0 ws0"> as.double(radius), as.double(compact), </div><div class="t m0 x4 h4 y15 ff3 fs1 fc0 sc0 ls0 ws0"> as.integer(1))</div><div class="t m0 x1 h6 y16 ff1 fs3 fc0 sc0 ls0 ws0">Description:</div><div class="t m0 x1 h3 y17 ff2 fs1 fc0 sc0 ls0 ws0">This function passes a matrix to the C co<span class="_ _1"></span>de, along with specification of the radius and compactness </div><div class="t m0 x1 h4 y18 ff2 fs1 fc0 sc0 ls0 ws0">criteria, for building the tree from nothing. The <span class="ff3">keeptree</span> arg<span class="_ _0"></span>ume<span class="_ _1"></span>nt (effectively a Boolean) tells the </div><div class="t m0 x1 h3 y19 ff2 fs1 fc0 sc0 ls0 ws0">C code whether or not to stay resident in memory<span class="_ _0"></span>. </div><div class="t m0 x1 h5 y1a ff4 fs2 fc0 sc0 ls0 ws0">LL_getdata</div><div class="t m0 x1 h6 y1b ff1 fs3 fc0 sc0 ls0 ws0">Syntax:</div><div class="t m0 x5 h4 y1c ff3 fs1 fc0 sc0 ls0 ws0">.Call("LL_getdata", pointer)</div><div class="t m0 x1 h6 y1d ff1 fs3 fc0 sc0 ls0 ws0">Arguments:</div><div class="t m0 x3 h4 y1e ff5 fs4 fc0 sc0 ls0 ws0">&#9679;<span class="_ _2"> </span><span class="ff3 fs1">pointer<span class="ff2">: a pointer</span></span></div><div class="t m0 x1 h6 y1f ff1 fs3 fc0 sc0 ls0 ws0">Returns:</div><div class="t m0 x1 h3 y20 ff2 fs1 fc0 sc0 ls0 ws0">A<span class="_ _0"></span> list containing (they are not named, so order is important)</div><div class="t m0 x3 h3 y21 ff5 fs4 fc0 sc0 ls0 ws0">&#9679;<span class="_ _2"> </span><span class="ff2 fs1">[[1]]: a vector with the number of observations in each subc<span class="_ _1"></span>luster</span></div><div class="t m0 x3 h3 y22 ff5 fs4 fc0 sc0 ls0 ws0">&#9679;<span class="_ _2"> </span><span class="ff2 fs1">[[2]]: a matrix of the sumXi values for each subclu<span class="_ _1"></span>ster</span></div><div class="t m0 x3 h3 y23 ff5 fs4 fc0 sc0 ls0 ws0">&#9679;<span class="_ _2"> </span><span class="ff2 fs1">[[3]]: an array of the sumXisq values for each subcluster</span></div><div class="t m0 x3 h3 y24 ff5 fs4 fc0 sc0 ls0 ws0">&#9679;<span class="_ _2"> </span><span class="ff2 fs1">[[4]]: a list, each member of which contains<span class="_ _1"></span> an index of the observations in that subcluster</span></div></div><div class="pi" data-data='{"ctm":[1.568627,0.000000,0.000000,1.568627,0.000000,0.000000]}'></div></div> </body> </html>
评论
    相关推荐
    • BIRCH.rar
      使用MATLAB语言,基于B-TREE树实现了层次聚类算法,并且进行了绘图输出。
    • BIRCH.zip
      利用vc++6.0编写,利用类编写,可以更改数据集,默认的数据集为十个数据点,本源码为本人做毕业论文时编写,所以绝对正确。
    • Birch.rar
      birch算法是聚类算法的一种,克服了k-means算法的缺点,这里提供了详细的讲解ppt和代码
    • BIRCH算法
      birch聚类算法学习的好方法
    • BIRCH聚类算法
      BIRCH层次聚类算法,里面包括数据集,可直接测试。这种算法效率高,可伸缩,缺点是聚类效果相比其他算法来说略差,不过其思想值得借鉴
    • BIRCH-Clustering-R-code:这是用于BIRCH集群的ar包
      BIRCH聚类R代码 这是用于BIRCH集群的ar包 介绍 该程序包执行BIRCH聚类,并返回一个data.tree结构。 有关data.tree的更多信息,请参阅 关于功能 您需要为BIRCH集群功能提供4个输入: 数据,它是您要进行聚类的数据框...
    • BIRCH聚类算法
      BIRCH(Balanced Iterative Reducing and Clustering using Hierarchies)天生就是为处理超大规模(至少要让你的内存容不下)的数据集而设计的,它可以在任何给定的内存下运行。关于BIRCH的更多特点先不介绍,我先讲...
    • BIRCH算法源码
      BIRCH算法源码,C++实现,已在solaris下编译通过
    • Birch python实现
      birch算法的python实现,有注释哦
    • matlabcnhelp.rar
      matlab中文帮助很难找的,快速下载