DataEvaluator.cpp 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556
  1. #include "DataEvaluator.h"
  2. #include <ProjectManager.h>
  3. #include <SchemePlanManager.h>
  4. #include <CMind.h>
  5. #include "algorithm/EntropyWeights.h"
  6. #include "algorithm/PCA.h"
  7. #include "algorithm/HierarchicalAnalysis.h"
  8. #include <dbService/ClassSet.h>
  9. #include <dbService/NodeMatrixService.h>
  10. #include <dbService/CNodeDataService.h>
  11. #include <dbService/SchemeProcessService.h>
  12. #include <dbService/UserConfigService.h>
  13. #include <dbService/MindWeightService.h>
  14. #include <dbService/MindScoreService.h>
  15. #include <dbService/SchemeInfoService.h>
  16. #include <QMap>
  17. #include <QDebug>
  18. DataEvaluator::DataEvaluator(QObject *parent) : QObject(parent) { }
  19. void DataEvaluator::setProcess(SchemePlanManager::SchemeProcessInfo process)
  20. {
  21. m_process = process;
  22. }
  23. SchemePlanManager::SchemeProcessInfo DataEvaluator::process() const
  24. {
  25. return m_process;
  26. }
  27. void DataEvaluator::setGatherType(DataEvaluator::GatherType type)
  28. {
  29. m_gatherType = type;
  30. }
  31. DataEvaluator::GatherType DataEvaluator::gatherType() const
  32. {
  33. return m_gatherType;
  34. }
  35. bool DataEvaluator::evaluate()
  36. {
  37. if (m_process.type == SchemePlanManager::ImportWeightData) {
  38. if (m_process.dSource == SchemePlanManager::FromExpert) {
  39. return evaluateWeightFromExpert();
  40. } else if (m_process.dSource == SchemePlanManager::FromMeasurement) {
  41. return evaluateWeightFromMeasure();
  42. }
  43. } else if (m_process.type == SchemePlanManager::ImportEvalData) {
  44. if (m_process.indexType == ProjectManager::TechIndex) {
  45. return evaluateTech();
  46. } else if (m_process.indexType == ProjectManager::OptimalIndex) {
  47. return evaluateScheme();
  48. } else if (m_process.indexType == ProjectManager::EfficiencyIndex) {
  49. return evaluateEfficiencyMEA();
  50. }
  51. }
  52. return false;
  53. }
  54. bool DataEvaluator::evaluateWeightFromExpert()
  55. {
  56. QMap<QString, QMap<QString, NodeMatrixInfo *>> nodeData;
  57. bool dataRet = getNodeData(nodeData);
  58. /// 权重分析专家导入数据, 使用层次分析法
  59. SchemePlanManager::Algorithm algorithm = SchemePlanManager::AHP;
  60. /// 获取指标体系
  61. QList<CNodeData> nodeList;
  62. bool mindRet = CNodeDataService().QueryAllValid(nodeList, m_process.projectId, m_process.indexType);
  63. CMind *mind = new CMind(this);
  64. mind->setNodeList(nodeList);
  65. /// 获取专家配置
  66. QMap<QString, double> config;
  67. bool cfgRet = getUserConfig(config);
  68. if (!(dataRet && mindRet && cfgRet)) {
  69. return false;
  70. }
  71. QMap<QString, double> indexWeights;
  72. // 结果集结, 先计算各个专家的数据, 再取均值
  73. if (m_gatherType == Result) {
  74. QMap<QString, QMap<QString, double>> mWeights;
  75. for (QString expertId : nodeData.keys()) {
  76. for (int i = 1; i < mind->levels(); i++) {
  77. for (CNodeData node : mind->nodesInLevel(i)) {
  78. QList<CNodeData> subNodes = mind->subNodes(node);
  79. QVector<qreal> nxnValus; // n x n矩阵
  80. for (int j = 0; j < subNodes.size(); j++) {
  81. QString abs = subNodes[j].name;
  82. for (int k = 0; k < subNodes.size(); k++) {
  83. QString ord = subNodes[k].name;
  84. QString key = abs + "-" + ord;
  85. double v;
  86. QStringList nodeValue = nodeData[expertId][key]->nodeValue.split("/");
  87. if (nodeValue.size() == 1) {
  88. v = nodeValue[0].toDouble();
  89. } else {
  90. v = nodeValue[0].toDouble() / nodeValue[1].toDouble();
  91. }
  92. nxnValus.append(v);
  93. }
  94. }
  95. // 计算权重并存储
  96. QScopedPointer<HierarchicalAnalysis> ha(new HierarchicalAnalysis(subNodes.size(), nxnValus));
  97. QVector<qreal> weights = ha->getWeights();
  98. for (int l = 0; l < weights.size(); ++l) {
  99. if (mWeights.keys().contains(expertId) == false) {
  100. mWeights[expertId] = QMap<QString, double>();
  101. }
  102. CNodeData pNode = mind->node(subNodes[l].pNumber);
  103. if (mWeights[expertId].keys().contains(pNode.name)) {
  104. mWeights[expertId][subNodes[l].name] = mWeights[expertId][pNode.name] * weights[l];
  105. } else {
  106. mWeights[expertId][subNodes[l].name] = weights[l];
  107. }
  108. }
  109. }
  110. }
  111. }
  112. // 求平均权重
  113. for (int i = 1; i < mind->levels(); i++) {
  114. for (CNodeData node : mind->nodesInLevel(i)) {
  115. QList<CNodeData> subNodes = mind->subNodes(node);
  116. for (int j = 0; j < subNodes.size(); j++) {
  117. double sum = 0;
  118. for (QString expertId : nodeData.keys()) {
  119. sum += mWeights[expertId][subNodes[j].name] * config[expertId];
  120. }
  121. indexWeights[subNodes[j].name] = sum;
  122. }
  123. }
  124. }
  125. } else { // 矩阵集结, 先计算各个专家数据的均值, 在求权重
  126. // 求专家数据均值
  127. QMap<QString, double> avgNodeValue;
  128. for (QString key : nodeData.values().first().keys()) {
  129. double sum = 0;
  130. for (QString expertId : nodeData.keys()) {
  131. double v;
  132. QStringList nodeValue = nodeData[expertId][key]->nodeValue.split("/");
  133. if (nodeValue.size() == 1) {
  134. v = nodeValue[0].toDouble();
  135. } else {
  136. v = nodeValue[0].toDouble() / nodeValue[1].toDouble();
  137. }
  138. sum += v * config[expertId];
  139. }
  140. avgNodeValue[key] = sum / nodeData.keys().size();
  141. }
  142. // 求权重
  143. for (int i = 1; i < mind->levels(); i++) {
  144. for (CNodeData node : mind->nodesInLevel(i)) {
  145. QList<CNodeData> subNodes = mind->subNodes(node);
  146. QVector<qreal> nxnValus; // n x n矩阵
  147. for (int j = 0; j < subNodes.size(); j++) {
  148. QString abs = subNodes[j].name;
  149. for (int k = 0; k < subNodes.size(); k++) {
  150. QString ord = subNodes[k].name;
  151. QString key = abs + "-" + ord;
  152. nxnValus.append(avgNodeValue[key]);
  153. }
  154. }
  155. // 计算权重并存储
  156. QScopedPointer<HierarchicalAnalysis> ha(new HierarchicalAnalysis(subNodes.size(), nxnValus));
  157. QVector<qreal> weights = ha->getWeights();
  158. for (int l = 0; l < weights.size(); ++l) {
  159. CNodeData pNode = mind->node(subNodes[l].pNumber);
  160. if (indexWeights.keys().contains(pNode.name)) {
  161. indexWeights[subNodes[l].name] = indexWeights[pNode.name] * weights[l];
  162. } else {
  163. indexWeights[subNodes[l].name] = weights[l];
  164. }
  165. }
  166. }
  167. }
  168. }
  169. QStringList valueList;
  170. for (QString key : indexWeights.keys()) {
  171. valueList.append(QString("%1:%2").arg(key).arg(indexWeights[key]));
  172. }
  173. QString valueStr = valueList.join(";");
  174. bool ret = MindWeightService().saveUniqueWeightData(m_process.projectId, m_process.indexType, m_process.dSource,
  175. algorithm, valueStr);
  176. return ret;
  177. }
  178. bool DataEvaluator::evaluateWeightFromMeasure()
  179. {
  180. QMap<QString, QMap<QString, NodeMatrixInfo *>> nodeData;
  181. bool dataRet = getNodeData(nodeData);
  182. SchemePlanManager::Algorithm algorithm;
  183. bool algRet = getAlgorithm(algorithm);
  184. /// 获取指标体系
  185. QList<CNodeData> nodeList;
  186. bool mindRet = CNodeDataService().QueryAllValid(nodeList, m_process.projectId, m_process.indexType);
  187. CMind *mind = new CMind(this);
  188. mind->setNodeList(nodeList);
  189. if (!(dataRet && algRet && mindRet)) {
  190. return false;
  191. }
  192. /// 各个指标的权重值
  193. /// 外层 QString 是 uuid, 内层 QString 是指标名称, double 是指标权重
  194. QMap<QString, double> allWeights;
  195. if (algorithm == SchemePlanManager::Entropy) { // 熵值法
  196. /// 根据指标体系层级, 构造算法需要的数据, 逐层计算权重值并保存
  197. for (int i = 1; i < mind->levels(); i++) {
  198. for (CNodeData node : mind->nodesInLevel(i)) {
  199. QList<CNodeData> subNodes = mind->subNodes(node);
  200. EntropyMat mat;
  201. for (int j = 0; j < subNodes.size(); j++) {
  202. QVector<double> values;
  203. for (QString uuid : nodeData.keys()) {
  204. NodeMatrixInfo *info = nodeData[uuid][subNodes[j].name];
  205. if (info == nullptr) {
  206. break;
  207. }
  208. double value = nodeData[uuid][subNodes[j].name]->nodeValue.toDouble();
  209. values.append(value);
  210. }
  211. mat.append({ values });
  212. }
  213. if (mat.size() <= 0) {
  214. continue;
  215. }
  216. // 计算权重
  217. QScopedPointer<EntropyWeights> ew(new EntropyWeights(mat));
  218. QVector<double> weights, scores;
  219. ew->compute(weights, scores);
  220. // 结合父节点指标权重计算指标最终权重
  221. for (int k = 0; k < subNodes.size(); k++) {
  222. double w = weights[k];
  223. if (std::_Is_nan(w)) {
  224. w = 1 / subNodes.size();
  225. }
  226. CNodeData pNode = mind->node(subNodes[k].pNumber);
  227. if (allWeights.keys().contains(pNode.name)) {
  228. allWeights[subNodes[k].name] = allWeights[pNode.name] * w;
  229. } else {
  230. allWeights[subNodes[k].name] = w;
  231. }
  232. }
  233. }
  234. }
  235. } else if (algorithm == SchemePlanManager::PrincipalComponents) { // 主成分分析法
  236. for (int i = 1; i < mind->levels(); i++) {
  237. for (CNodeData node : mind->nodesInLevel(i)) {
  238. QList<CNodeData> subNodes = mind->subNodes(node);
  239. QVector<QVector<double>> mat;
  240. for (QString uuid : nodeData.keys()) {
  241. QVector<double> values;
  242. for (int j = 0; j < subNodes.size(); j++) {
  243. NodeMatrixInfo *info = nodeData[uuid][subNodes[j].name];
  244. if (info == nullptr) {
  245. break;
  246. }
  247. double value = nodeData[uuid][subNodes[j].name]->nodeValue.toDouble();
  248. values.append(value);
  249. }
  250. mat.append({ values });
  251. }
  252. if (mat.size() <= 0) {
  253. continue;
  254. }
  255. QScopedPointer<PCA> pca(new PCA(mat));
  256. pca->compute();
  257. // 结合父节点指标权重计算指标最终权重
  258. for (int k = 0; k < subNodes.size(); k++) {
  259. double w = pca->weights()[k];
  260. if (std::_Is_nan(w)) {
  261. w = 1 / subNodes.size();
  262. }
  263. CNodeData pNode = mind->node(subNodes[k].pNumber);
  264. if (allWeights.keys().contains(pNode.name)) {
  265. allWeights[subNodes[k].name] = allWeights[pNode.name] * w;
  266. } else {
  267. allWeights[subNodes[k].name] = w;
  268. }
  269. }
  270. }
  271. }
  272. }
  273. QStringList valueList;
  274. for (QString key : allWeights.keys()) {
  275. valueList.append(QString("%1:%2").arg(key).arg(allWeights[key]));
  276. }
  277. QString valueStr = valueList.join(";");
  278. bool ret = MindWeightService().saveUniqueWeightData(m_process.projectId, m_process.indexType, m_process.dSource,
  279. algorithm, valueStr);
  280. return ret;
  281. }
  282. bool DataEvaluator::evaluateTech()
  283. {
  284. QMap<QString, double> weightData;
  285. bool weightRet = getWeightData(weightData);
  286. QMap<QString, QMap<QString, NodeMatrixInfo *>> nodeData;
  287. bool dataRet = getNodeData(nodeData);
  288. /// 获取指标体系
  289. QList<CNodeData> nodeList;
  290. bool mindRet = CNodeDataService().QueryAllValid(nodeList, m_process.projectId, m_process.indexType);
  291. CMind *mind = new CMind(this);
  292. mind->setNodeList(nodeList);
  293. /// 获取权重配置
  294. QMap<QString, double> config;
  295. bool cfgRet = false;
  296. if (m_process.dSource == SchemePlanManager::FromExpert) {
  297. cfgRet = getUserConfig(config);
  298. } else {
  299. for (QString uuid : nodeData.keys()) {
  300. config[uuid] = 1.0 / nodeData.keys().size();
  301. }
  302. cfgRet = nodeData.size() > 0;
  303. }
  304. if (weightRet == false || dataRet == false || mindRet == false || nodeList.size() <= 0 || cfgRet == false) {
  305. qDebug() << __FUNCTION__ << __LINE__ << endl;
  306. return false;
  307. }
  308. QMap<QString, double> scoreData;
  309. for (int i = 1; i < mind->levels(); i++) {
  310. for (CNodeData node : mind->nodesInLevel(i)) {
  311. QList<CNodeData> subNodes = mind->subNodes(node);
  312. for (int j = 0; j < subNodes.size(); j++) {
  313. double score = 0;
  314. for (QString uuid : nodeData.keys()) {
  315. for (QString weightKey : weightData.keys()) {
  316. QString key = subNodes[j].name + "-" + weightKey;
  317. if (nodeData[uuid].keys().contains(key)) {
  318. score += nodeData[uuid][key]->nodeValue.toDouble() * weightData[weightKey] * config[uuid];
  319. }
  320. }
  321. }
  322. scoreData[subNodes[j].name] = score;
  323. }
  324. }
  325. }
  326. QStringList valueList;
  327. for (QString key : scoreData.keys()) {
  328. valueList.append(QString("%1:%2").arg(key).arg(scoreData[key]));
  329. }
  330. QString valueStr = valueList.join(";");
  331. bool ret = MindScoreService().saveUniqueScoreData(m_process.projectId, valueStr);
  332. return ret;
  333. }
  334. bool DataEvaluator::evaluateScheme()
  335. {
  336. QMap<QString, double> weightData;
  337. bool weightRet = getWeightData(weightData);
  338. QMap<int, QMap<QString, double>> schemeData;
  339. bool schemeRet = getSchemeData(schemeData);
  340. if (weightRet == false || schemeRet == false) {
  341. return false;
  342. }
  343. for (int schemeId : schemeData.keys()) {
  344. double score = 0;
  345. for (QString key : schemeData[schemeId].keys()) {
  346. score += schemeData[schemeId][key] * weightData[key];
  347. }
  348. SchemeInfoService().updateSchemeScore(schemeId, score);
  349. }
  350. return true;
  351. }
  352. bool DataEvaluator::evaluateEfficiencyMEA()
  353. {
  354. return false;
  355. }
  356. bool DataEvaluator::evaluateEfficiencyGCE()
  357. {
  358. return false;
  359. }
  360. bool DataEvaluator::getNodeData(QMap<QString, QMap<QString, NodeMatrixInfo *>> &nodeData) const
  361. {
  362. /// 整理数据, 使用 uuid 将数据分组, 使用指标名称索引
  363. QString indexName = ProjectManager::nameOfIndexType((ProjectManager::IndexType)m_process.indexType);
  364. QList<NodeMatrixInfo *> dataList;
  365. bool ret = NodeMatrixService().QueryDataByProjectAndIndex(&dataList, indexName, m_process.projectId,
  366. m_process.dSource);
  367. if (ret == false) {
  368. return false;
  369. }
  370. if (dataList.size() <= 0) {
  371. qDebug() << __FUNCTION__ << __LINE__ << "未录入评估数据" << endl;
  372. return false;
  373. }
  374. for (NodeMatrixInfo *info : dataList) {
  375. QString key = info->strUuid; // 实测数据的 key
  376. if (m_process.dSource == SchemePlanManager::FromExpert) {
  377. key = info->expertId; // 专家数据的 key
  378. }
  379. if (nodeData.keys().contains(key) == false) {
  380. nodeData[key] = QMap<QString, NodeMatrixInfo *>();
  381. }
  382. nodeData[key][nodeDataKey(info)] = info;
  383. }
  384. return true;
  385. }
  386. bool DataEvaluator::getAlgorithm(SchemePlanManager::Algorithm &algorithm) const
  387. {
  388. QList<SchemePlanManager::SchemeProcessInfo> processList;
  389. bool ret = SchemeProcessService().QueryAllByProjectIdAndIndexType(processList, m_process.projectId,
  390. m_process.indexType);
  391. if (ret == false) {
  392. return false;
  393. }
  394. for (auto process : processList) {
  395. if (process.type == SchemePlanManager::CalculateWeight) {
  396. algorithm = process.algorithm;
  397. break;
  398. }
  399. }
  400. if (m_process.type == SchemePlanManager::ImportWeightData) {
  401. if (m_process.dSource == SchemePlanManager::FromMeasurement && algorithm == SchemePlanManager::AHP) {
  402. algorithm == SchemePlanManager::Entropy;
  403. }
  404. if (m_process.dSource == SchemePlanManager::FromExpert) {
  405. algorithm == SchemePlanManager::AHP;
  406. }
  407. }
  408. return true;
  409. }
  410. bool DataEvaluator::getUserConfig(QMap<QString, double> &cfg) const
  411. {
  412. QList<UserConfig *> userCfgList;
  413. bool ret = UserConfigService().QueryUserConfigListInfoByEngineerId(&userCfgList, m_process.projectId);
  414. if (ret == false) {
  415. return false;
  416. }
  417. for (UserConfig *config : userCfgList) {
  418. cfg[QString("%1").arg(config->userId)] = config->weight / 100;
  419. }
  420. return true;
  421. }
  422. bool DataEvaluator::getWeightData(QMap<QString, double> &weightData) const
  423. {
  424. MindWeightInfo info;
  425. int indexType = m_process.indexType;
  426. if (indexType == ProjectManager::TechIndex) {
  427. indexType = ProjectManager::AbilityIndex;
  428. }
  429. bool ret = MindWeightService().queryWeightData(&info, m_process.projectId, indexType);
  430. if (ret == false) {
  431. return false;
  432. }
  433. if (info.id < 0) {
  434. qDebug() << __FUNCTION__ << __LINE__ << "未找到指标权重数据" << endl;
  435. return false;
  436. }
  437. QStringList weightList = info.weight.split(";");
  438. for (QString keyValueStr : weightList) {
  439. QStringList keyValue = keyValueStr.split(":");
  440. if (keyValue.size() == 2) {
  441. weightData[keyValue.first()] = keyValue.last().toDouble();
  442. }
  443. }
  444. return true;
  445. }
  446. bool DataEvaluator::getSchemeData(QMap<int, QMap<QString, double>> &schemeData) const
  447. {
  448. QList<SchemaEval *> schemeList;
  449. int type = m_process.indexType == ProjectManager::OptimalIndex ? 0 : 1;
  450. bool ret = SchemeInfoService().QuerySchemeInfoByEngineerId(&schemeList, m_process.projectId, type);
  451. if (ret == false) {
  452. return false;
  453. }
  454. if (schemeList.size() <= 0) {
  455. qDebug() << __FUNCTION__ << __LINE__ << "未创建方案" << endl;
  456. return false;
  457. }
  458. for (SchemaEval *scheme : schemeList) {
  459. if (schemeData.keys().contains(scheme->id) == false) {
  460. schemeData[scheme->id] = QMap<QString, double>();
  461. }
  462. QStringList keyValueStringList = scheme->valueStr.split(";");
  463. for (QString keyValueStr : keyValueStringList) {
  464. QStringList keyValue = keyValueStr.split(":");
  465. if (keyValue.size() == 2) {
  466. schemeData[scheme->id][keyValue.first()] = keyValue.last().toDouble();
  467. }
  468. }
  469. }
  470. return true;
  471. }
  472. QString DataEvaluator::nodeDataKey(NodeMatrixInfo *data) const
  473. {
  474. QString key = data->abscissa;
  475. if (data->ordinate.length() > 0) {
  476. key += ("-" + data->ordinate);
  477. }
  478. return key;
  479. }