Efficient calculation of node proximity on graphs with side information

, and
US Patent 8,346,766
, (Granted)
Abstract. In a computerized data mining context, user input relating to positive and negative information is incorporated into node proximity measurements on a weighted, directed graph. Random walk results are updated without a full matrix inversion by using selective update to a low rank approximation and to inversion results.