1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
|
/*
* Copyright (C) 2013, 2014, 2015 by the Konclude Developer Team.
*
* This file is part of the reasoning system Konclude.
* For details and support, see <http://konclude.com/>.
*
* Konclude is free software: you can redistribute it and/or modify it under
* the terms of version 2.1 of the GNU Lesser General Public License (LGPL2.1)
* as published by the Free Software Foundation.
*
* You should have received a copy of the GNU Lesser General Public License
* along with Konclude. If not, see <http://www.gnu.org/licenses/>.
*
* Konclude is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. For more
* details, see GNU Lesser General Public License.
*
*/
#include "CClassificationManager.h"
namespace Konclude {
namespace Reasoner {
namespace Classifier {
CClassificationManager::CClassificationManager() {
}
CClassificationManager::~CClassificationManager() {
if (classifierFac) {
delete classifierFac;
}
}
cint64 CClassificationManager::getActiveClassifierCount() {
readWriteLock.lockForRead();
cint64 activeCount = 0;
foreach (CSubsumptionClassifier* classifier, ontoClassifierSet) {
CSubsumptionClassifierThread* threadClassifier = dynamic_cast<CSubsumptionClassifierThread*>(classifier);
if (threadClassifier && threadClassifier->isClassifierActive()) {
++activeCount;
}
}
readWriteLock.unlock();
return activeCount;
}
CClassificationManager *CClassificationManager::initializeManager(CSubsumptionClassifierFactory *takeClassifierFactory, CConfigurationProvider *configurationProvider) {
classifierFac = takeClassifierFactory;
return this;
}
CSubsumptionClassifier *CClassificationManager::getClassifier(CConcreteOntology *ontology, CConfigurationBase *config, bool create, bool backgroundClassification) {
readWriteLock.lockForRead();
CSubsumptionClassifier *classifier = ontoClassifierHash.value(ontology);
readWriteLock.unlock();
if (!classifier) {
readWriteLock.lockForWrite();
classifier = ontoClassifierHash.value(ontology);
if (!classifier) {
classifier = classifierFac->createClassifier(ontology,config);
ontoClassifierSet.insert(classifier);
ontoClassifierHash.insert(ontology,classifier);
}
readWriteLock.unlock();
}
return classifier;
}
CClassifierStatistics *CClassificationManager::collectClassificationStatistics(CClassifierStatistics *statistics) {
statistics->resetValues();
readWriteLock.lockForRead();
foreach (CSubsumptionClassifier *classifier, ontoClassifierSet) {
CClassifierStatistics *classifierStatistics = classifier->getClassificationStatistics();
statistics->appendStatistics(classifierStatistics);
}
readWriteLock.unlock();
return statistics;
}
QList<CSubsumptionClassifier *> CClassificationManager::getClassifierList() {
readWriteLock.lockForRead();
QList<CSubsumptionClassifier *> list(ontoClassifierSet.values());
readWriteLock.unlock();
return list;
}
CClassificationProgress* CClassificationManager::getClassificationProgress() {
CClassificationProgress newClassProg;
readWriteLock.lockForRead();
double percentAvg = 0;
cint64 percentCount = 0;
foreach (CSubsumptionClassifier *classifier, ontoClassifierSet) {
CClassificationProgress* classificationProgress = classifier->getClassificationProgress();
if (classificationProgress) {
newClassProg.setTotalClasses(newClassProg.getTotalClasses()+classificationProgress->getTotalClasses());
newClassProg.setClassificationCount(newClassProg.getClassificationCount()+classificationProgress->getClassificationCount());
newClassProg.setTestedClasses(newClassProg.getTestedClasses()+classificationProgress->getTestedClasses());
newClassProg.setTestedSubsumptions(newClassProg.getTestedSubsumptions()+classificationProgress->getTestedSubsumptions());
newClassProg.setTotalSubsumptions(newClassProg.getTotalSubsumptions()+classificationProgress->getTotalSubsumptions());
newClassProg.setRemainingMilliSeconds(qMax(newClassProg.getRemainingMilliSeconds(),classificationProgress->getRemainingMilliSeconds()));
percentAvg += classificationProgress->getProgessPercent();
++percentCount;
}
}
readWriteLock.unlock();
if (percentCount != 0) {
percentAvg /= (double)percentCount;
}
newClassProg.setProgessPercent(percentAvg);
mClassificationProgress = newClassProg;
return &mClassificationProgress;
}
}; // end namespace Classifier
}; // end namespace Reasoner
}; // end namespace Konclude
|
