Methods
|
|
|
|
__allVoteNo
|
__allVoteNo (
self,
flist,
arg,
)
Returns true if all the functions in list flist evaluate to false given the
arguement arg
|
|
__allVoteYes
|
__allVoteYes (
self,
flist,
arg,
)
Returns true if all the functions in list flist evaluate to true given the
arguement arg.
|
|
__init__
|
__init__ (
self,
dataset=None,
parameters=None,
algorithm=None,
)
|
|
algoTerminator
|
algoTerminator ( self )
|
|
buildHierarchy
|
buildHierarchy ( self, algorithm )
buildHierarchy(algorithm)
Build the Hierarchical tree in an interative manner. The root node
is set to the algorithm provided and a pre-order iterator is invoked
on the root node. Now for each node the iterator returns, run the
algorithm, append the child nodes and take the .next() node from the
iterator.
This approach amounts to staying one step ahead of the iterator while
building the tree and letting the iterator do the work of keeping track
of the nodes visited.
|
|
clear
|
clear ( self )
|
|
clusterNumTerminator
|
clusterNumTerminator ( self )
|
|
copy
|
copy ( self )
|
|
falseTerminator
|
falseTerminator ( self )
|
|
getLabeling
|
getLabeling ( self )
|
|
getModel
|
getModel ( self )
|
|
labelingTerminator
|
labelingTerminator ( self )
|
|
run
|
run ( self )
run()
Takes the given dataset and passes it off to some ML_Algorithm. Once that
algorithm returns, each cluster is passed off again. This continues until
a termination condition is reached or the ML_Algorithm fails for some
reason.
|
|
trueTerminator
|
trueTerminator ( self )
|
|
validate
|
validate ( self )
validate()
Ensures that all parameters and environment variables nescessary
to run the clustering algorithm (Hierarchical) are defined.
|