All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.lenskit.knn.item.model.SparseNeighborIterationStrategy Maven / Gradle / Ivy

There is a newer version: 3.0-T5
Show newest version
/*
 * LensKit, an open source recommender systems toolkit.
 * Copyright 2010-2014 LensKit Contributors.  See CONTRIBUTORS.md.
 * Work on LensKit has been funded by the National Science Foundation under
 * grants IIS 05-34939, 08-08692, 08-12148, and 10-17697.
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as
 * published by the Free Software Foundation; either version 2.1 of the
 * License, or (at your option) any later version.
 *
 * This program 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. See the GNU General Public License for more
 * details.
 *
 * You should have received a copy of the GNU General Public License along with
 * this program; if not, write to the Free Software Foundation, Inc., 51
 * Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
 */
package org.lenskit.knn.item.model;

import it.unimi.dsi.fastutil.longs.LongIterator;

/**
 * Neighbor iteration strategy that looks at the items co-rated with the specified item.  It may
 * return more than those items, however, if it looks like it might be faster to not filter.
 *
 * @since 2.1
 * @author GroupLens Research
 */
public class SparseNeighborIterationStrategy implements NeighborIterationStrategy {
    @Override
    public LongIterator neighborIterator(ItemItemBuildContext context, long item, boolean onlyAfter) {
        long lowerBound = onlyAfter ? item : Long.MIN_VALUE;
        return new AdaptiveSparseItemIterator(context, context.itemVector(item).keySet(), lowerBound);
    }
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy