利用java写一个支持向量机算法

好的,以下是一个简单的Java代码来实现支持向量机算法:

``` import java.util.ArrayList; import java.util.List;

public class SVM {

private List<Data> trainingData;
private List<Double> alpha;
private double b;
private double C;
private double epsilon;
private int maxIterations;

public SVM(double C, double epsilon, int maxIterations) {
    this.C = C;
    this.epsilon = epsilon;
    this.maxIterations = maxIterations;
    this.trainingData = new ArrayList<Data>();
    this.alpha = new ArrayList<Double>();
    this.b = 0;
}

public void addTrainingData(Data data) {
    this.trainingData.add(data);
    this.alpha.add(0.0);
}

public int train() {
    int iteration = 0;
    int N = this.trainingData.size();
    while (iteration < this.maxIterations) {
        iteration++;
        int numChanged = 0;
        for (int i = 0; i < N; i++) {
            Data data = this.trainingData.get(i);
            double prediction = this.predict(data);
            double error = data.label - prediction;
            if ((error * data.label < -this.epsilon &amp;&amp; this.alpha.get(i) < this.C) ||
                    (error * data.label > this.epsilon &amp;&amp; this.alpha.get(i) > 0)) {
                int j = this.selectJ(i, N, error);
                Data dataJ = this.trainingData.get(j);
                double alphaI = this.alpha.get(i);
                double alphaJ = this.alpha.get(j);
                double L, H;
                if (data.label != dataJ.label) {
                    L = Math.max(0, alphaJ - alphaI);
                    H = Math.min(this.C, this.C + alphaJ - alphaI);
                } else {
                    L = Math.max(0, alphaJ + alphaI - this.C);
                    H = Math.min(this.C, alphaJ + alphaI);
                }
                if (L == H) {
                    continue;
                }
                double eta = 2 * dotProduct(data.features, dataJ.features) -
                        dotProduct(data.features, data.features) -
                        dotProduct(dataJ.features, dataJ.features);
                if (eta >= 0) {
                    continue;
                }
                double alphaJNew = alphaJ - dataJ.label * (error - prediction) / eta;
                alphaJNew = Math.min(H, Math.max(L, alphaJNew));
                if (Math.abs(alphaJNew - alphaJ) < 1e-5) {
                    continue;
                }
                this.alpha.set(j, alphaJNew);
                double alphaINew = alphaI + data.
  • 1
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值