CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - granular computing
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Search - granular computing - List
[
Windows Develop
]
rgckddm
DL : 0
Rough-Granular Computing in Knowledge Discovery and Data Mining
Date
: 2025-07-11
Size
: 1.95mb
User
:
parissa
[
AI-NN-PR
]
Granularcomputing
DL : 0
粒计算的论文,共11篇,具有很高的参考价值,基于粒计算的文档聚类等等。-Granular computing papers, a total of 11, with a high reference value, document clustering based on granular computing and so on.
Date
: 2025-07-11
Size
: 1.91mb
User
:
hurrican
[
Other
]
04530367
DL : 0
Granular Computing Based Data Mining in the Views of Rough Set and
Date
: 2025-07-11
Size
: 207kb
User
:
shivu
[
Documents
]
lijisuan
DL : 0
这是几篇关于粒计算在故障诊断中的应用,对学习粒计算的应用很有帮助。-This is a few on Granular Computing in Fault Diagnosis of learning the application of granular computing helpful.
Date
: 2025-07-11
Size
: 1.13mb
User
:
zhaojie
[
AI-NN-PR
]
Desktop
DL : 0
传统的K-medoids聚类算法的聚类结果随初始中心点的 不同而波动,且计算复杂度较高不适宜处理大规模数据集; 快速K-medoids聚类算法通过选择合适的初始聚类中心改进 了传统K-medoids聚类算法,但是快速K-medoids聚类算法 的初始聚类中心有可能位于同一类簇。为了克服传统的K- medoids聚类算法和快速K-medoids聚类算法的缺陷,提出 一种基于粒计算的K-medoids聚类算法。-Traditional clustering K-medoids clustering algorithm with the initial centers Different swings, and a high degree of computational complexity inappropriate handling large data sets Fast K-medoids clustering algorithm by selecting appropriate initial cluster centers to improve The traditional K-medoids clustering algorithm, but fast clustering algorithm K-medoids The initial cluster centers may be located in the same class clusters. In order to overcome the traditional K- Medoids defect clustering algorithm and fast K-medoids clustering algorithm, K-medoids one kind of clustering algorithm based on granular computing.
Date
: 2025-07-11
Size
: 2kb
User
:
问建丽
[
matlab
]
101259363Desktop
DL : 0
传统的K-medoids聚类算法的聚类结果随初始中心点的 不同而波动,且计算复杂度较高不适宜处理大规模数据集; 快速K-medoids聚类算法通过选择合适的初始聚类中心改进 了传统K-medoids聚类算法,但是快速K-medoids聚类算法 的初始聚类中心有可能位于同一类簇。为了克服传统的K- medoids聚类算法和快速K-medoids聚类算法的缺陷,提出 一种基于粒计算的K-medoids聚类算法。(The traditional K-medoids clustering algorithm clustering results with different initial center points and volatility, and high computational complexity is not suitable for processing large data sets; K-medoids clustering algorithm by choosing proper initial cluster centers to improve the traditional K-medoids clustering algorithm, but the initial cluster center of K-medoids clustering algorithm can be located in the same cluster. In order to overcome the shortcomings of the traditional K- medoids clustering algorithm and the fast K-medoids clustering algorithm, a K-medoids clustering algorithm based on granular computing is proposed.)
Date
: 2025-07-11
Size
: 2kb
User
:
playboyplay2
[
matlab
]
PSO algorithm
DL : 0
在粗糙集与粒计算中,对于常见的几种非线性规划的函数,运用PSO算法求出了相应的决策属性的权重(In rough set and granular computing, PSO algorithm is used to calculate the weights of the corresponding decision attributes for the common functions of nonlinear programming)
Date
: 2025-07-11
Size
: 6kb
User
:
格式化01
[
matlab
]
模糊粒计算支持向量机
DL : 0
可以实现复杂环境下的预测,模糊粒计算下的支持向量机(Support Vector Machine Based on Fuzzy Granular Computing and Prediction in Complex Environment)
Date
: 2025-07-11
Size
: 286kb
User
:
小肥咩咩羊
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.