Tabnine Logo
AGNES.shrinkActiveSet
Code IndexAdd Tabnine to your IDE (free)

How to use
shrinkActiveSet
method
in
de.lmu.ifi.dbs.elki.algorithm.clustering.hierarchical.AGNES

Best Java code snippets using de.lmu.ifi.dbs.elki.algorithm.clustering.hierarchical.AGNES.shrinkActiveSet (Showing top 12 results out of 315)

origin: de.lmu.ifi.dbs.elki/elki-clustering

end = shrinkActiveSet(ix, builder, end, //
  findMerge(end, mat, builder));
LOG.incrementProcessed(prog);
origin: elki-project/elki

end = shrinkActiveSet(ix, builder, end, //
  findMerge(end, mat, builder));
LOG.incrementProcessed(prog);
origin: elki-project/elki

DBIDArrayIter ix = mat.ix;
for(int i = 1, end = size; i < size; i++) {
 end = AGNES.shrinkActiveSet(ix, builder, end, //
   findMerge(end, mat, bestd, besti, builder));
 LOG.incrementProcessed(prog);
origin: de.lmu.ifi.dbs.elki/elki-clustering

DBIDArrayIter ix = mat.ix;
for(int i = 1, end = size; i < size; i++) {
 end = AGNES.shrinkActiveSet(ix, builder, end, //
   findMerge(end, mat, bestd, besti, builder));
 LOG.incrementProcessed(prog);
origin: elki-project/elki

/**
 * Run the algorithm on a database.
 * 
 * @param db Database
 * @param relation Relation to process.
 * @return Hierarchical result
 */
public PointerPrototypeHierarchyRepresentationResult run(Database db, Relation<O> relation) {
 DistanceQuery<O> dq = DatabaseUtil.precomputedDistanceQuery(db, relation, getDistanceFunction(), LOG);
 final DBIDs ids = relation.getDBIDs();
 final int size = ids.size();
 // Initialize space for result:
 PointerHierarchyRepresentationBuilder builder = new PointerHierarchyRepresentationBuilder(ids, dq.getDistanceFunction().isSquared());
 Int2ObjectOpenHashMap<ModifiableDBIDs> clusters = new Int2ObjectOpenHashMap<>(size);
 // Allocate working space:
 MatrixParadigm mat = new MatrixParadigm(ids);
 ArrayModifiableDBIDs prots = DBIDUtil.newArray(MatrixParadigm.triangleSize(size));
 initializeMatrices(mat, prots, dq);
 DBIDArrayMIter protiter = prots.iter();
 FiniteProgress progress = LOG.isVerbose() ? new FiniteProgress("MiniMax clustering", size - 1, LOG) : null;
 DBIDArrayIter ix = mat.ix;
 for(int i = 1, end = size; i < size; i++) {
  end = AGNES.shrinkActiveSet(ix, builder, end, //
    findMerge(end, mat, protiter, builder, clusters, dq));
  LOG.incrementProcessed(progress);
 }
 LOG.ensureCompleted(progress);
 return (PointerPrototypeHierarchyRepresentationResult) builder.complete();
}
origin: de.lmu.ifi.dbs.elki/elki-clustering

/**
 * Run the algorithm on a database.
 * 
 * @param db Database
 * @param relation Relation to process.
 * @return Hierarchical result
 */
public PointerPrototypeHierarchyRepresentationResult run(Database db, Relation<O> relation) {
 DistanceQuery<O> dq = DatabaseUtil.precomputedDistanceQuery(db, relation, getDistanceFunction(), LOG);
 final DBIDs ids = relation.getDBIDs();
 final int size = ids.size();
 // Initialize space for result:
 PointerHierarchyRepresentationBuilder builder = new PointerHierarchyRepresentationBuilder(ids, dq.getDistanceFunction().isSquared());
 Int2ObjectOpenHashMap<ModifiableDBIDs> clusters = new Int2ObjectOpenHashMap<>(size);
 // Allocate working space:
 MatrixParadigm mat = new MatrixParadigm(ids);
 ArrayModifiableDBIDs prots = DBIDUtil.newArray(MatrixParadigm.triangleSize(size));
 initializeMatrices(mat, prots, dq);
 DBIDArrayMIter protiter = prots.iter();
 FiniteProgress progress = LOG.isVerbose() ? new FiniteProgress("MiniMax clustering", size - 1, LOG) : null;
 DBIDArrayIter ix = mat.ix;
 for(int i = 1, end = size; i < size; i++) {
  end = AGNES.shrinkActiveSet(ix, builder, end, //
    findMerge(end, mat, protiter, builder, clusters, dq));
  LOG.incrementProcessed(progress);
 }
 LOG.ensureCompleted(progress);
 return (PointerPrototypeHierarchyRepresentationResult) builder.complete();
}
origin: de.lmu.ifi.dbs.elki/elki-clustering

DBIDArrayIter ix = mat.ix;
for(int i = 1, end = size; i < size; i++) {
 end = AGNES.shrinkActiveSet(ix, builder, end, //
   findMerge(end, mat, protiter, builder, clusters, bestd, besti, dq));
 LOG.incrementProcessed(prog);
origin: elki-project/elki

DBIDArrayIter ix = mat.ix;
for(int i = 1, end = size; i < size; i++) {
 end = AGNES.shrinkActiveSet(ix, builder, end, //
   findMerge(end, mat, protiter, builder, clusters, bestd, besti, dq));
 LOG.incrementProcessed(prog);
origin: elki-project/elki

assert (b < a);
MiniMax.merge(size, mat, prots, builder, clusters, dq, a, b);
end = AGNES.shrinkActiveSet(ix, builder, end, a); // Shrink working set
LOG.incrementProcessed(progress);
origin: elki-project/elki

assert (b < a);
merge(size, mat, builder, minDist, a, b);
end = AGNES.shrinkActiveSet(ix, builder, end, a); // Shrink working set
LOG.incrementProcessed(progress);
origin: de.lmu.ifi.dbs.elki/elki-clustering

assert (b < a);
merge(size, mat, builder, minDist, a, b);
end = AGNES.shrinkActiveSet(ix, builder, end, a); // Shrink working set
LOG.incrementProcessed(progress);
origin: de.lmu.ifi.dbs.elki/elki-clustering

assert (b < a);
MiniMax.merge(size, mat, prots, builder, clusters, dq, a, b);
end = AGNES.shrinkActiveSet(ix, builder, end, a); // Shrink working set
LOG.incrementProcessed(progress);
de.lmu.ifi.dbs.elki.algorithm.clustering.hierarchicalAGNESshrinkActiveSet

Javadoc

Shrink the active set: if the last x objects are all merged, we can reduce the working size accordingly.

Popular methods of AGNES

  • <init>
    Constructor.
  • findMerge
    Perform the next merge step in AGNES.
  • getDistanceFunction
  • initializeDistanceMatrix
    Initialize a distance matrix.
  • merge
    Execute the cluster merge.
  • updateMatrix
    Update the scratch distance matrix.
  • triangleSize
    Compute the size of a complete x by x triangle (minus diagonal)

Popular in Java

  • Parsing JSON documents to java classes using gson
  • notifyDataSetChanged (ArrayAdapter)
  • getContentResolver (Context)
  • onRequestPermissionsResult (Fragment)
  • FileInputStream (java.io)
    An input stream that reads bytes from a file. File file = ...finally if (in != null) in.clos
  • URLEncoder (java.net)
    This class is used to encode a string using the format required by application/x-www-form-urlencoded
  • Deque (java.util)
    A linear collection that supports element insertion and removal at both ends. The name deque is shor
  • TreeSet (java.util)
    TreeSet is an implementation of SortedSet. All optional operations (adding and removing) are support
  • ServletException (javax.servlet)
    Defines a general exception a servlet can throw when it encounters difficulty.
  • Response (javax.ws.rs.core)
    Defines the contract between a returned instance and the runtime when an application needs to provid
  • 14 Best Plugins for Eclipse
Tabnine Logo
  • Products

    Search for Java codeSearch for JavaScript code
  • IDE Plugins

    IntelliJ IDEAWebStormVisual StudioAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimAtomGoLandRubyMineEmacsJupyter NotebookJupyter LabRiderDataGripAppCode
  • Company

    About UsContact UsCareers
  • Resources

    FAQBlogTabnine AcademyStudentsTerms of usePrivacy policyJava Code IndexJavascript Code Index
Get Tabnine for your IDE now