Examples of org.apache.mahout.math.matrix.DoubleMatrix2D.rows()

Class org.apache.mahout.math.matrix.DoubleMatrix2D

Examples of org.apache.mahout.math.matrix.DoubleMatrix2D.rows()

org.apache.mahout.math.matrix.DoubleMatrix2D.rows()

            }
        }


        // Convert stemsToInclude into tdMatrixStemIndices
        final IntIntOpenHashMap stemToRowIndex = new IntIntOpenHashMap();
        for (int i = 0; i < stemWeightOrder.length && i < tdMatrix.rows(); i++)
        {
            stemToRowIndex.put(stemsToInclude[stemWeightOrder[i]], i);
        }


        // Store the results

View Full Code Here

            // Assign documents to the nearest centroid
            for (int c = 0; c < similarities.columns(); c++)
            {
                int maxRow = 0;
                double max = similarities.get(0, c);
                for (int r = 1; r < similarities.rows(); r++)
                {
                    if (max < similarities.get(r, c))
                    {
                        max = similarities.get(r, c);
                        maxRow = r;

View Full Code Here

        double orthogonality = 0;


        // Compute pairwise inner products
        DoubleMatrix2D cosines = A.zMult(A, null, 1, 0, true, false);


        for (int r = 0; r < cosines.rows(); r++)
        {
            for (int c = r + 1; c < cosines.columns(); c++)
            {
                orthogonality += cosines.getQuick(r, c);
            }

View Full Code Here

            {
                orthogonality += cosines.getQuick(r, c);
            }
        }


        return orthogonality / ((cosines.rows() - 1) * cosines.rows() / 2.0);
    }


    /**
     * Computers sparseness of matrix <code>A</code> as a fraction of non-zero elements to
     * the total number of elements.

View Full Code Here

            {
                orthogonality += cosines.getQuick(r, c);
            }
        }


        return orthogonality / ((cosines.rows() - 1) * cosines.rows() / 2.0);
    }


    /**
     * Computers sparseness of matrix <code>A</code> as a fraction of non-zero elements to
     * the total number of elements.

View Full Code Here

     * Orders U and V matrices according to the 'activity' of base vectors.
     */
    protected void order()
    {
        DoubleMatrix2D VT = V.viewDice();
        aggregates = new double [VT.rows()];


        for (int i = 0; i < aggregates.length; i++)
        {
            aggregates[i] = VT.viewRow(i).aggregate(Functions.PLUS, Functions.SQUARE);
        }

View Full Code Here

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.