Java Code Examples for cern.colt.matrix.DoubleMatrix2D#viewSelection()
The following examples show how to use
cern.colt.matrix.DoubleMatrix2D#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: TestMatrix2D.java From database with GNU General Public License v2.0 | 6 votes |
|
/**
*/
public static void doubleTest11() {
int rows = 4;
int columns = 5; // make a 1*1 matrix
DoubleMatrix2D master = new DenseDoubleMatrix2D(1,1);
master.assign(2);
System.out.println("\n"+master);
int[] rowIndexes = new int[rows];
int[] columnIndexes = new int[columns];
DoubleMatrix2D view1 = master.viewSelection(rowIndexes,columnIndexes);
System.out.println(view1);
master.assign(1);
System.out.println("\n"+master);
System.out.println(view1);
}
Example 2
| Source File: TestMatrix2D.java From database with GNU General Public License v2.0 | 6 votes |
|
/**
*/
public static void doubleTest7() {
int rows = 4;
int columns = 5; // make a 4*5 matrix
DoubleMatrix2D master = Factory2D.ascending(rows,columns);
//master.assign(1); // set all cells to 1
System.out.println("\n"+master);
//master.viewPart(2,0,2,3).assign(2); // set [2,1] .. [3,3] to 2
//System.out.println("\n"+master);
int[] rowIndexes = {0,1,3,0};
int[] columnIndexes = {0,2};
DoubleMatrix2D view1 = master.viewSelection(rowIndexes,columnIndexes);
System.out.println("view1="+view1);
DoubleMatrix2D view2 = view1.viewPart(0,0,2,2);
System.out.println("view2="+view2);
view2.assign(-1);
System.out.println("master replaced"+master);
System.out.println("flip1 replaced"+view1);
System.out.println("flip2 replaced"+view2);
}
Example 3
| Source File: TestMatrix2D.java From jAudioGIT with GNU Lesser General Public License v2.1 | 6 votes |
|
/**
*/
public static void doubleTest11() {
int rows = 4;
int columns = 5; // make a 1*1 matrix
DoubleMatrix2D master = new DenseDoubleMatrix2D(1,1);
master.assign(2);
System.out.println("\n"+master);
int[] rowIndexes = new int[rows];
int[] columnIndexes = new int[columns];
DoubleMatrix2D view1 = master.viewSelection(rowIndexes,columnIndexes);
System.out.println(view1);
master.assign(1);
System.out.println("\n"+master);
System.out.println(view1);
}
Example 4
| Source File: TestMatrix2D.java From jAudioGIT with GNU Lesser General Public License v2.1 | 6 votes |
|
/**
*/
public static void doubleTest7() {
int rows = 4;
int columns = 5; // make a 4*5 matrix
DoubleMatrix2D master = Factory2D.ascending(rows,columns);
//master.assign(1); // set all cells to 1
System.out.println("\n"+master);
//master.viewPart(2,0,2,3).assign(2); // set [2,1] .. [3,3] to 2
//System.out.println("\n"+master);
int[] rowIndexes = {0,1,3,0};
int[] columnIndexes = {0,2};
DoubleMatrix2D view1 = master.viewSelection(rowIndexes,columnIndexes);
System.out.println("view1="+view1);
DoubleMatrix2D view2 = view1.viewPart(0,0,2,2);
System.out.println("view2="+view2);
view2.assign(-1);
System.out.println("master replaced"+master);
System.out.println("flip1 replaced"+view1);
System.out.println("flip2 replaced"+view2);
}
Example 5
| Source File: TestMatrix2D.java From database with GNU General Public License v2.0 | 5 votes |
|
/**
*/
public static void doubleTest10() {
int rows = 6;
int columns = 7; // make a 4*5 matrix
//DoubleMatrix2D master = new DenseDoubleMatrix2D(rows,columns);
DoubleMatrix2D master = Factory2D.ascending(rows,columns);
//Basic.ascending(master);
//master.assign(1); // set all cells to 1
Transform.mult(master,Math.sin(0.3));
System.out.println("\n"+master);
//master.viewPart(2,0,2,3).assign(2); // set [2,1] .. [3,3] to 2
//System.out.println("\n"+master);
int[] rowIndexes = {0,1,2,3};
int[] columnIndexes = {0,1,2,3};
int[] rowIndexes2 = {3,0,3};
int[] columnIndexes2 = {3,0,3};
DoubleMatrix2D view1 = master.viewPart(1,1,4,5).viewSelection(rowIndexes,columnIndexes);
System.out.println("\nview1="+view1);
DoubleMatrix2D view9 = view1.viewStrides(2,2).viewStrides(2,1);
System.out.println("\nview9="+view9);
view1 = view1.viewSelection(rowIndexes2,columnIndexes2);
System.out.println("\nview1="+view1);
DoubleMatrix2D view2 = view1.viewPart(1,1,2,2);
System.out.println("\nview2="+view2);
DoubleMatrix2D view3 = view2.viewRowFlip();
System.out.println("\nview3="+view3);
view3.assign(Factory2D.ascending(view3.rows(),view3.columns()));
//Basic.ascending(view3);
System.out.println("\nview3="+view3);
//view2.assign(-1);
System.out.println("\nmaster replaced"+master);
System.out.println("\nview1 replaced"+view1);
System.out.println("\nview2 replaced"+view2);
System.out.println("\nview3 replaced"+view3);
}
Example 6
| Source File: TestMatrix2D.java From jAudioGIT with GNU Lesser General Public License v2.1 | 5 votes |
|
/**
*/
public static void doubleTest10() {
int rows = 6;
int columns = 7; // make a 4*5 matrix
//DoubleMatrix2D master = new DenseDoubleMatrix2D(rows,columns);
DoubleMatrix2D master = Factory2D.ascending(rows,columns);
//Basic.ascending(master);
//master.assign(1); // set all cells to 1
Transform.mult(master,Math.sin(0.3));
System.out.println("\n"+master);
//master.viewPart(2,0,2,3).assign(2); // set [2,1] .. [3,3] to 2
//System.out.println("\n"+master);
int[] rowIndexes = {0,1,2,3};
int[] columnIndexes = {0,1,2,3};
int[] rowIndexes2 = {3,0,3};
int[] columnIndexes2 = {3,0,3};
DoubleMatrix2D view1 = master.viewPart(1,1,4,5).viewSelection(rowIndexes,columnIndexes);
System.out.println("\nview1="+view1);
DoubleMatrix2D view9 = view1.viewStrides(2,2).viewStrides(2,1);
System.out.println("\nview9="+view9);
view1 = view1.viewSelection(rowIndexes2,columnIndexes2);
System.out.println("\nview1="+view1);
DoubleMatrix2D view2 = view1.viewPart(1,1,2,2);
System.out.println("\nview2="+view2);
DoubleMatrix2D view3 = view2.viewRowFlip();
System.out.println("\nview3="+view3);
view3.assign(Factory2D.ascending(view3.rows(),view3.columns()));
//Basic.ascending(view3);
System.out.println("\nview3="+view3);
//view2.assign(-1);
System.out.println("\nmaster replaced"+master);
System.out.println("\nview1 replaced"+view1);
System.out.println("\nview2 replaced"+view2);
System.out.println("\nview3 replaced"+view3);
}
Example 7
| Source File: Partitioning.java From database with GNU General Public License v2.0 | 4 votes |
|
/**
Same as {@link cern.colt.Partitioning#partition(int[],int,int,int[],int,int,int[])}
except that it <i>synchronously</i> partitions the rows of the given matrix by the values of the given matrix column;
This is essentially the same as partitioning a list of composite objects by some instance variable;
In other words, two entire rows of the matrix are swapped, whenever two column values indicate so.
<p>
Let's say, a "row" is an "object" (tuple, d-dimensional point).
A "column" is the list of "object" values of a given variable (field, dimension).
A "matrix" is a list of "objects" (tuples, points).
<p>
Now, rows (objects, tuples) are partially sorted according to their values in one given variable (dimension).
Two entire rows of the matrix are swapped, whenever two column values indicate so.
<p>
Note that arguments are not checked for validity.
<p>
<b>Example:</b>
<table border="1" cellspacing="0">
<tr nowrap>
<td valign="top"><tt>8 x 3 matrix:<br>
23, 22, 21<br>
20, 19, 18<br>
17, 16, 15<br>
14, 13, 12<br>
11, 10, 9<br>
8, 7, 6<br>
5, 4, 3<br>
2, 1, 0 </tt></td>
<td align="left" valign="top">
<tt>column = 0;<br>
splitters = {5,10,12}<br>
partition(matrix,column,splitters,splitIndexes);<br>
==><br>
splitIndexes == {0, 2, 3}</tt></p>
</td>
<td valign="top">
The matrix IS NOT REORDERED.<br>
The new VIEW IS REORDERED:<br>
<tt>8 x 3 matrix:<br>
2, 1, 0<br>
5, 4, 3<br>
8, 7, 6<br>
11, 10, 9<br>
23, 22, 21<br>
20, 19, 18<br>
17, 16, 15<br>
14, 13, 12 </tt></td>
</tr>
</table>
@param matrix the matrix to be partitioned.
@param column the index of the column to partition on.
@param splitters the values at which the rows shall be split into intervals.
Must be sorted ascending and must not contain multiple identical values.
These preconditions are not checked; be sure that they are met.
@param splitIndexes a list into which this method fills the indexes of rows delimiting intervals.
Therefore, must satisfy <tt>splitIndexes.length >= splitters.length</tt>.
@return a new matrix view having rows partitioned by the given column and splitters.
*/
public static DoubleMatrix2D partition(DoubleMatrix2D matrix, int column, final double[] splitters, int[] splitIndexes) {
int rowFrom = 0;
int rowTo = matrix.rows()-1;
int splitFrom = 0;
int splitTo = splitters.length-1;
int[] rowIndexes = new int[matrix.rows()]; // row indexes to reorder instead of matrix itself
for (int i=rowIndexes.length; --i >= 0; ) rowIndexes[i] = i;
partition(matrix,rowIndexes,rowFrom,rowTo,column,splitters,splitFrom,splitTo,splitIndexes);
// take all columns in the original order
int[] columnIndexes = new int[matrix.columns()];
for (int i=columnIndexes.length; --i >= 0; ) columnIndexes[i] = i;
// view the matrix according to the reordered row indexes
return matrix.viewSelection(rowIndexes,columnIndexes);
}
Example 8
| Source File: Sorting.java From database with GNU General Public License v2.0 | 4 votes |
|
/**
Sorts the matrix rows into ascending order, according to the <i>natural ordering</i> of the matrix values in the given column.
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 columns by rows, use dice views. To sort descending, use flip views ...
<p>
<b>Example:</b>
<table border="1" cellspacing="0">
<tr nowrap>
<td valign="top"><tt>4 x 2 matrix: <br>
7, 6<br>
5, 4<br>
3, 2<br>
1, 0 <br>
</tt></td>
<td align="left" valign="top">
<p><tt>column = 0;<br>
view = quickSort(matrix,column);<br>
System.out.println(view); </tt><tt><br>
==> </tt></p>
</td>
<td valign="top">
<p><tt>4 x 2 matrix:<br>
1, 0<br>
3, 2<br>
5, 4<br>
7, 6</tt><br>
The matrix IS NOT SORTED.<br>
The new VIEW IS SORTED.</p>
</td>
</tr>
</table>
@param matrix the matrix to be sorted.
@param column the index of the column inducing the order.
@return a new matrix view having rows sorted by the given column.
<b>Note that the original matrix is left unaffected.</b>
@throws IndexOutOfBoundsException if <tt>column < 0 || column >= matrix.columns()</tt>.
*/
public DoubleMatrix2D sort(DoubleMatrix2D matrix, int column) {
if (column < 0 || column >= matrix.columns()) throw new IndexOutOfBoundsException("column="+column+", matrix="+Formatter.shape(matrix));
int[] rowIndexes = new int[matrix.rows()]; // row indexes to reorder instead of matrix itself
for (int i=rowIndexes.length; --i >= 0; ) rowIndexes[i] = i;
final DoubleMatrix1D col = matrix.viewColumn(column);
IntComparator comp = new IntComparator() {
public int compare(int a, int b) {
double av = col.getQuick(a);
double bv = col.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(rowIndexes,0,rowIndexes.length,comp);
// view the matrix according to the reordered row indexes
// take all columns in the original order
return matrix.viewSelection(rowIndexes,null);
}
Example 9
| Source File: Sorting.java From database with GNU General Public License v2.0 | 4 votes |
|
/**
Sorts the matrix rows 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 rows (1-d matrices) at a time, determinining whether one is smaller, equal or larger than the other.
To sort ranges use sub-ranging views. To sort columns by rows, use dice views. To sort descending, use flip views ...
<p>
<b>Example:</b>
<pre>
// sort by sum of values in a row
DoubleMatrix1DComparator comp = new DoubleMatrix1DComparator() {
public int compare(DoubleMatrix1D a, DoubleMatrix1D b) {
double as = a.zSum(); double bs = b.zSum();
return as < bs ? -1 : as == bs ? 0 : 1;
}
};
sorted = quickSort(matrix,comp);
</pre>
@param matrix the matrix to be sorted.
@param c the comparator to determine the order.
@return a new matrix view having rows sorted as specified.
<b>Note that the original matrix is left unaffected.</b>
*/
public DoubleMatrix2D sort(final DoubleMatrix2D matrix, final DoubleMatrix1DComparator c) {
int[] rowIndexes = new int[matrix.rows()]; // row indexes to reorder instead of matrix itself
for (int i=rowIndexes.length; --i >= 0; ) rowIndexes[i] = i;
final DoubleMatrix1D[] views = new DoubleMatrix1D[matrix.rows()]; // precompute views for speed
for (int i=views.length; --i >= 0; ) views[i] = matrix.viewRow(i);
IntComparator comp = new IntComparator() {
public int compare(int a, int b) {
//return c.compare(matrix.viewRow(a), matrix.viewRow(b));
return c.compare(views[a], views[b]);
}
};
runSort(rowIndexes,0,rowIndexes.length,comp);
// view the matrix according to the reordered row indexes
// take all columns in the original order
return matrix.viewSelection(rowIndexes,null);
}
Example 10
| Source File: Partitioning.java From jAudioGIT with GNU Lesser General Public License v2.1 | 4 votes |
|
/**
Same as {@link cern.colt.Partitioning#partition(int[],int,int,int[],int,int,int[])}
except that it <i>synchronously</i> partitions the rows of the given matrix by the values of the given matrix column;
This is essentially the same as partitioning a list of composite objects by some instance variable;
In other words, two entire rows of the matrix are swapped, whenever two column values indicate so.
<p>
Let's say, a "row" is an "object" (tuple, d-dimensional point).
A "column" is the list of "object" values of a given variable (field, dimension).
A "matrix" is a list of "objects" (tuples, points).
<p>
Now, rows (objects, tuples) are partially sorted according to their values in one given variable (dimension).
Two entire rows of the matrix are swapped, whenever two column values indicate so.
<p>
Note that arguments are not checked for validity.
<p>
<b>Example:</b>
<table border="1" cellspacing="0">
<tr nowrap>
<td valign="top"><tt>8 x 3 matrix:<br>
23, 22, 21<br>
20, 19, 18<br>
17, 16, 15<br>
14, 13, 12<br>
11, 10, 9<br>
8, 7, 6<br>
5, 4, 3<br>
2, 1, 0 </tt></td>
<td align="left" valign="top">
<tt>column = 0;<br>
splitters = {5,10,12}<br>
partition(matrix,column,splitters,splitIndexes);<br>
==><br>
splitIndexes == {0, 2, 3}</tt></p>
</td>
<td valign="top">
The matrix IS NOT REORDERED.<br>
The new VIEW IS REORDERED:<br>
<tt>8 x 3 matrix:<br>
2, 1, 0<br>
5, 4, 3<br>
8, 7, 6<br>
11, 10, 9<br>
23, 22, 21<br>
20, 19, 18<br>
17, 16, 15<br>
14, 13, 12 </tt></td>
</tr>
</table>
@param matrix the matrix to be partitioned.
@param column the index of the column to partition on.
@param splitters the values at which the rows shall be split into intervals.
Must be sorted ascending and must not contain multiple identical values.
These preconditions are not checked; be sure that they are met.
@param splitIndexes a list into which this method fills the indexes of rows delimiting intervals.
Therefore, must satisfy <tt>splitIndexes.length >= splitters.length</tt>.
@return a new matrix view having rows partitioned by the given column and splitters.
*/
public static DoubleMatrix2D partition(DoubleMatrix2D matrix, int column, final double[] splitters, int[] splitIndexes) {
int rowFrom = 0;
int rowTo = matrix.rows()-1;
int splitFrom = 0;
int splitTo = splitters.length-1;
int[] rowIndexes = new int[matrix.rows()]; // row indexes to reorder instead of matrix itself
for (int i=rowIndexes.length; --i >= 0; ) rowIndexes[i] = i;
partition(matrix,rowIndexes,rowFrom,rowTo,column,splitters,splitFrom,splitTo,splitIndexes);
// take all columns in the original order
int[] columnIndexes = new int[matrix.columns()];
for (int i=columnIndexes.length; --i >= 0; ) columnIndexes[i] = i;
// view the matrix according to the reordered row indexes
return matrix.viewSelection(rowIndexes,columnIndexes);
}
Example 11
| Source File: Sorting.java From jAudioGIT with GNU Lesser General Public License v2.1 | 4 votes |
|
/**
Sorts the matrix rows into ascending order, according to the <i>natural ordering</i> of the matrix values in the given column.
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 columns by rows, use dice views. To sort descending, use flip views ...
<p>
<b>Example:</b>
<table border="1" cellspacing="0">
<tr nowrap>
<td valign="top"><tt>4 x 2 matrix: <br>
7, 6<br>
5, 4<br>
3, 2<br>
1, 0 <br>
</tt></td>
<td align="left" valign="top">
<p><tt>column = 0;<br>
view = quickSort(matrix,column);<br>
System.out.println(view); </tt><tt><br>
==> </tt></p>
</td>
<td valign="top">
<p><tt>4 x 2 matrix:<br>
1, 0<br>
3, 2<br>
5, 4<br>
7, 6</tt><br>
The matrix IS NOT SORTED.<br>
The new VIEW IS SORTED.</p>
</td>
</tr>
</table>
@param matrix the matrix to be sorted.
@param column the index of the column inducing the order.
@return a new matrix view having rows sorted by the given column.
<b>Note that the original matrix is left unaffected.</b>
@throws IndexOutOfBoundsException if <tt>column < 0 || column >= matrix.columns()</tt>.
*/
public DoubleMatrix2D sort(DoubleMatrix2D matrix, int column) {
if (column < 0 || column >= matrix.columns()) throw new IndexOutOfBoundsException("column="+column+", matrix="+Formatter.shape(matrix));
int[] rowIndexes = new int[matrix.rows()]; // row indexes to reorder instead of matrix itself
for (int i=rowIndexes.length; --i >= 0; ) rowIndexes[i] = i;
final DoubleMatrix1D col = matrix.viewColumn(column);
IntComparator comp = new IntComparator() {
public int compare(int a, int b) {
double av = col.getQuick(a);
double bv = col.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(rowIndexes,0,rowIndexes.length,comp);
// view the matrix according to the reordered row indexes
// take all columns in the original order
return matrix.viewSelection(rowIndexes,null);
}
Example 12
| Source File: Sorting.java From jAudioGIT with GNU Lesser General Public License v2.1 | 4 votes |
|
/**
Sorts the matrix rows 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 rows (1-d matrices) at a time, determinining whether one is smaller, equal or larger than the other.
To sort ranges use sub-ranging views. To sort columns by rows, use dice views. To sort descending, use flip views ...
<p>
<b>Example:</b>
<pre>
// sort by sum of values in a row
DoubleMatrix1DComparator comp = new DoubleMatrix1DComparator() {
public int compare(DoubleMatrix1D a, DoubleMatrix1D b) {
double as = a.zSum(); double bs = b.zSum();
return as < bs ? -1 : as == bs ? 0 : 1;
}
};
sorted = quickSort(matrix,comp);
</pre>
@param matrix the matrix to be sorted.
@param c the comparator to determine the order.
@return a new matrix view having rows sorted as specified.
<b>Note that the original matrix is left unaffected.</b>
*/
public DoubleMatrix2D sort(final DoubleMatrix2D matrix, final DoubleMatrix1DComparator c) {
int[] rowIndexes = new int[matrix.rows()]; // row indexes to reorder instead of matrix itself
for (int i=rowIndexes.length; --i >= 0; ) rowIndexes[i] = i;
final DoubleMatrix1D[] views = new DoubleMatrix1D[matrix.rows()]; // precompute views for speed
for (int i=views.length; --i >= 0; ) views[i] = matrix.viewRow(i);
IntComparator comp = new IntComparator() {
public int compare(int a, int b) {
//return c.compare(matrix.viewRow(a), matrix.viewRow(b));
return c.compare(views[a], views[b]);
}
};
runSort(rowIndexes,0,rowIndexes.length,comp);
// view the matrix according to the reordered row indexes
// take all columns in the original order
return matrix.viewSelection(rowIndexes,null);
}
Example 13
| Source File: Statistic.java From database with GNU General Public License v2.0 | 3 votes |
|
/**
Constructs and returns a sampling view with <tt>round(matrix.rows() * rowFraction)</tt> rows and <tt>round(matrix.columns() * columnFraction)</tt> columns.
Samples "without replacement".
Rows and columns are randomly chosen from the uniform distribution.
Examples:
<table border="1" cellspacing="0">
<tr valign="top" align="center">
<td>
<div align="left"><tt>matrix</tt></div>
</td>
<td>
<div align="left"><tt>rowFraction=0.2<br>
columnFraction=0.2</tt></div>
</td>
<td>
<div align="left"><tt>rowFraction=0.2<br>
columnFraction=1.0 </tt></div>
</td>
<td>
<div align="left"><tt>rowFraction=1.0<br>
columnFraction=0.2 </tt></div>
</td>
</tr>
<tr valign="top">
<td><tt> 10 x 10 matrix<br>
1 2 3 4 5 6 7 8 9 10<br>
11 12 13 14 15 16 17 18 19 20<br>
21 22 23 24 25 26 27 28 29 30<br>
31 32 33 34 35 36 37 38 39 40<br>
41 42 43 44 45 46 47 48 49 50<br>
51 52 53 54 55 56 57 58 59 60<br>
61 62 63 64 65 66 67 68 69 70<br>
71 72 73 74 75 76 77 78 79 80<br>
81 82 83 84 85 86 87 88 89 90<br>
91 92 93 94 95 96 97 98 99 100
</tt> </td>
<td><tt> 2 x 2 matrix<br>
43 50<br>
53 60 </tt></td>
<td><tt> 2 x 10 matrix<br>
41 42 43 44 45 46 47 48 49 50<br>
91 92 93 94 95 96 97 98 99 100
</tt> </td>
<td><tt> 10 x 2 matrix<br>
4 8<br>
14 18<br>
24 28<br>
34 38<br>
44 48<br>
54 58<br>
64 68<br>
74 78<br>
84 88<br>
94 98 </tt> </td>
</tr>
</table>
@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 DoubleMatrix2D viewSample(DoubleMatrix2D matrix, double rowFraction, double columnFraction, RandomEngine randomGenerator) {
// check preconditions and allow for a little tolerance
double epsilon = 1e-09;
if (rowFraction < 0 - epsilon || rowFraction > 1 + epsilon) throw new IllegalArgumentException();
if (rowFraction < 0) rowFraction = 0;
if (rowFraction > 1) rowFraction = 1;
if (columnFraction < 0 - epsilon || columnFraction > 1 + epsilon) throw new IllegalArgumentException();
if (columnFraction < 0) columnFraction = 0;
if (columnFraction > 1) columnFraction = 1;
// random generator seeded with current time
if (randomGenerator==null) randomGenerator = new cern.jet.random.engine.MersenneTwister((int) System.currentTimeMillis());
int nrows = (int) Math.round(matrix.rows() * rowFraction);
int ncols = (int) Math.round(matrix.columns() * columnFraction);
int max = Math.max(nrows,ncols);
long[] selected = new long[max]; // sampler works on long's, not int's
// sample rows
int n = nrows;
int N = matrix.rows();
cern.jet.random.sampling.RandomSampler.sample(n,N,n,0,selected,0,randomGenerator);
int[] selectedRows = new int[n];
for (int i=0; i<n; i++) selectedRows[i] = (int) selected[i];
// sample columns
n = ncols;
N = matrix.columns();
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(selectedRows, selectedCols);
}
Example 14
| Source File: Statistic.java From jAudioGIT with GNU Lesser General Public License v2.1 | 3 votes |
|
/**
Constructs and returns a sampling view with <tt>round(matrix.rows() * rowFraction)</tt> rows and <tt>round(matrix.columns() * columnFraction)</tt> columns.
Samples "without replacement".
Rows and columns are randomly chosen from the uniform distribution.
Examples:
<table border="1" cellspacing="0">
<tr valign="top" align="center">
<td>
<div align="left"><tt>matrix</tt></div>
</td>
<td>
<div align="left"><tt>rowFraction=0.2<br>
columnFraction=0.2</tt></div>
</td>
<td>
<div align="left"><tt>rowFraction=0.2<br>
columnFraction=1.0 </tt></div>
</td>
<td>
<div align="left"><tt>rowFraction=1.0<br>
columnFraction=0.2 </tt></div>
</td>
</tr>
<tr valign="top">
<td><tt> 10 x 10 matrix<br>
1 2 3 4 5 6 7 8 9 10<br>
11 12 13 14 15 16 17 18 19 20<br>
21 22 23 24 25 26 27 28 29 30<br>
31 32 33 34 35 36 37 38 39 40<br>
41 42 43 44 45 46 47 48 49 50<br>
51 52 53 54 55 56 57 58 59 60<br>
61 62 63 64 65 66 67 68 69 70<br>
71 72 73 74 75 76 77 78 79 80<br>
81 82 83 84 85 86 87 88 89 90<br>
91 92 93 94 95 96 97 98 99 100
</tt> </td>
<td><tt> 2 x 2 matrix<br>
43 50<br>
53 60 </tt></td>
<td><tt> 2 x 10 matrix<br>
41 42 43 44 45 46 47 48 49 50<br>
91 92 93 94 95 96 97 98 99 100
</tt> </td>
<td><tt> 10 x 2 matrix<br>
4 8<br>
14 18<br>
24 28<br>
34 38<br>
44 48<br>
54 58<br>
64 68<br>
74 78<br>
84 88<br>
94 98 </tt> </td>
</tr>
</table>
@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 DoubleMatrix2D viewSample(DoubleMatrix2D matrix, double rowFraction, double columnFraction, RandomEngine randomGenerator) {
// check preconditions and allow for a little tolerance
double epsilon = 1e-09;
if (rowFraction < 0 - epsilon || rowFraction > 1 + epsilon) throw new IllegalArgumentException();
if (rowFraction < 0) rowFraction = 0;
if (rowFraction > 1) rowFraction = 1;
if (columnFraction < 0 - epsilon || columnFraction > 1 + epsilon) throw new IllegalArgumentException();
if (columnFraction < 0) columnFraction = 0;
if (columnFraction > 1) columnFraction = 1;
// random generator seeded with current time
if (randomGenerator==null) randomGenerator = new cern.jet.random.engine.MersenneTwister((int) System.currentTimeMillis());
int nrows = (int) Math.round(matrix.rows() * rowFraction);
int ncols = (int) Math.round(matrix.columns() * columnFraction);
int max = Math.max(nrows,ncols);
long[] selected = new long[max]; // sampler works on long's, not int's
// sample rows
int n = nrows;
int N = matrix.rows();
cern.jet.random.sampling.RandomSampler.sample(n,N,n,0,selected,0,randomGenerator);
int[] selectedRows = new int[n];
for (int i=0; i<n; i++) selectedRows[i] = (int) selected[i];
// sample columns
n = ncols;
N = matrix.columns();
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(selectedRows, selectedCols);
}
Example 15
| Source File: Algebra.java From database with GNU General Public License v2.0 | 2 votes |
|
/**
Constructs and returns a new row and column permuted <i>selection view</i> of matrix <tt>A</tt>; equivalent to {@link DoubleMatrix2D#viewSelection(int[],int[])}.
The returned matrix is backed by this matrix, so changes in the returned matrix are reflected in this matrix, and vice-versa.
Use idioms like <tt>result = permute(...).copy()</tt> to generate an independent sub matrix.
@return the new permuted selection view.
*/
public DoubleMatrix2D permute(DoubleMatrix2D A, int[] rowIndexes, int[] columnIndexes) {
return A.viewSelection(rowIndexes,columnIndexes);
}
Example 16
| Source File: Algebra.java From jAudioGIT with GNU Lesser General Public License v2.1 | 2 votes |
|
/**
Constructs and returns a new row and column permuted <i>selection view</i> of matrix <tt>A</tt>; equivalent to {@link DoubleMatrix2D#viewSelection(int[],int[])}.
The returned matrix is backed by this matrix, so changes in the returned matrix are reflected in this matrix, and vice-versa.
Use idioms like <tt>result = permute(...).copy()</tt> to generate an independent sub matrix.
@return the new permuted selection view.
*/
public DoubleMatrix2D permute(DoubleMatrix2D A, int[] rowIndexes, int[] columnIndexes) {
return A.viewSelection(rowIndexes,columnIndexes);
}
