in-memory形式的牧户K-Means聚类
来源:互联网 发布:全球通用聊天软件 编辑:程序博客网 时间:2024/05/01 15:17
<strong><span style="font-size:18px;">/*** * @author YangXin * @info 以in-memory形式的模糊k-means聚类示例 */package unitNine;import java.util.ArrayList;import java.util.List;import org.apache.mahout.clustering.fuzzykmeans.FuzzyKMeansClusterer;import org.apache.mahout.clustering.fuzzykmeans.SoftCluster;import org.apache.mahout.common.distance.EuclideanDistanceMeasure;import org.apache.mahout.math.Vector;public class FuzzyKMeansExample {public static void main(){List<Vector> sampleData = new ArrayList<Vector>();RandomPointsUtil.generateSamples(sampleData, 400, 1, 1, 3);RandomPointsUtil.generateSamples(sampleData, 300, 1, 0, 0.5);RandomPointsUtil.generateSamples(sampleData, 300, 0, 2, 0.1);int k = 3;List<Vector> randomPoints = RandomPointsUtil.chooseRandomPoints(sampleData, k);List<SoftCluster> clusters = new ArrayList<SoftCluster>();int clusterId = 0;for(Vector v : randomPoints){clusters.add(new SoftCluster(v, clusterId++, new EuclideanDistanceMeasure()));}List<List<SoftCluster>> finalClusters = FuzzyKMeansClusterer.clusterPoints(sampleData, clusters, new EuclideanDistanceMeasure(), 0.01, 3, 10);for(SoftCluster cluster : finalClusters.get(finalClusters.size() - 1)){System.out.println("Fuzzy Cluster id : " + cluster.getId() + " center:" + cluster.getCenter().asFormatString());}}}</span></strong>
0 0
- in-memory形式的牧户K-Means聚类
- 详细的K-means聚类
- 二分K-means聚类,K-Means改进
- K-Means聚类 K-Means Clustering
- 基于MapReduce的并行k-means聚类
- K-Means++的代码
- 聚类:K-Means
- K-Means 聚类 sample
- 聚类:K-means算法
- OpenCV k-means聚类
- K-means聚类
- Mahout K-means聚类
- K-means聚类
- K-MEANS聚类
- k-means聚类
- k-means聚类
- K-means聚类
- Mahout K-means聚类
- MySQL的运算符
- Php-Redis 邮件队列实现总结
- GB2312和ASCII码点阵字库HZK, ASC说明使用心得,全
- Python正则表达式指南
- sigsegv 問題的調是
- in-memory形式的牧户K-Means聚类
- 欢迎使用CSDN-markdown编辑器
- 欢迎使用CSDN-markdown编辑器
- 【leetcode】【14】Longest Common Prefix
- 如何用javascript实现 网页标题的滚动效果
- android Service详解
- iOS和Android的app界面设计规范
- 手把手教你做开源项目MyMeiZi 二(使用RecyclerView+Glide打造瀑布流)
- 基于模糊K-Means算法的新闻聚类