class
OriginalAdsorption extends Adsorption
Instance Constructors
-
new
OriginalAdsorption(g: Graph, keepTopKLabels: Int, mu1: Double, mu2: Double, mu3: Double)
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
getGraphObjective: Double
-
def
getMultiplier(vName: String, vertex: Vertex, neighName: String, neighbor: Vertex): Double
-
def
getObjective(v: Vertex): Double
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
lazy val
logger: Logger
-
final
def
ne(arg0: AnyRef): Boolean
-
def
normalizeIfNecessary(scores: TObjectDoubleHashMap[String]): Unit
-
def
normalizeScores(vertex: Vertex, scores: TObjectDoubleHashMap[String]): Unit
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
run(maxIter: Int, useBipartiteOptimization: Boolean, verbose: Boolean, resultList: ArrayList[Map[String, Double]]): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from Logging
Inherited from AnyRef
Inherited from Any
Class for the original Baluja et al algorithm, providing specific implementation details as extension of Adsorption.