2020-12-10 19:04:33 +01:00
|
|
|
from sklearn.linear_model import LogisticRegression
|
|
|
|
from sklearn.svm import LinearSVC
|
|
|
|
import quapy as qp
|
|
|
|
import quapy.functional as F
|
2020-12-14 18:36:19 +01:00
|
|
|
import sys
|
2020-12-10 19:04:33 +01:00
|
|
|
|
2020-12-14 18:36:19 +01:00
|
|
|
#qp.datasets.fetch_reviews('hp')
|
|
|
|
#qp.datasets.fetch_twitter('sst')
|
|
|
|
|
|
|
|
#sys.exit()
|
2020-12-10 19:08:22 +01:00
|
|
|
|
2020-12-10 19:04:33 +01:00
|
|
|
SAMPLE_SIZE=500
|
|
|
|
binary = False
|
2020-12-11 19:28:17 +01:00
|
|
|
svmperf_home = './svm_perf_quantification'
|
2020-12-10 19:04:33 +01:00
|
|
|
|
|
|
|
if binary:
|
2020-12-14 18:36:19 +01:00
|
|
|
dataset = qp.datasets.fetch_reviews('kindle', tfidf=True, min_df=5)
|
2020-12-10 19:04:33 +01:00
|
|
|
|
|
|
|
else:
|
2020-12-14 18:36:19 +01:00
|
|
|
dataset = qp.datasets.fetch_twitter('semeval13', model_selection=False, min_df=10)
|
2020-12-11 19:28:17 +01:00
|
|
|
dataset.training = dataset.training.sampling(SAMPLE_SIZE, 0.2, 0.5, 0.3)
|
|
|
|
|
|
|
|
print('dataset loaded')
|
2020-12-10 19:04:33 +01:00
|
|
|
|
|
|
|
# training a quantifier
|
|
|
|
learner = LogisticRegression()
|
2020-12-11 19:28:17 +01:00
|
|
|
# model = qp.method.aggregative.ClassifyAndCount(learner)
|
2020-12-10 19:04:33 +01:00
|
|
|
# model = qp.method.aggregative.AdjustedClassifyAndCount(learner)
|
|
|
|
# model = qp.method.aggregative.ProbabilisticClassifyAndCount(learner)
|
|
|
|
# model = qp.method.aggregative.ProbabilisticAdjustedClassifyAndCount(learner)
|
|
|
|
# model = qp.method.aggregative.ExpectationMaximizationQuantifier(learner)
|
2020-12-11 19:28:17 +01:00
|
|
|
# model = qp.method.aggregative.ExplicitLossMinimisationBinary(svmperf_home, loss='q', C=100)
|
|
|
|
model = qp.method.aggregative.SVMQ(svmperf_home, C=1)
|
|
|
|
|
|
|
|
if not binary:
|
|
|
|
model = qp.method.aggregative.OneVsAll(model)
|
2020-12-09 12:46:50 +01:00
|
|
|
|
2020-12-11 19:28:17 +01:00
|
|
|
print('fitting model')
|
2020-12-10 19:04:33 +01:00
|
|
|
model.fit(dataset.training)
|
|
|
|
|
2020-12-11 19:28:17 +01:00
|
|
|
|
2020-12-10 19:04:33 +01:00
|
|
|
# estimating class prevalences
|
2020-12-11 19:28:17 +01:00
|
|
|
print('quantifying')
|
2020-12-10 19:04:33 +01:00
|
|
|
prevalences_estim = model.quantify(dataset.test.instances)
|
|
|
|
prevalences_true = dataset.test.prevalence()
|
|
|
|
|
|
|
|
# evaluation (one single prediction)
|
|
|
|
error = qp.error.mae(prevalences_true, prevalences_estim)
|
|
|
|
|
|
|
|
print(f'method {model.__class__.__name__}')
|
|
|
|
|
|
|
|
print(f'Evaluation in test (1 eval)')
|
|
|
|
print(f'true prevalence {F.strprev(prevalences_true)}')
|
|
|
|
print(f'estim prevalence {F.strprev(prevalences_estim)}')
|
|
|
|
print(f'mae={error:.3f}')
|
|
|
|
|
|
|
|
|
2020-12-11 19:28:17 +01:00
|
|
|
max_evaluations = 5000
|
|
|
|
n_prevpoints = F.get_nprevpoints_approximation(combinations_budget=max_evaluations, n_classes=dataset.n_classes)
|
|
|
|
n_evaluations = F.num_prevalence_combinations(n_prevpoints, dataset.n_classes)
|
2020-12-14 18:36:19 +01:00
|
|
|
print(f'the prevalence interval [0,1] will be split in {n_prevpoints} prevalence points for each class, so that\n'
|
|
|
|
f'the requested maximum number of sample evaluations ({max_evaluations}) is not exceeded.\n'
|
2020-12-11 19:28:17 +01:00
|
|
|
f'For the {dataset.n_classes} classes this dataset has, this will yield a total of {n_evaluations} evaluations.')
|
|
|
|
|
|
|
|
true_prev, estim_prev = qp.evaluation.artificial_sampling_prediction(model, dataset.test, SAMPLE_SIZE, n_prevpoints)
|
|
|
|
|
|
|
|
qp.error.SAMPLE_SIZE = SAMPLE_SIZE
|
2020-12-10 19:04:33 +01:00
|
|
|
print(f'Evaluation according to the artificial sampling protocol ({len(true_prev)} evals)')
|
|
|
|
for error in qp.error.QUANTIFICATION_ERROR:
|
|
|
|
score = error(true_prev, estim_prev)
|
|
|
|
print(f'{error.__name__}={score:.5f}')
|
2020-12-10 19:08:22 +01:00
|
|
|
|