Welcome![Sign In][Sign Up]
Location:
Search - CLIQUE java

Search list

[Other resource25110544258

Description: Clique聚类的java简单实现,有数据挖掘的可以下来
Platform: | Size: 1690519 | Author: sl | Hits:

[AI-NN-PRClique聚类算法Java版.rar

Description: Clique聚类算法Java版.rar
Platform: | Size: 1690252 | Author: wenlildh | Hits:

[AI-NN-PR25110544258

Description: Clique聚类的java简单实现,有数据挖掘的可以下来-Clique realize a simple clustering of java, there are data mining can be down
Platform: | Size: 1690624 | Author: sl | Hits:

[AI-NN-PRClique

Description: 经典算法clique的java实现-Classical algorithm clique of the java implementation! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! ! !
Platform: | Size: 1690624 | Author: man | Hits:

[JSP/JavaCliquePercolationMethod-master

Description: 派系过滤算法(CPM)是一个寻找重叠的社区网络(Clique Percolation Method (CPM) is a gephi plugin for finding overlapping communities)
Platform: | Size: 14336 | Author: 远征的铁骑 | Hits:

[Otherwheats-master

Description: 基于网格的聚类算法,经典的clique算法的java实现,(Grid-based clustering algorithm, the classic clique algorithm java implementation,)
Platform: | Size: 16384 | Author: 虹2122 | Hits:

[JSP/JavaCLIQUE

Description: CLIQUE(Clustering In QUEst)是一种简单的基于网格的聚类方法,用于发现子空间中基于密度的簇。CLIQUE把每个维划分成不重叠的区间,从而把数据对象的整个嵌入空间划分成单元。它使用一个密度阈值识别稠密单元和稀疏单元。一个单元是稠密的,如果映射到它的对象数超过该密度阈值。(CLIQUE (Clustering In QUEst) is a simple grid based clustering method for the discovery of clusters based on density in subspace. CLIQUE divides each dimension into a non overlapping interval, dividing the entire embedded space of the data object into a unit. It uses a density threshold to identify dense and sparse units. A unit is dense, if the number of objects mapped to it is more than the density threshold.)
Platform: | Size: 15360 | Author: 景_天 | Hits:

[JSP/Javaclique

Description: 使用java为开发语言,基于高维空间网格聚类算法CLIQUE(Use java as the development language, based on high dimensional space grid clustering algorithm CLIQUE)
Platform: | Size: 1024 | Author: 左左1111 | Hits:

[OtherMaxClique.java

Description: 回溯法求解最大团问题,时间复杂度为O(n*2^n)。(The backtracking method is used to solve the maximum clique problem with a time complexity of O (n*2^n).)
Platform: | Size: 1024 | Author: dupeihui | Hits:

CodeBus www.codebus.net