* Sebastian Hammer, Adam Dickmeiss
*
* $Log: rsrel.c,v $
- * Revision 1.1 1995-09-08 14:52:42 adam
+ * Revision 1.4 1995-09-14 07:48:56 adam
+ * Other score calculation.
+ *
+ * Revision 1.3 1995/09/11 15:23:40 adam
+ * More work on relevance search.
+ *
+ * Revision 1.2 1995/09/11 13:09:41 adam
+ * More work on relevance feedback.
+ *
+ * Revision 1.1 1995/09/08 14:52:42 adam
* Work on relevance feedback.
*
*/
#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
#include <assert.h>
#include <isam.h>
int max_rec;
int no_rec;
int (*cmp)(const void *p1, const void *p2);
- void *key_buf;
- int *score_buf;
+ char *key_buf;
+ float *score_buf;
+ int *sort_idx;
struct rset_rel_rfd *rfd_list;
};
struct rset_rel_info *info;
};
+static void add_rec (struct rset_rel_info *info, double score, void *key)
+{
+ int idx, i, j;
+
+ logf (LOG_DEBUG, "add %f", score);
+ for (i = 0; i<info->no_rec; i++)
+ {
+ idx = info->sort_idx[i];
+ if (score <= info->score_buf[idx])
+ break;
+ }
+ if (info->no_rec < info->max_rec)
+ {
+ for (j = info->no_rec; j > i; --j)
+ info->sort_idx[j] = info->sort_idx[j-1];
+ idx = info->sort_idx[j] = info->no_rec;
+ ++(info->no_rec);
+ }
+ else if (i == 0)
+ return;
+ else
+ {
+ idx = info->sort_idx[0];
+
+ --i;
+ for (j = 0; j < i; ++j)
+ info->sort_idx[j] = info->sort_idx[j+1];
+ info->sort_idx[j] = idx;
+ }
+ memcpy (info->key_buf + idx*info->key_size, key, info->key_size);
+ info->score_buf[idx] = score;
+}
+
static void relevance (struct rset_rel_info *info, rset_relevance_parms *parms)
{
- char *isam_buf;
+ char **isam_buf;
+ char *isam_tmp_buf;
int *isam_r;
+ int *max_tf;
ISPT *isam_pt;
+ double *wgt;
int i;
- isam_buf = xmalloc (info->key_size * parms->no_isam_positions);
+ logf (LOG_DEBUG, "relevance");
+ isam_buf = xmalloc (parms->no_isam_positions * sizeof(*isam_buf));
isam_r = xmalloc (sizeof (*isam_r) * parms->no_isam_positions);
isam_pt = xmalloc (sizeof (*isam_pt) * parms->no_isam_positions);
+ isam_tmp_buf = xmalloc (info->key_size);
+ max_tf = xmalloc (sizeof (*max_tf) * parms->no_isam_positions);
+ wgt = xmalloc (sizeof (*wgt) * parms->no_isam_positions);
for (i = 0; i<parms->no_isam_positions; i++)
{
+ isam_buf[i] = xmalloc (info->key_size);
isam_pt[i] = is_position (parms->is, parms->isam_positions[i]);
- isam_r[i] = is_readkey (isam_pt[i], isam_buf + i*info->key_size);
+ max_tf [i] = is_numkeys (isam_pt[i]);
+ isam_r[i] = is_readkey (isam_pt[i], isam_buf[i]);
+ logf (LOG_DEBUG, "max tf %d = %d", i, max_tf[i]);
}
+ while (1)
+ {
+ int min = -1, i;
+ double score;
+ /* find min with lowest sysno */
+ for (i = 0; i<parms->no_isam_positions; i++)
+ if (isam_r[i] &&
+ (min < 0 || (*parms->cmp)(isam_buf[i], isam_buf[min]) < 1))
+ min = i;
+ if (min < 0)
+ break;
+ memcpy (isam_tmp_buf, isam_buf[min], info->key_size);
+ /* calculate for all with those sysno */
+ for (i = 0; i<parms->no_isam_positions; i++)
+ {
+ int r;
+
+ if (isam_r[i])
+ r = (*parms->cmp)(isam_buf[i], isam_tmp_buf);
+ else
+ r = 2;
+ if (r > 1 || r < -1)
+ wgt[i] = 0.0;
+ else
+ {
+ int tf = 0;
+ do
+ {
+ tf++;
+ isam_r[i] = is_readkey (isam_pt[i], isam_buf[i]);
+ } while (isam_r[i] &&
+ (*parms->cmp)(isam_buf[i], isam_tmp_buf) <= 1);
+ wgt[i] = 0.1+tf*0.9/max_tf[i];
+ }
+ }
+ /* calculate relevance value */
+ score = 0.0;
+ for (i = 0; i<parms->no_isam_positions; i++)
+ score += wgt[i];
+ /* if value is in the top score, then save it - don't emit yet */
+ add_rec (info, score, isam_tmp_buf);
+ }
for (i = 0; i<parms->no_isam_positions; i++)
+ {
is_pt_free (isam_pt[i]);
+ xfree (isam_buf[i]);
+ }
+ xfree (max_tf);
+ xfree (isam_tmp_buf);
xfree (isam_buf);
xfree (isam_r);
xfree (isam_pt);
+ xfree (wgt);
}
static rset_control *r_create (const struct rset_control *sel, void *parms)
info->key_buf = xmalloc (info->key_size * info->max_rec);
info->score_buf = xmalloc (sizeof(*info->score_buf) * info->max_rec);
+ info->sort_idx = xmalloc (sizeof(*info->sort_idx) * info->max_rec);
info->no_rec = 0;
info->rfd_list = NULL;
rfd = xmalloc (sizeof(*rfd));
rfd->next = info->rfd_list;
info->rfd_list = rfd;
- rfd->position = 0;
+ rfd->position = info->no_rec;
rfd->info = info;
return rfd;
}
assert (info->rfd_list == NULL);
xfree (info->key_buf);
xfree (info->score_buf);
+ xfree (info->sort_idx);
xfree (info);
xfree (ct);
}
static void r_rewind (RSFD rfd)
{
- ((struct rset_rel_rfd*) rfd)->position = 0;
+ struct rset_rel_rfd *p = rfd;
+ struct rset_rel_info *info = p->info;
+
+ p->position = info->no_rec;
}
static int r_count (rset_control *ct)
struct rset_rel_rfd *p = rfd;
struct rset_rel_info *info = p->info;
- if (p->position >= info->max_rec)
+ if (p->position <= 0)
return 0;
- memcpy ((char*) buf + sizeof(*info->score_buf),
- (char*) info->key_buf + info->key_size * p->position,
- info->key_size);
+ --(p->position);
+ logf (LOG_DEBUG, "score: %f",
+ info->score_buf[info->sort_idx[p->position]]);
memcpy ((char*) buf,
- info->score_buf + p->position, sizeof(*info->score_buf));
- ++(p->position);
+ info->key_buf + info->key_size * info->sort_idx[p->position],
+ info->key_size);
return 1;
}