聚类算法 kmeans java 实现

最新推荐文章于 2023-12-18 23:45:33 发布

yc..

最新推荐文章于 2023-12-18 23:45:33 发布

阅读量580

点赞数 1

分类专栏：数据挖掘 java

本文链接：https://blog.csdn.net/TingiBanDeQu/article/details/54943325

版权

本文介绍了使用Java编程实现K-Means聚类算法的过程，通过设定两个初始聚类中心并进行十次迭代，展示算法的运行效果。

摘要由CSDN通过智能技术生成

下图为k-means 算法指定2 个聚类中心，迭代十次得到的结果

这里写图片描述

package com.yc;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
import java.util.concurrent.CopyOnWriteArrayList;

public class KMeans {
   
    private static final String fileName = "points.txt";
    private static final String resultFileName = "result.txt";
    private static final int k = 2;
    private static final int n = 10;
    private static Location[] center = new Location[k];
    private static List<List<Point>> microCluster = new CopyOnWriteArrayList<>();

    static class Location {
        private List<Double> location;// 点的坐标

        public Location(List<Double> location) {
            this.location = location;
        }

        @Override
        public int hashCode() {
            final int prime = 31;
            int result = 1;
            result = prime * result
                    + ((location == null) ? 0 : location.hashCode());
            return result;
        }

        @Override
        public boolean equals(Object obj) {
            if (this == obj)
                return true;
            if (obj == null)
                return false;
            if (getClass() != obj.getClass())
                return false;
            Locatio