public List<ConceptData> getConceptDataList(DoubleMatrix1D v1){ IntArrayList arg0 = new IntArrayList() ; DoubleArrayList arg1=new DoubleArrayList(); v1.getNonZeros(arg0, arg1); List<ConceptData> vectorTopic=new ArrayList<ConceptData>() ; for(int i=0;i<arg0.size();i++){ String concept=inverseindex.get(arg0.get(i)); ConceptData data=new ConceptData(concept,arg1.get(i)); vectorTopic.add(data); } return vectorTopic; }
IntArrayList indexs = new IntArrayList(); DoubleArrayList values = new DoubleArrayList(); ins.getNonZeros(indexs, values); if (indexs.size() > 0) { instances.add(ins);
protected double computeKLDivergence(DoubleMatrix1D v1, double[] meanVector) { double divergence = 0.0; if (v1 instanceof SparseDoubleMatrix1D) { IntArrayList indexList = new IntArrayList(); DoubleArrayList valueList = new DoubleArrayList(); v1.getNonZeros(indexList, valueList); for (int j = 0; j < indexList.size(); ++j) { int index = indexList.get(j); double value = valueList.get(j); divergence += value * Math.log(value / meanVector[index]); } } else { for (int j = 0; j < v1.size(); ++j) { double value = v1.getQuick(j); if (value != 0) { divergence += value * Math.log(value / meanVector[j]); } } } return divergence; } protected double computeJSDivergence(DoubleMatrix1D v1, DoubleMatrix1D v2) {
IntArrayList indexs = new IntArrayList(); DoubleArrayList values = new DoubleArrayList(); ins.getNonZeros(indexs, values); if (indexs.size() > 0) { instances.add(ins);
IntArrayList indexList = new IntArrayList(); DoubleArrayList valueList = new DoubleArrayList(); v.getNonZeros(indexList, valueList); for (int j = 0; j < indexList.size(); ++j) { int index = indexList.get(j);
protected double productQuick(DoubleMatrix1D v1, DoubleMatrix1D v2) { IntArrayList indexList = new IntArrayList(); DoubleArrayList valueList = new DoubleArrayList(); v1.getNonZeros(indexList, valueList); double prod = 0.0; for (int i = 0; i < indexList.size(); ++i) { double temp = v2.getQuick(indexList.getQuick(i)); if (temp != 0.0) { prod += valueList.getQuick(i) * temp; } } // double prod = 0.0; // for (int i = 0; i < v1.size(); ++i) { // double temp1 = v1.getQuick(i); // double temp2 = v2.getQuick(i); // if (temp1 != 0.0 || temp2 != 0.0) { // prod += temp1 * temp2; // } // } return prod; }
IntArrayList indexList = new IntArrayList(); DoubleArrayList valueList = new DoubleArrayList(); v1.getNonZeros(indexList, valueList); for (int j = 0; j < indexList.size(); ++j) { int index = indexList.get(j); IntArrayList indexList = new IntArrayList(); DoubleArrayList valueList = new DoubleArrayList(); v2.getNonZeros(indexList, valueList); for (int j = 0; j < indexList.size(); ++j) { int index = indexList.get(j);
public CFGSig(ControlFlowGraph cfg) { this.adjacencyMatrix = cfg.getAdjacencyMatrix(); this.vertexCount = cfg.getVertexCount(); this.edgeCount = cfg.getEdgeCount(); this.name = cfg.getIdentifier(false); this.stringSignature = ""; stringSignature += name + ";"; stringSignature += adjacencyMatrix.rows(); DoubleArrayList unused = new DoubleArrayList(); IntArrayList indices = null; for(int i=0; i<adjacencyMatrix.rows(); ++i) { DoubleMatrix1D row = adjacencyMatrix.viewRow(i); if(row.cardinality() > 0) { stringSignature += ";" + i + ":"; indices = new IntArrayList(); row.getNonZeros(indices, unused); for(int j=0; j<indices.size(); ++j) { if(j > 0) stringSignature += ","; stringSignature += indices.get(j); } } } // build sig from adjmat }
Browk.getNonZeros(nonZeroIndexes,null,maxCardinality); int cardinality = nonZeroIndexes.size(); boolean sparse = (cardinality < maxCardinality); Browk.getNonZeros(nonZeroIndexes,null,maxCardinality); int cardinality = nonZeroIndexes.size(); boolean sparse = (cardinality < maxCardinality);
Browk.getNonZeros(nonZeroIndexes,null,maxCardinality); int cardinality = nonZeroIndexes.size(); boolean sparse = (cardinality < maxCardinality); Browk.getNonZeros(nonZeroIndexes,null,maxCardinality); int cardinality = nonZeroIndexes.size(); boolean sparse = (cardinality < maxCardinality);
LUcolj.getNonZeros(nonZeroIndexes,null,maxCardinality); int cardinality = nonZeroIndexes.size(); boolean sparse = (cardinality < maxCardinality);
LUcolj.getNonZeros(nonZeroIndexes,null,maxCardinality); int cardinality = nonZeroIndexes.size(); boolean sparse = (cardinality < maxCardinality);