西安工业大学学报
西安工業大學學報
서안공업대학학보
Journal of Xi'an Technological University
2015年
9期
689-693
,共5页
曲线图形%数据挖掘%数值计算%多项式插值
麯線圖形%數據挖掘%數值計算%多項式插值
곡선도형%수거알굴%수치계산%다항식삽치
curve graph%data mining%numerical value calculation%polynomial interpolation
为了准确快速地从一类曲线图形中挖掘数据 ,通过分析这类曲线图形的数据特征 ,提出就近小区间拉格朗日插值挖掘算法 .选择距计算点最近的点为插值节点 ,通过多次拉格朗日插值进行数据挖掘 .实例计算表明,文中算法的最大相对误差为4.1% ,平均相对误差为3.3% ,利用本文算法所编程序进行1次计算所需时间不超过2s.
為瞭準確快速地從一類麯線圖形中挖掘數據 ,通過分析這類麯線圖形的數據特徵 ,提齣就近小區間拉格朗日插值挖掘算法 .選擇距計算點最近的點為插值節點 ,通過多次拉格朗日插值進行數據挖掘 .實例計算錶明,文中算法的最大相對誤差為4.1% ,平均相對誤差為3.3% ,利用本文算法所編程序進行1次計算所需時間不超過2s.
위료준학쾌속지종일류곡선도형중알굴수거 ,통과분석저류곡선도형적수거특정 ,제출취근소구간랍격랑일삽치알굴산법 .선택거계산점최근적점위삽치절점 ,통과다차랍격랑일삽치진행수거알굴 .실례계산표명,문중산법적최대상대오차위4.1% ,평균상대오차위3.3% ,이용본문산법소편정서진행1차계산소수시간불초과2s.
In order to mine data precisely and quickly from a kind of curve graph ,the nearest minizone Lagrange interpolation algorithm is put forward based on the analysis of the data feature of this kind of curve graph .With the nearest point to the calculation one chosen as the interpolation point data miming was conducted several times by Lagrange interpolation .The result shows that the maximum relative error of the algorithm is 4 .1% ,its average relative error is 3 .3% ,and less than 2 seconds is needed to finish one calculation by using the program based on the algorithm .
