|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectde.unibi.techfak.jpredictor.clustering.Clustering
de.unibi.techfak.jpredictor.clustering.ForwardClustering
public class ForwardClustering
This agglomerative clustering strategy builds up clusters beforehand, and decides by means of the threshold whether a cluster can be accepted or not. Nevertheless, of all accepted clusters the best is built first (like in the greedy approach).
| Field Summary | |
|---|---|
(package private) double[][] |
forwardRelation
The values of the forward relation measure. |
(package private) double |
lastRelation
The normalized overall-in-cluster relation measure from the last clustering step. |
| Fields inherited from class de.unibi.techfak.jpredictor.clustering.Clustering |
|---|
clusters, comm, consensus, mma, n, nucleotideVector, sma |
| Constructor Summary | |
|---|---|
ForwardClustering(ICommunicator comm,
SingleMotifAlignment sma,
MultiMotifAlignment mma)
Inits the forward clustering. |
|
| Method Summary | |
|---|---|
(package private) void |
clusterStep()
The second step in the clustering loop. |
private double |
computeInClusterRelation(Motif m,
MotifList ml)
Computes the in-cluster relationship, which is the summed-up relation measure of all motifs in the cluster against their representative. |
(package private) void |
initClustering()
Inits the clustering. |
(package private) boolean |
stopTest(double threshold,
int clusternumber)
The first step in the clustering loop. |
| Methods inherited from class de.unibi.techfak.jpredictor.clustering.Clustering |
|---|
alignMotifs, outputResults, setMotifList, start |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
|---|
double[][] forwardRelation
The values of the forward relation measure. The values in here reflect the relation measure in case the two clusters would have been combined. The diagonal values (row index equal to column index) have a special meaning here as they reflect the relation measure for the corresponding cluster.
Let the number of motifs in the motif list be n. Then the length of
the matrix would be n. Its arrays vary in length. The first, with
index zero, has length 1. The second, index 1, has length 2, and so
forth. The last array, index n-1, has length n. The matrix is
therefore build up as a triangle. If two clusters are combined to one
their respective row and column entries are deleted. Unused entries,
or invalid entries, are set to null (Double.NaN
).
double lastRelation
| Constructor Detail |
|---|
public ForwardClustering(ICommunicator comm,
SingleMotifAlignment sma,
MultiMotifAlignment mma)
throws java.lang.NullPointerException
Clustering class.
java.lang.NullPointerException| Method Detail |
|---|
private double computeInClusterRelation(Motif m,
MotifList ml)
m - The representative of the cluster.ml - The cluster consisting of several motifs.
void initClustering()
Clusteringstart(double, int) to be called.
initClustering in class ClusteringClustering.start(double, int)
void clusterStep()
throws java.lang.IllegalStateException
Clustering
clusterStep in class Clusteringjava.lang.IllegalStateException - If a clustering could not be performed
due to some reason.
boolean stopTest(double threshold,
int clusternumber)
Clustering
stopTest in class Clusteringthreshold - The threshold to end the clustering. Might be
Double.NaN to indicate, that the clustering should continue
fully.clusternumber - The number of clusters wished. Give zero or -1
to have a full clustering.
true if the clustering has to stop, false
otherwise.
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||