-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathClassAssignment.c
More file actions
207 lines (194 loc) · 8.19 KB
/
Copy pathClassAssignment.c
File metadata and controls
207 lines (194 loc) · 8.19 KB
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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
// CLASCAL (ClassAssignment.c)
//
// Copyright (c) 2010 by John Ashley Burgoyne and the Royal Institute for the
// Advancement of Learning (McGill University). All rights reserved.
//
// This source is adapted from Suzanne Winsberg's CLASCAL, version 7.01 (May
// 1993), written in FORTRAN 77.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// 1. Redistributions of source code must retain the above copyright notice,
// this list of conditions, and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions, and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// 3. Neither the name of McGill University nor the names of its contributors
// may be used to endorse or promote products derived from this software
// without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
#include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <Accelerate/Accelerate.h>
#include "inlines.h"
#include "StimulusSet.h"
#include "_StimulusSet.h"
#include "SubjectSet.h"
#include "Model.h"
#include "ClassAssignment.h"
#include "_ClassAssignment.h"
struct _ClassAssignment {
const SubjectSet * restrict subjectSet;
const Model * restrict model;
double * restrict conditionalDistributions;
size_t distributionsSize;
double * restrict classSizes;
double * restrict unconditionalDistribution;
};
static double * NewClassSizes(ClassAssignment * restrict self)
{
const size_t classCount = ClassCount(self->model);
if (!classCount) return NULL;
const size_t subjectCount = SubjectCount(self->subjectSet);
if (!subjectCount) return NULL;
double * restrict classSizes = SafeCalloc(classCount, sizeof(double));
for (size_t i = 0; i < subjectCount; i++)
cblas_daxpy((int)classCount,
1.0,
self->conditionalDistributions + classCount * i,
1,
classSizes,
1);
return classSizes;
}
/*
* N.B.: This function may only be called after class sizes have been
* initialised.
*/
static double * NewUnconditionalDist(const ClassAssignment * restrict self)
{
if (!self->classSizes) return NULL;
const size_t classCount = ClassCount(self->model);
if (!classCount) return NULL;
const size_t subjectCount = SubjectCount(self->subjectSet);
if (!subjectCount) return NULL;
const double scalingFactor = 1.0 / (double)subjectCount;
double * restrict unconditionalDistribution;
unconditionalDistribution = SafeMalloc(classCount, sizeof(double));
cblas_dcopy((int)classCount,
self->classSizes,
1,
unconditionalDistribution,
1);
cblas_dscal((int)classCount,
scalingFactor,
unconditionalDistribution,
1);
return unconditionalDistribution;
}
static double *
NewNormalisedDistributions(const ClassAssignment * restrict self,
const double * restrict distributions)
{
const size_t subjectCount = SubjectCount(self->subjectSet);
const size_t classCount = ClassCount(self->model);
double * restrict normalisedDistributions;
normalisedDistributions = SafeMalloc(self->distributionsSize,
sizeof(double));
cblas_dcopy((int)self->distributionsSize,
distributions,
1,
normalisedDistributions,
1);
for (size_t i = 0; i < subjectCount; i++) {
// N.B.: All values must be non-negative.
const double sum = cblas_dasum((int)classCount,
(normalisedDistributions
+ classCount * i),
1);
cblas_dscal((int)classCount,
1.0 / sum,
normalisedDistributions + classCount * i,
1);
}
return normalisedDistributions;
}
ClassAssignment * NewClassAssignment(const SubjectSet * restrict subjectSet,
const Model * restrict model,
const double * restrict distributions)
{
if (!subjectSet || !model) return NULL;
const size_t distributionsSize = SizeProduct(SubjectCount(subjectSet),
ClassCount(model));
if (!distributionsSize) return NULL;
if (!IsConvertibleToInt(distributionsSize))
ExitWithError("Too many classes to assign subjects");
ClassAssignment * restrict self;
if ((self = malloc(sizeof(ClassAssignment)))) {
self->subjectSet = subjectSet;
self->model = model;
self->distributionsSize = distributionsSize;
if (distributions) {
double * restrict normDists;
normDists = NewNormalisedDistributions(self,
distributions);
self->conditionalDistributions = normDists;
} else {
double * restrict evenDists;
evenDists = SafeMalloc(distributionsSize,
sizeof(double));
for (size_t i = 0; i < distributionsSize; i++)
evenDists[i] = 1.0;
double * restrict normDists;
normDists = NewNormalisedDistributions(self, evenDists);
self->conditionalDistributions = normDists;
FreeAndClear(evenDists);
}
self->classSizes = NewClassSizes(self);
self->unconditionalDistribution = NewUnconditionalDist(self);
}
return self;
}
void DeleteClassAssignment(ClassAssignment * restrict self)
{
if (self) {
FreeAndClear(self->unconditionalDistribution);
FreeAndClear(self->classSizes);
FreeAndClear(self->conditionalDistributions);
FreeAndClear(self);
}
}
const SubjectSet *
ClassAssignmentSubjectSet(const ClassAssignment * restrict self)
{
return self ? self->subjectSet : NULL;
}
const Model * ClassAssignmentModel(const ClassAssignment * restrict self)
{
return self ? self->model : NULL;
}
const double * SubjectClassDistributions(const ClassAssignment * restrict self)
{
return self ? self->conditionalDistributions : NULL;
}
const double * ClassSizes(const ClassAssignment * restrict self)
{
return self ? self->classSizes : NULL;
}
const double *
UnconditionalClassDistribution(const ClassAssignment * restrict self)
{
return self ? self->unconditionalDistribution : NULL;
}
size_t DistributionsSize(const ClassAssignment * restrict self)
{
return self ? self->distributionsSize : 0;
}