Class CountThresholdSelectionMechanism<U extends java.io.Serializable,​I extends java.io.Serializable,​P>

java.lang.Object
es.uam.eps.ir.relison.diffusion.selections.AbstractSelectionMechanism<U,​I,​P>
es.uam.eps.ir.relison.diffusion.selections.CountSelectionMechanism<U,​I,​P>
es.uam.eps.ir.relison.diffusion.selections.CountThresholdSelectionMechanism<U,​I,​P>
Type Parameters:
U - type of the users.
I - type of the information pieces.
P - type of the parameters.
All Implemented Interfaces:
SelectionMechanism<U,​I,​P>

public class CountThresholdSelectionMechanism<U extends java.io.Serializable,​I extends java.io.Serializable,​P>
extends CountSelectionMechanism<U,​I,​P>
Selection mechanism that only propagates those received pieces which have been received (at least) a fixed number of times. It propagates any information piece that the user has received at least such amount of times.

Reference: D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network, KDD 2003, pp. 137–146 (2003).

  • Field Details

    • threshold

      private final int threshold
      Number of users that transmit an information piece before a user chooses to share it.
  • Constructor Details

    • CountThresholdSelectionMechanism

      public CountThresholdSelectionMechanism​(int numOwn, int threshold)
      Constructor.
      Parameters:
      numOwn - number of own pieces to propagate.
      threshold - number of users that transmit an information piece before a user chooses to share it.
    • CountThresholdSelectionMechanism

      public CountThresholdSelectionMechanism​(int numOwn, int threshold, int numRepr)
      Constructor.
      Parameters:
      numOwn - number of own pieces to propagate.
      threshold - number of users that transmit an information piece before a user chooses to share it.
      numRepr - number of already propagated pieces to repropagate.
  • Method Details