CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - cure C
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Search - cure C - List
[
Other resource
]
curec
DL : 0
一个用C语言实现的基于cure的数据聚类源代码。-a C language based on the data clustering cure source code.
Update
: 2008-10-13
Size
: 42.21kb
Publisher
:
lixiaoqing
[
Other resource
]
cure.c++
DL : 1
经典cure聚类算法,实现用c++语言.大家-classic cure clustering algorithm, and using the c language. We look at
Update
: 2008-10-13
Size
: 43.25kb
Publisher
:
孔明
[
AI-NN-PR
]
curec
DL : 0
一个用C语言实现的基于cure的数据聚类源代码。-a C language based on the data clustering cure source code.
Update
: 2025-02-17
Size
: 42kb
Publisher
:
lixiaoqing
[
Algorithm
]
cure.c++
DL : 0
经典cure聚类算法,实现用c++语言.大家-classic cure clustering algorithm, and using the c language. We look at
Update
: 2025-02-17
Size
: 43kb
Publisher
:
孔明
[
AI-NN-PR
]
cruecode
DL : 0
一 种改进的 CURE聚类算法-An improved clustering algorithm CURE
Update
: 2025-02-17
Size
: 202kb
Publisher
:
hehe
[
AI-NN-PR
]
CURE
DL : 0
用c++实现的CURE聚类算法 这是即DBSCAN算法后出现的基于密度的聚类算法-With c++ Realized CURE clustering algorithm DBSCAN algorithm that is, this is occurring after the density-based clustering algorithm
Update
: 2025-02-17
Size
: 43kb
Publisher
:
刘年
[
Mathimatics-Numerical algorithms
]
c
DL : 0
CURE: AN EFFICIENT CLUSTERING ALGORITHM FOR LARGE DATABASES-CURE: AN EFFICIENT CLUSTERING ALGORITHM FOR LARGE DATABASES
Update
: 2025-02-17
Size
: 1.08mb
Publisher
:
Maha
[
matlab
]
21840268cure
DL : 0
cure算法的c语言完美实现,值得借鉴并运用-cure the perfect realization of the algorithm c language, it is worth learning and using
Update
: 2025-02-17
Size
: 43kb
Publisher
:
phoenix
[
Dialog_Window
]
WinMain
DL : 0
纯c++实现窗口,利用API实现Windows环境下的消息响应-cure c++ produce Windows
Update
: 2025-02-17
Size
: 8kb
Publisher
:
bydgr
[
Mathimatics-Numerical algorithms
]
CURE.tar
DL : 0
是数据挖掘领域中适用于大数据集的层次聚类算法CURE的C语言实现代码-the C source codes of Cluster algorithms of CURE
Update
: 2025-02-17
Size
: 25kb
Publisher
:
胡雯雨
[
VC/MFC
]
xzqx
DL : 0
C++绘制曲线,一个很不错的方法,如果需要了解这方面知识的,可以下载看一看-draw cure
Update
: 2025-02-17
Size
: 60kb
Publisher
:
peils
[
Graph Drawing
]
Cure
DL : 0
绘制曲线,C.net 2005开发,简单实用-Drawn curve, C.net 2005 development, simple and practical
Update
: 2025-02-17
Size
: 11kb
Publisher
:
木木
[
Picture Viewer
]
bmp
DL : 0
纯C写的能够显示所有BMP格式的代码,能够连续显示多张图像-writed by cure C which can display all the code of BMp
Update
: 2025-02-17
Size
: 2.71mb
Publisher
:
程魏
[
Windows Develop
]
CURE
DL : 0
利用C++语言编写,并利用类,所以可以更改数据集,本源码为本人做毕业论文时编写,所以绝对正确。-Use vc++6.0 preparation, use of class preparation, you can change the data set, the default data set for the ten data points, the source for the thesis I am prepared to do, so it is absolutely correct.
Update
: 2025-02-17
Size
: 366kb
Publisher
:
孙利
[
Other
]
cure-code-master
DL : 0
使用C++实现Cure算法,并对数据集进行分类-realize cure algorithm using C++
Update
: 2025-02-17
Size
: 8kb
Publisher
:
Lee
[
OpenCV
]
CURE-analy
DL : 0
C++ CURE聚类算法计算,包括文档分析-C++ CURE Analyse
Update
: 2025-02-17
Size
: 413kb
Publisher
:
邓卓健
[
Mathimatics-Numerical algorithms
]
CureDemo
DL : 0
实现的cure聚类的demo。算法在开始时,每个点都是一个簇,然后将距离最近的簇结合,一直到簇的个数为要求的K。它是一种分裂的层次聚类。算法分为以下6步: 1)从源数据对象中抽取一个随机样本S。 2)将样本S分割为一组划分。 3)对划分局部的聚类。 4)通过随机取样提出孤立点。如果一个簇增长得太慢,就去掉它。 5)对局部的簇进行聚类。 6)用相应的簇标签标记数据。(The implementation of the cure clustering of the demo. At the beginning of the algorithm, each point is a cluster, and then the nearest cluster is combined to the number of clusters K. It is a hierarchical cluster of divisions. The algorithm is divided into the following 6 steps: 1) extract a random sample S from the source data object. 2) the sample S is divided into a set of partitions. 3) to divide the local clustering. 4) the isolated point is proposed by random sampling. If a cluster is growing too slowly, get rid of it. 5) clustering the local clusters. 6) mark the data with the corresponding cluster tag.)
Update
: 2025-02-17
Size
: 158kb
Publisher
:
Aileen00080
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.