org.reco4j.graph.INode Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of reco4j-core Show documentation

Reco4j is an open source project aims at developing a recommendation framework based on graph data sources. We choose graph databases for several reasons. They are NoSQL databases, so "schemaless". This means that it is possible to extend the basic data structure with intermediate information, i.e. similarity value between item and so on. Moreover, since every information is expressed with properties, nodes and relations, the recommendation process can be customized to work on every graph. Reco4j can be used on every graph where "user" and "item" is represented by node and the preferences are modelled as relationship between them. Current implementation leverage on Neo4j as first graph database integrated in our framework.

The newest version!

/*
 * INode.java
 * 
 * Copyright (C) 2013 Alessandro Negro 
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 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, see .
 */
package org.reco4j.graph;

import org.reco4j.model.Rating;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.concurrent.ConcurrentHashMap;
import org.apache.mahout.cf.taste.impl.common.FastIDSet;

/**
 *
 ** @author Alessandro Negro 
 */
public interface INode
{
  public long getId();
  public void setId(long id);
  public void setProperty(String name, String value);
  public String getProperty(String name);
  public Boolean isConnected(INode node, IEdgeType edgeType);
  public Boolean isConnected(INode node, List edgeTypes);
  public Boolean isConnectedIn(INode node, List edgeTypes);
  public Boolean isConnectedOut(INode node, List edgeTypes);
  public IEdge getEdge(INode node, IEdgeType edgeType);
  public List getInEdge(IEdgeType edgeType);
  public FastIDSet getInEdgeIds(IEdgeType edgeType);
  public List getOutEdge(IEdgeType edgeType);
  public void addOutEdge(IEdgeType edgeType, INode destination);
  public void addInEdge(IEdgeType edgeType, INode source);
  public void addOutEdgeWithProperty(IEdgeType edgeType, INode destination, String propertyName, Object value);
  public void addInEdgeWithProperty(IEdgeType edgeType, INode source, String propertyName, Object value);
  //
  public void iterateOnEdge(IEdgeType edgeType, IGraphCallable callback);
  public ConcurrentHashMap getCommonNodes(IEdgeType edgeType, String identifier);
  public FastIDSet getCommonNodeIds(IEdgeType edgeType);
  public void iterateOnCommonNodes(IEdgeType edgeType, IGraphCallable callback);
  public int getInEdgeNumber(IEdgeType edgeType);
  public Object getExtendedInfos();
  public void setExtendedInfos(Object infos);
  public ArrayList getRatingsFromUser(IGraphConfig config);
  public ArrayList getRatingsForItem(IGraphConfig config);
}