Java Code Examples for cern.colt.matrix.DoubleMatrix1D#viewSelection()
The following examples show how to use
cern.colt.matrix.DoubleMatrix1D#viewSelection() .
You can vote up the ones you like or vote down the ones you don't like,
and go to the original project or source file by following the links above each example. You may check out the related API usage on the sidebar.
Example 1
| Source File: Statistic.java From database with GNU General Public License v2.0 | 6 votes |
|
/**
Constructs and returns a sampling view with a size of <tt>round(matrix.size() * fraction)</tt>.
Samples "without replacement" from the uniform distribution.
@param matrix any matrix.
@param rowFraction the percentage of rows to be included in the view.
@param columnFraction the percentage of columns to be included in the view.
@param randomGenerator a uniform random number generator; set this parameter to <tt>null</tt> to use a default generator seeded with the current time.
@return the sampling view.
@throws IllegalArgumentException if <tt>! (0 <= rowFraction <= 1 && 0 <= columnFraction <= 1)</tt>.
@see cern.jet.random.sampling.RandomSampler
*/
public static DoubleMatrix1D viewSample(DoubleMatrix1D matrix, double fraction, RandomEngine randomGenerator) {
// check preconditions and allow for a little tolerance
double epsilon = 1e-09;
if (fraction < 0 - epsilon || fraction > 1 + epsilon) throw new IllegalArgumentException();
if (fraction < 0) fraction = 0;
if (fraction > 1) fraction = 1;
// random generator seeded with current time
if (randomGenerator==null) randomGenerator = new cern.jet.random.engine.MersenneTwister((int) System.currentTimeMillis());
int ncols = (int) Math.round(matrix.size() * fraction);
int max = ncols;
long[] selected = new long[max]; // sampler works on long's, not int's
// sample
int n = ncols;
int N = matrix.size();
cern.jet.random.sampling.RandomSampler.sample(n,N,n,0,selected,0,randomGenerator);
int[] selectedCols = new int[n];
for (int i=0; i<n; i++) selectedCols[i] = (int) selected[i];
return matrix.viewSelection(selectedCols);
}
Example 2
| Source File: Statistic.java From jAudioGIT with GNU Lesser General Public License v2.1 | 6 votes |
|
/**
Constructs and returns a sampling view with a size of <tt>round(matrix.size() * fraction)</tt>.
Samples "without replacement" from the uniform distribution.
@param matrix any matrix.
@param rowFraction the percentage of rows to be included in the view.
@param columnFraction the percentage of columns to be included in the view.
@param randomGenerator a uniform random number generator; set this parameter to <tt>null</tt> to use a default generator seeded with the current time.
@return the sampling view.
@throws IllegalArgumentException if <tt>! (0 <= rowFraction <= 1 && 0 <= columnFraction <= 1)</tt>.
@see cern.jet.random.sampling.RandomSampler
*/
public static DoubleMatrix1D viewSample(DoubleMatrix1D matrix, double fraction, RandomEngine randomGenerator) {
// check preconditions and allow for a little tolerance
double epsilon = 1e-09;
if (fraction < 0 - epsilon || fraction > 1 + epsilon) throw new IllegalArgumentException();
if (fraction < 0) fraction = 0;
if (fraction > 1) fraction = 1;
// random generator seeded with current time
if (randomGenerator==null) randomGenerator = new cern.jet.random.engine.MersenneTwister((int) System.currentTimeMillis());
int ncols = (int) Math.round(matrix.size() * fraction);
int max = ncols;
long[] selected = new long[max]; // sampler works on long's, not int's
// sample
int n = ncols;
int N = matrix.size();
cern.jet.random.sampling.RandomSampler.sample(n,N,n,0,selected,0,randomGenerator);
int[] selectedCols = new int[n];
for (int i=0; i<n; i++) selectedCols[i] = (int) selected[i];
return matrix.viewSelection(selectedCols);
}
Example 3
| Source File: Sorting.java From database with GNU General Public License v2.0 | 4 votes |
|
/**
Sorts the vector into ascending order, according to the <i>natural ordering</i>.
The returned view is backed by this matrix, so changes in the returned view are reflected in this matrix, and vice-versa.
To sort ranges use sub-ranging views. To sort descending, use flip views ...
<p>
<b>Example:</b>
<table border="1" cellspacing="0">
<tr nowrap>
<td valign="top"><tt> 7, 1, 3, 1<br>
</tt></td>
<td valign="top">
<p><tt> ==> 1, 1, 3, 7<br>
The vector IS NOT SORTED.<br>
The new VIEW IS SORTED.</tt></p>
</td>
</tr>
</table>
@param vector the vector to be sorted.
@return a new sorted vector (matrix) view.
<b>Note that the original matrix is left unaffected.</b>
*/
public DoubleMatrix1D sort(final DoubleMatrix1D vector) {
int[] indexes = new int[vector.size()]; // row indexes to reorder instead of matrix itself
for (int i=indexes.length; --i >= 0; ) indexes[i] = i;
IntComparator comp = new IntComparator() {
public int compare(int a, int b) {
double av = vector.getQuick(a);
double bv = vector.getQuick(b);
if (av!=av || bv!=bv) return compareNaN(av,bv); // swap NaNs to the end
return av<bv ? -1 : (av==bv ? 0 : 1);
}
};
runSort(indexes,0,indexes.length,comp);
return vector.viewSelection(indexes);
}
Example 4
| Source File: Sorting.java From jAudioGIT with GNU Lesser General Public License v2.1 | 4 votes |
|
/**
Sorts the vector into ascending order, according to the <i>natural ordering</i>.
The returned view is backed by this matrix, so changes in the returned view are reflected in this matrix, and vice-versa.
To sort ranges use sub-ranging views. To sort descending, use flip views ...
<p>
<b>Example:</b>
<table border="1" cellspacing="0">
<tr nowrap>
<td valign="top"><tt> 7, 1, 3, 1<br>
</tt></td>
<td valign="top">
<p><tt> ==> 1, 1, 3, 7<br>
The vector IS NOT SORTED.<br>
The new VIEW IS SORTED.</tt></p>
</td>
</tr>
</table>
@param vector the vector to be sorted.
@return a new sorted vector (matrix) view.
<b>Note that the original matrix is left unaffected.</b>
*/
public DoubleMatrix1D sort(final DoubleMatrix1D vector) {
int[] indexes = new int[vector.size()]; // row indexes to reorder instead of matrix itself
for (int i=indexes.length; --i >= 0; ) indexes[i] = i;
IntComparator comp = new IntComparator() {
public int compare(int a, int b) {
double av = vector.getQuick(a);
double bv = vector.getQuick(b);
if (av!=av || bv!=bv) return compareNaN(av,bv); // swap NaNs to the end
return av<bv ? -1 : (av==bv ? 0 : 1);
}
};
runSort(indexes,0,indexes.length,comp);
return vector.viewSelection(indexes);
}
Example 5
| Source File: Sorting.java From database with GNU General Public License v2.0 | 3 votes |
|
/**
Sorts the vector into ascending order, according to the order induced by the specified comparator.
The returned view is backed by this matrix, so changes in the returned view are reflected in this matrix, and vice-versa.
The algorithm compares two cells at a time, determinining whether one is smaller, equal or larger than the other.
To sort ranges use sub-ranging views. To sort descending, use flip views ...
<p>
<b>Example:</b>
<pre>
// sort by sinus of cells
DoubleComparator comp = new DoubleComparator() {
public int compare(double a, double b) {
double as = Math.sin(a); double bs = Math.sin(b);
return as < bs ? -1 : as == bs ? 0 : 1;
}
};
sorted = quickSort(vector,comp);
</pre>
@param vector the vector to be sorted.
@param c the comparator to determine the order.
@return a new matrix view sorted as specified.
<b>Note that the original vector (matrix) is left unaffected.</b>
*/
public DoubleMatrix1D sort(final DoubleMatrix1D vector, final cern.colt.function.DoubleComparator c) {
int[] indexes = new int[vector.size()]; // row indexes to reorder instead of matrix itself
for (int i=indexes.length; --i >= 0; ) indexes[i] = i;
IntComparator comp = new IntComparator() {
public int compare(int a, int b) {
return c.compare(vector.getQuick(a), vector.getQuick(b));
}
};
runSort(indexes,0,indexes.length,comp);
return vector.viewSelection(indexes);
}
Example 6
| Source File: Sorting.java From jAudioGIT with GNU Lesser General Public License v2.1 | 3 votes |
|
/**
Sorts the vector into ascending order, according to the order induced by the specified comparator.
The returned view is backed by this matrix, so changes in the returned view are reflected in this matrix, and vice-versa.
The algorithm compares two cells at a time, determinining whether one is smaller, equal or larger than the other.
To sort ranges use sub-ranging views. To sort descending, use flip views ...
<p>
<b>Example:</b>
<pre>
// sort by sinus of cells
DoubleComparator comp = new DoubleComparator() {
public int compare(double a, double b) {
double as = Math.sin(a); double bs = Math.sin(b);
return as < bs ? -1 : as == bs ? 0 : 1;
}
};
sorted = quickSort(vector,comp);
</pre>
@param vector the vector to be sorted.
@param c the comparator to determine the order.
@return a new matrix view sorted as specified.
<b>Note that the original vector (matrix) is left unaffected.</b>
*/
public DoubleMatrix1D sort(final DoubleMatrix1D vector, final cern.colt.function.DoubleComparator c) {
int[] indexes = new int[vector.size()]; // row indexes to reorder instead of matrix itself
for (int i=indexes.length; --i >= 0; ) indexes[i] = i;
IntComparator comp = new IntComparator() {
public int compare(int a, int b) {
return c.compare(vector.getQuick(a), vector.getQuick(b));
}
};
runSort(indexes,0,indexes.length,comp);
return vector.viewSelection(indexes);
}
