Changeset 64 for trunk/CrossPare/src/de/ugoe/cs/cpdp/dataprocessing/TransferComponentAnalysis.java

Timestamp:

04/28/16 16:51:59 (9 years ago)

Author:

sherbold

Message:

• added some new approaches

File:

• trunk/CrossPare/src/de/ugoe/cs/cpdp/dataprocessing/TransferComponentAnalysis.java (modified) (4 diffs)

trunk/CrossPare/src/de/ugoe/cs/cpdp/dataprocessing/TransferComponentAnalysis.java

@@ -25 +25 @@
 import org.ojalgo.array.Array1D;
 
+import de.ugoe.cs.cpdp.util.SortUtils;
 import de.ugoe.cs.util.console.Console;
 import weka.core.Attribute;
@@ -89 +90 @@
         Array1D<ComplexNumber> eigenvaluesArray = eigenvalueDecomposition.getEigenvalues();
         System.out.println(eigenvaluesArray.length);
-        final double[] eigenvalues = new double[(int) eigenvaluesArray.length];
+        final Double[] eigenvalues = new Double[(int) eigenvaluesArray.length];
         final int[] index = new int[(int) eigenvaluesArray.length];
         // create kernel transformation matrix from eigenvectors
@@ -96 +97 @@
             index[i] = i;
         }
-        quicksort(eigenvalues, index);
+        SortUtils.quicksort(eigenvalues, index);
 
         final PrimitiveMatrix transformedKernel = kernelMatrix.multiplyRight(eigenvalueDecomposition
@@ -218 +219 @@
         return muMatrix.build();
     }
-
-    // below is from http://stackoverflow.com/a/1040503
-    private static void quicksort(double[] main, int[] index) {
-        quicksort(main, index, 0, index.length - 1);
-    }
-
-    // quicksort a[left] to a[right]
-    private static void quicksort(double[] a, int[] index, int left, int right) {
-        if (right <= left)
-            return;
-        int i = partition(a, index, left, right);
-        quicksort(a, index, left, i - 1);
-        quicksort(a, index, i + 1, right);
-    }
-
-    // partition a[left] to a[right], assumes left < right
-    private static int partition(double[] a, int[] index, int left, int right) {
-        int i = left - 1;
-        int j = right;
-        while (true) {
-            while (less(a[++i], a[right])) // find item on left to swap
-            ; // a[right] acts as sentinel
-            while (less(a[right], a[--j])) // find item on right to swap
-                if (j == left)
-                    break; // don't go out-of-bounds
-            if (i >= j)
-                break; // check if pointers cross
-            exch(a, index, i, j); // swap two elements into place
-        }
-        exch(a, index, i, right); // swap with partition element
-        return i;
-    }
-
-    // is x < y ?
-    private static boolean less(double x, double y) {
-        return (x < y);
-    }
-
-    // exchange a[i] and a[j]
-    private static void exch(double[] a, int[] index, int i, int j) {
-        double swap = a[i];
-        a[i] = a[j];
-        a[j] = swap;
-        int b = index[i];
-        index[i] = index[j];
-        index[j] = b;
-    }
 }