股票涨跌分布热力图算法

public class Main {

    //问题抽象 假设数组已排序 1、给定宽高 2、宽高Max 区分横向或者竖向分配 3、分配一个阈值 大于1/3时直接以当前最小宽度作为宽计算, 小于BORDER的面基的时候加上下一个值再次判断,是否大于BORDER重复 第3条 动态阈值每一次分配计算一个合适的阈值

    public static float BORDER = 0.25f;
    public static int H = 0;
    public static int V = 1;
    private static List<Float> ratios = new ArrayList<>();
    private static List<Bean> beans = new ArrayList<>();
    private static final float originWidth = 196;
    private static final float originHeight = 97;
    private static final float area = originWidth * originHeight;
    private static float sumRatio = 0;

    public static class Bean {
        private float width;
        private float height;
        private float startX;
        private float startY;
        private float endX;
        private float endY;

        public float getStartX() {
            return startX;
        }

        public void setStartX(float startX) {
            this.startX = startX;
        }

        public float getStartY() {
            return startY;
        }

        public void setStartY(float startY) {
            this.startY = startY;
        }

        public float getEndX() {
            return endX;
        }

        public void setEndX(float endX) {
            this.endX = endX;
        }

        public float getEndY() {
            return endY;
        }

        public void setEndY(float endY) {
            this.endY = endY;
        }

        public float getWidth() {
            return width;
        }

        public void setWidth(float width) {
            this.width = width;
        }

        public float getHeight() {
            return height;
        }

        public void setHeight(float height) {
            this.height = height;
        }
    }

    public static void main(String[] args) {
//        float width = 50;
//        float height = 100;
//        float area = width * height;
//        float sumRatio = 170f;


//        ratios.add(40f);
//        ratios.add(35f);
//        ratios.add(30f);
//        ratios.add(25f);
//        ratios.add(20f);
//        ratios.add(15f);
//        ratios.add(10f);
//        ratios.add(5f);

//        ratios.add(40f);
//        ratios.add(38f);
//        ratios.add(35f);
//        ratios.add(30f);
//        ratios.add(28f);
//        ratios.add(26f);
//        ratios.add(25f);
//        ratios.add(20f);
//        ratios.add(18f);
//        ratios.add(17f);
//        ratios.add(15f);
//        ratios.add(12f);
//        ratios.add(10f);
//        ratios.add(7f);
//        ratios.add(1f);
//
//        for (Float f :
//                ratios) {
//            sumRatio += f;
//        }
//
//        Dynamic(originWidth, originHeight, 0, area, sumRatio, ratios);
//
//        for (Bean b : beans) {
//            System.out.println("W: " + b.getWidth() + ", H: " + b.getHeight());
//            System.out.println("Start(x,y): " + b.getStartX() + "," + b.getStartY() + ", End(x,y): " + b.getEndX() + "," + b.getEndY());
//        }
    }

    public static void Dynamic(float width, float height, int index, float area, float sumRatio, List<Float> ratios) {
        System.out.println("width: " + width + ", " + "height: " + height + ", " + "index: " + index + ", " + "area: " + area + ", " + "sumRatio: " + sumRatio + ", ");

        float minSide = Math.min(width, height);
        int orientation = width > height ? H : V;
        int i = index;
        float usedRatio = 0;

        while (i < ratios.size()) {
            usedRatio = usedRatio + ratios.get(i);
            float usedRatioRatio = usedRatio / sumRatio;
            float usedArea = usedRatioRatio * area;
            float value = usedArea / minSide;
            if (usedRatioRatio < BORDER) {
                i++;
                System.out.println(usedRatioRatio + " 小于" + BORDER + " i: " + i);
                if (i == ratios.size() - 1) {
                    System.out.println("剩下的全部分配掉");
                    if (i == index) {
                        Bean bean = new Bean();
                        bean.setWidth(orientation == H ? value : width);
                        bean.setHeight(orientation == H ? height : value);

                        bean.setStartX(originWidth - width);
                        bean.setStartY(originHeight - height);

                        bean.setEndX(originWidth - width + bean.getWidth());
                        bean.setEndY(originHeight - height + bean.getHeight());

                        beans.add(bean);
                        System.out.println("只有一个直接分配");
                    } else {
                        float lastEndX = originWidth - width;
                        float lastEndY = originHeight - height;
                        for (int j = index; j <= i; j++) {
                            float segValue = ratios.get(j) / usedRatio * minSide;
                            Bean bean = new Bean();
                            bean.setWidth(orientation == H ? value : segValue);
                            bean.setHeight(orientation == H ? segValue : value);
                            bean.setStartX(lastEndX);
                            bean.setStartY(lastEndY);

                            lastEndX = lastEndX + bean.getWidth();
                            lastEndY = lastEndY + bean.getHeight();
                            bean.setEndX(lastEndX);
                            bean.setEndY(lastEndY);

                            beans.add(bean);
                            System.out.println("多个循环分配" + j);
                        }
                    }
                }
            } else {
                System.out.println(usedRatioRatio + " 大于" + BORDER);

                if (i == index) {
                    Bean bean = new Bean();
                    bean.setWidth(orientation == H ? value : width);
                    bean.setHeight(orientation == H ? height : value);

                    bean.setStartX(originWidth - width);
                    bean.setStartY(originHeight - height);

                    bean.setEndX(originWidth - width + bean.getWidth());
                    bean.setEndY(originHeight - height + bean.getHeight());

                    beans.add(bean);
                    System.out.println("只有一个直接分配");
                } else {

                    float nextStartX = originWidth - width;
                    float nextStartY = originHeight - height;

                    float lastEndX = originWidth - width;
                    float lastEndY = originHeight - height;


                    for (int j = index; j <= i; j++) {
                        float segValue = ratios.get(j) / usedRatio * minSide;
                        Bean bean = new Bean();
                        bean.setWidth(orientation == H ? value : segValue);
                        bean.setHeight(orientation == H ? segValue : value);

                        bean.setStartX(nextStartX);
                        bean.setStartY(nextStartY);

                        nextStartX = orientation == H ? originWidth - width : nextStartX + bean.getWidth();
                        nextStartY = orientation == H ? nextStartY + bean.getHeight() : originWidth - width;

                        lastEndX = orientation == H ? bean.getWidth() : lastEndX + bean.getWidth();
                        lastEndY = orientation == H ? lastEndY + bean.getHeight() : bean.getHeight();
                        bean.setEndX(lastEndX);
                        bean.setEndY(lastEndY);

                        beans.add(bean);
                        System.out.println("多个循环分配" + j);
                    }
                }

                area = area - usedArea;
                sumRatio = sumRatio - usedRatio;
                i++;
                if (i < ratios.size()) {
                    Dynamic(orientation == H ? width - value : width, orientation == H ? height : height - value, i, area, sumRatio, ratios);
                }
                System.out.println("一轮完成");
                break;
            }
        }
    }
}
  • 1
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 5
    评论
根据提供的引用内容,我们可以看出使用的是随机森林算法而不是K近邻算法。因此,我将为您介绍如何使用Anaconda中的随机森林算法预测股票价格涨跌。 以下是使用Anaconda中的随机森林算法预测股票价格涨跌的步骤: 1.首先,您需要安装Anaconda并打开Jupyter Notebook。 2.在Jupyter Notebook中,您需要导入所需的库,包括pandas、numpy、matplotlib和sklearn等库。 ```python import pandas as pd import numpy as np import matplotlib.pyplot as plt from sklearn.ensemble import RandomForestClassifier from sklearn.metrics import accuracy_score from sklearn.model_selection import train_test_split ``` 3.接下来,您需要加载股票数据集并进行数据预处理。您可以使用pandas库中的read_csv()函数来加载数据集。 ```python data = pd.read_csv('stock_data.csv') ``` 4.然后,您需要对数据集进行清洗和转换。您可以使用pandas库中的dropna()函数来删除缺失值,并使用pandas库中的get_dummies()函数将分类变量转换为虚拟变量。 ```python data = data.dropna() data = pd.get_dummies(data) ``` 5.接下来,您需要将数据集分为训练集和测试集。您可以使用sklearn库中的train_test_split()函数来完成此操作。 ```python X = data.drop('涨跌', axis=1) y = data['涨跌'] X_train, X_test, y_train, y_test = train_test_split(X, y, test_size=0.3, random_state=42) ``` 6.然后,您需要使用随机森林算法来训练模型。您可以使用sklearn库中的RandomForestClassifier()函数来完成此操作。 ```python rfc = RandomForestClassifier(n_estimators=100, random_state=42) rfc.fit(X_train, y_train) ``` 7.接下来,您需要使用测试集来评估模型的准确性。您可以使用sklearn库中的accuracy_score()函数来计算准确性。 ```python y_pred = rfc.predict(X_test) accuracy = accuracy_score(y_test, y_pred) print('Accuracy:', accuracy) ``` 8.最后,您可以使用模型来预测股票价格的涨跌。您可以使用sklearn库中的predict()函数来完成此操作。 ```python prediction = rfc.predict(X_test) print('Prediction:', prediction) ```

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值