RSS
热门关键字:  数据挖掘  人工智能  数据仓库  搜索引擎  数据挖掘导论

聚类(Clustering)介绍二

来源: 作者:unkonwn 时间:2004-12-09 点击:

Any n points can be placed in (n .. 1)-dimensional space, with distances preserved exactly.
Example 8.1 : Figure 19 shows how we can place three points a, b, and c, with only a distance measure
D given, in 2-dimensional space. Start by placing a and b distance D(a; b) apart. Draw a circle of radius
D(a; c) around a and a circle of radius D(b; c) around b. By the triangle inequality, which D must obey,
these circles intersect. Pick one of the two points of intersection as c. 数据挖掘研究院

 

  数据挖掘实验室

  数据挖掘研究院

资料全文下载
最新评论共有 0 位网友发表了评论
发表评论
评论内容:不能超过250字,需审核,请自觉遵守互联网相关政策法规。
匿名?