發(fā)布時(shí)間：2018-07-03 04:48

  本文選題：茶葉拼配 + 空間聚類�。� 參考：《中南民族大學(xué)學(xué)報(bào)(自然科學(xué)版)》2017年04期

【摘要】：為了提高茶葉拼配效率,節(jié)約人工成本,實(shí)現(xiàn)茶葉企業(yè)效益最大化,探討了將茶葉拼配問題建模成多維層次空間聚類問題,并通過定義多維概念分層空間中的相似性度量準(zhǔn)則,提出了改進(jìn)的k中心點(diǎn)算法求解最優(yōu)拼配方案,并引入Dewey編碼提高了求解效率.根據(jù)真實(shí)數(shù)據(jù)集上的實(shí)驗(yàn)表明:同等實(shí)驗(yàn)條件下較人工拼配方式而言,文中所提出的茶葉拼配智能化求解方法大大提高了茶葉企業(yè)工作效率和經(jīng)濟(jì)利益.
[Abstract]:In order to improve the efficiency of tea blending, save the labor cost and maximize the benefit of tea enterprises, the tea blending problem is modeled as a multi-dimensional hierarchical space clustering problem, and the similarity measurement criterion in the multidimensional concept stratified space is defined. An improved k-center point algorithm is proposed to solve the optimal matching scheme, and Dewey coding is introduced to improve the efficiency of the solution. According to the experiments on the real data set, it is shown that the intelligent solution method of tea blending in the same experimental condition greatly improves the efficiency and economic benefit of tea enterprises.
【作者單位】： 中南民族大學(xué)計(jì)算機(jī)科學(xué)學(xué)院;
【基金】：國家科技支撐計(jì)劃項(xiàng)目子課題(2015BAD29B01) 中央高�；究蒲袠I(yè)務(wù)費(fèi)專項(xiàng)資金資助項(xiàng)目(CZP17007)
【分類號】：TP311.13;TS272.4
，

本文編號：2092461