机器学习入门实践，让机器识别一只猫

SELECT * FROM  tianma.module_xxWHERE  pt = TO_CHAR(DATEADD(GETDATE(), - 1, ‘dd’), ‘yyyymmdd’)  AND name NOT LIKE ‘%test%’  AND name NOT LIKE ‘%demo%’  AND name NOT LIKE ‘%测试%’  AND keywords NOT LIKE ‘%test%’  AND keywords NOT LIKE


    
 ‘%测试%’  AND keywords NOT LIKE ‘%demo%’

const cost = ((y’1-y1)^2 + (y’2-y2)^2 + (y’3-y3)^2 + (y’4-y4)^2 + (y’5-y5)^2 + (y’6-y6)^2 ) / 6

// 函数 2const cost = (((a*x1+b)-y1)^2 + ((a*x2+b)-y2)^2 + ((a*x3+b)-y3)^2 + ((a*x4+b)-y4)^2 + ((a*x5+b)-y5)^2 + ((a*x6+b)-y6)^2 )/ 6

// 函数 3// a参数的偏导数const costDaoA = (((a*x1+b)-y1)*2*x1 + ((a*x2+b)-y2)*2*x1 + ((a*x3+b)-y3)*2*x1 + ((a*x4+b)-y4)*2*x1 + ((a*x5+b)-y5)*2*x1 + ((a*x6+b)-y6)*2*x1 )/ 6



    
// b参数的偏导数const costDaoB = (((a*x1+b)-y1)*2 + ((a*x2+b)-y2)*2 + ((a*x3+b)-y3)*2 + ((a*x4+b)-y4)*2 + ((a*x5+b)-y5)*2 + ((a*x6+b)-y6)*2 )/ 6

/**
* 代价函数 均方差计算
*/
function cost(a, b) {
    let sum = data.reduce((pre, current) = >{
        return pre + ((a + current[0] * b) - current[1]) * ((a + current[0] * b) - current[1]);
    },    0);
    return sum / 2 / data.length;
}
/**
* 计算梯度
* @param a
* @param b
*/


    

function gradientA(a, b) {
    let sum = data.reduce((pre, current) = >{
        return pre + ((a + current[0] * b) - current[1]) * (a + current[0] * b);
    },    0);
    return sum / data.length;
}
function gradientB(a, b) {
    let sum = data.reduce((pre, current) = >{
        return pre + ((a + current[0] * b) - current[1]);
    },    0);
    return sum / data.length;
}
// 训练次数let batch = 200;
// 每次的靠近底部的速度，也就是学习速率。过高会导致在底部弹跳迟迟不能到到底部，过低会导致学习效率降低。let alpha = 0.001;
let args = [0, 0]; // 初始化 a b 值function step() {
    let costNumber = (cost(args[0], args[1]));
    console.log(‘cost’, costNumber);
    chartLoss.series[0].addPoint(costNumber, true, false, false);
    args[0] -= alpha * gradientA(args[0], args[1]);
    args[1] -= alpha * gradientB(args[0], args[1]);
    if ((—batch > 0)) {
        window.requestAnimationFrame(() = >{            step()        });
    } else {
        drawLine(args[0], args[1]);
    }
}
step();