idx int64 0 165k | question stringlengths 73 4.15k | target stringlengths 5 918 | len_question int64 21 890 | len_target int64 3 255 |
|---|---|---|---|---|
156,800 | public CollectionResult < double [ ] > run ( Database database , Relation < O > rel ) { DistanceQuery < O > dq = rel . getDistanceQuery ( getDistanceFunction ( ) ) ; int size = rel . size ( ) ; long pairs = ( size * ( long ) size ) >> 1 ; final long ssize = sampling <= 1 ? ( long ) Math . ceil ( sampling * pairs ) : ( ... | Run the distance quantile sampler . | 543 | 8 |
156,801 | protected boolean parseLineInternal ( ) { // Split into numerical attributes and labels int i = 0 ; for ( /* initialized by nextLineExceptComents()! */ ; tokenizer . valid ( ) ; tokenizer . advance ( ) , i ++ ) { if ( ! isLabelColumn ( i ) && ! tokenizer . isQuoted ( ) ) { try { attributes . add ( tokenizer . getDouble... | Internal method for parsing a single line . Used by both line based parsing as well as block parsing . This saves the building of meta data for each line . | 354 | 31 |
156,802 | SimpleTypeInformation < V > getTypeInformation ( int mindim , int maxdim ) { if ( mindim > maxdim ) { throw new AbortException ( "No vectors were read from the input file - cannot determine vector data type." ) ; } if ( mindim == maxdim ) { String [ ] colnames = null ; if ( columnnames != null && mindim <= columnnames ... | Get a prototype object for the given dimensionality . | 226 | 10 |
156,803 | private void materializeKNNAndRKNNs ( ArrayDBIDs ids , FiniteProgress progress ) { // add an empty list to each rknn for ( DBIDIter iter = ids . iter ( ) ; iter . valid ( ) ; iter . advance ( ) ) { if ( materialized_RkNN . get ( iter ) == null ) { materialized_RkNN . put ( iter , new TreeSet < DoubleDBIDPair > ( ) ) ; ... | Materializes the kNNs and RkNNs of the specified object IDs . | 284 | 17 |
156,804 | public DoubleDBIDList getRKNN ( DBIDRef id ) { TreeSet < DoubleDBIDPair > rKNN = materialized_RkNN . get ( id ) ; if ( rKNN == null ) { return null ; } ModifiableDoubleDBIDList ret = DBIDUtil . newDistanceDBIDList ( rKNN . size ( ) ) ; for ( DoubleDBIDPair pair : rKNN ) { ret . add ( pair ) ; } ret . sort ( ) ; return ... | Returns the materialized RkNNs of the specified id . | 114 | 13 |
156,805 | public void insert ( NumberVector nv ) { final int dim = nv . getDimensionality ( ) ; // No root created yet: if ( root == null ) { ClusteringFeature leaf = new ClusteringFeature ( dim ) ; leaf . addToStatistics ( nv ) ; root = new TreeNode ( dim , capacity ) ; root . children [ 0 ] = leaf ; root . addToStatistics ( nv... | Insert a data point into the tree . | 179 | 8 |
156,806 | protected void rebuildTree ( ) { final int dim = root . getDimensionality ( ) ; double t = estimateThreshold ( root ) / leaves ; t *= t ; // Never decrease the threshold. thresholdsq = t > thresholdsq ? t : thresholdsq ; LOG . debug ( "New squared threshold: " + thresholdsq ) ; LeafIterator iter = new LeafIterator ( ro... | Rebuild the CFTree to condense it to approximately half the size . | 259 | 16 |
156,807 | private TreeNode insert ( TreeNode node , NumberVector nv ) { // Find closest child: ClusteringFeature [ ] cfs = node . children ; assert ( cfs [ 0 ] != null ) : "Unexpected empty node!" ; // Find the best child: ClusteringFeature best = cfs [ 0 ] ; double bestd = distance . squaredDistance ( nv , best ) ; for ( int i ... | Recursive insertion . | 374 | 4 |
156,808 | private boolean add ( ClusteringFeature [ ] children , ClusteringFeature child ) { for ( int i = 0 ; i < children . length ; i ++ ) { if ( children [ i ] == null ) { children [ i ] = child ; return true ; } } return false ; } | Add a node to the first unused slot . | 62 | 9 |
156,809 | protected StringBuilder printDebug ( StringBuilder buf , ClusteringFeature n , int d ) { FormatUtil . appendSpace ( buf , d ) . append ( n . n ) ; for ( int i = 0 ; i < n . getDimensionality ( ) ; i ++ ) { buf . append ( ' ' ) . append ( n . centroid ( i ) ) ; } buf . append ( " - " ) . append ( n . n ) . append ( ' ' ... | Utility function for debugging . | 184 | 6 |
156,810 | public static double cdf ( double val , int v ) { double x = v / ( val * val + v ) ; return 1 - ( 0.5 * BetaDistribution . regularizedIncBeta ( x , v * .5 , 0.5 ) ) ; } | Static version of the CDF of the t - distribution for t > ; 0 | 57 | 17 |
156,811 | public void add ( DBIDRef iter , int column , double score ) { changepoints . add ( new ChangePoint ( iter , column , score ) ) ; } | Add a change point to the result . | 34 | 8 |
156,812 | public void appendToBuffer ( StringBuilder buf ) { Iterator < Polygon > iter = polygons . iterator ( ) ; while ( iter . hasNext ( ) ) { Polygon poly = iter . next ( ) ; poly . appendToBuffer ( buf ) ; if ( iter . hasNext ( ) ) { buf . append ( " -- " ) ; } } } | Append polygons to the buffer . | 77 | 8 |
156,813 | public void initialize ( CharSequence input , int begin , int end ) { this . input = input ; this . send = end ; this . matcher . reset ( input ) . region ( begin , end ) ; this . index = begin ; advance ( ) ; } | Initialize parser with a new string . | 56 | 8 |
156,814 | public String getStrippedSubstring ( ) { // TODO: detect Java <6 and make sure we only return the substring? // With java 7, String.substring will arraycopy the characters. int sstart = start , send = end ; while ( sstart < send ) { char c = input . charAt ( sstart ) ; if ( c != ' ' || c != ' ' || c != ' ' || c != ' ' ... | Get the current part as substring | 183 | 7 |
156,815 | private char isQuote ( int index ) { if ( index >= input . length ( ) ) { return 0 ; } char c = input . charAt ( index ) ; for ( int i = 0 ; i < quoteChars . length ; i ++ ) { if ( c == quoteChars [ i ] ) { return c ; } } return 0 ; } | Detect quote characters . | 75 | 4 |
156,816 | public static WritableRecordStore makeRecordStorage ( DBIDs ids , int hints , Class < ? > ... dataclasses ) { return DataStoreFactory . FACTORY . makeRecordStorage ( ids , hints , dataclasses ) ; } | Make a new record storage to associate the given ids with an object of class dataclass . | 52 | 20 |
156,817 | public static int [ ] randomPermutation ( final int [ ] out , Random random ) { for ( int i = out . length - 1 ; i > 0 ; i -- ) { // Swap with random preceeding element. int ri = random . nextInt ( i + 1 ) ; int tmp = out [ ri ] ; out [ ri ] = out [ i ] ; out [ i ] = tmp ; } return out ; } | Perform a random permutation of the array in - place . | 94 | 13 |
156,818 | protected void makeRunnerIfNeeded ( ) { // We don't need to make a SVG runner when there are no pending updates. boolean stop = true ; for ( WeakReference < UpdateRunner > wur : updaterunner ) { UpdateRunner ur = wur . get ( ) ; if ( ur == null ) { updaterunner . remove ( wur ) ; } else if ( ! ur . isEmpty ( ) ) { stop... | Join the runnable queue of a component . | 357 | 10 |
156,819 | @ Override public void fullRedraw ( ) { if ( ! ( getWidth ( ) > 0 && getHeight ( ) > 0 ) ) { LoggingUtil . warning ( "Thumbnail of zero size requested: " + visFactory ) ; return ; } if ( thumbid < 0 ) { // LoggingUtil.warning("Generating new thumbnail " + this); layer . appendChild ( SVGUtil . svgWaitIcon ( plot . getD... | Perform a full redraw . | 350 | 7 |
156,820 | public static Centroid make ( Relation < ? extends NumberVector > relation , DBIDs ids ) { final int dim = RelationUtil . dimensionality ( relation ) ; Centroid c = new Centroid ( dim ) ; double [ ] elems = c . elements ; int count = 0 ; for ( DBIDIter iter = ids . iter ( ) ; iter . valid ( ) ; iter . advance ( ) ) { N... | Static constructor from an existing relation . | 183 | 7 |
156,821 | protected void firstRow ( double [ ] buf , int band , NumberVector v1 , NumberVector v2 , int dim2 ) { // First cell: final double val1 = v1 . doubleValue ( 0 ) ; buf [ 0 ] = delta ( val1 , v2 . doubleValue ( 0 ) ) ; // Width of valid area: final int w = ( band >= dim2 ) ? dim2 - 1 : band ; // Fill remaining part of bu... | Fill the first row . | 141 | 5 |
156,822 | @ Override public double getWeight ( double distance , double max , double stddev ) { if ( stddev <= 0 ) { return 1 ; } double normdistance = distance / stddev ; return scaling * FastMath . exp ( - .5 * normdistance * normdistance ) / stddev ; } | Get Gaussian Weight using standard deviation for scaling . max is ignored . | 67 | 14 |
156,823 | public boolean nextLineExceptComments ( ) throws IOException { while ( nextLine ( ) ) { if ( comment == null || ! comment . reset ( buf ) . matches ( ) ) { tokenizer . initialize ( buf , 0 , buf . length ( ) ) ; return true ; } } return false ; } | Read the next line into the tokenizer . | 64 | 9 |
156,824 | public static Element makeArrow ( SVGPlot svgp , Direction dir , double x , double y , double size ) { final double hs = size / 2. ; switch ( dir ) { case LEFT : return new SVGPath ( ) . drawTo ( x + hs , y + hs ) . drawTo ( x - hs , y ) . drawTo ( x + hs , y - hs ) . drawTo ( x + hs , y + hs ) . close ( ) . makeElemen... | Draw an arrow at the given position . | 358 | 8 |
156,825 | private double hammingDistanceNumberVector ( NumberVector o1 , NumberVector o2 ) { final int d1 = o1 . getDimensionality ( ) , d2 = o2 . getDimensionality ( ) ; int differences = 0 ; int d = 0 ; for ( ; d < d1 && d < d2 ; d ++ ) { double v1 = o1 . doubleValue ( d ) , v2 = o2 . doubleValue ( d ) ; if ( v1 != v1 || v2 !=... | Version for number vectors . | 239 | 5 |
156,826 | public static long [ ] interleaveBits ( long [ ] coords , int iter ) { final int numdim = coords . length ; final long [ ] bitset = BitsUtil . zero ( numdim ) ; // convert longValues into zValues final long mask = 1L << 63 - iter ; for ( int dim = 0 ; dim < numdim ; dim ++ ) { if ( ( coords [ dim ] & mask ) != 0 ) { Bi... | Select the iter highest bit from each dimension . | 116 | 9 |
156,827 | public void visChanged ( VisualizationItem item ) { for ( int i = vlistenerList . size ( ) ; -- i >= 0 ; ) { final VisualizationListener listener = vlistenerList . get ( i ) ; if ( listener != null ) { listener . visualizationChanged ( item ) ; } } } | A visualization item has changed . | 66 | 6 |
156,828 | public static void setVisible ( VisualizerContext context , VisualizationTask task , boolean visibility ) { // Hide other tools if ( visibility && task . isTool ( ) ) { Hierarchy < Object > vistree = context . getVisHierarchy ( ) ; for ( It < VisualizationTask > iter2 = vistree . iterAll ( ) . filter ( VisualizationTas... | Utility function to change Visualizer visibility . | 164 | 9 |
156,829 | protected int findMerge ( int end , MatrixParadigm mat , PointerHierarchyRepresentationBuilder builder ) { assert ( end > 0 ) ; final DBIDArrayIter ix = mat . ix , iy = mat . iy ; final double [ ] matrix = mat . matrix ; double mindist = Double . POSITIVE_INFINITY ; int x = - 1 , y = - 1 ; // Find minimum: for ( int ox... | Perform the next merge step in AGNES . | 309 | 10 |
156,830 | private void updateCholesky ( ) { // TODO: further improve handling of degenerated cases? CholeskyDecomposition chol = new CholeskyDecomposition ( covariance ) ; if ( ! chol . isSPD ( ) ) { // Add a small value to the diagonal, to reduce some rounding problems. double s = 0. ; for ( int i = 0 ; i < covariance . length ... | Update the cholesky decomposition . | 299 | 8 |
156,831 | @ Override public boolean validate ( Class < ? extends C > obj ) throws ParameterException { if ( obj == null ) { throw new UnspecifiedParameterException ( this ) ; } if ( ! restrictionClass . isAssignableFrom ( obj ) ) { throw new WrongParameterValueException ( this , obj . getName ( ) , "Given class not a subclass / ... | Checks if the given parameter value is valid for this ClassParameter . If not a parameter exception is thrown . | 100 | 22 |
156,832 | protected void addListeners ( ) { // Listen for result changes, including the one we monitor context . addResultListener ( this ) ; context . addVisualizationListener ( this ) ; // Listen for database events only when needed. if ( task . has ( UpdateFlag . ON_DATA ) ) { context . addDataStoreListener ( this ) ; } } | Add the listeners according to the mask . | 74 | 8 |
156,833 | public void addGenerator ( Distribution gen ) { if ( trans != null ) { throw new AbortException ( "Generators may no longer be added when transformations have been applied." ) ; } axes . add ( gen ) ; dim ++ ; } | Add a new generator to the cluster . No transformations must have been added so far! | 51 | 17 |
156,834 | public void addRotation ( int axis1 , int axis2 , double angle ) { if ( trans == null ) { trans = new AffineTransformation ( dim ) ; } trans . addRotation ( axis1 , axis2 , angle ) ; } | Apply a rotation to the generator | 53 | 6 |
156,835 | public void addTranslation ( double [ ] v ) { if ( trans == null ) { trans = new AffineTransformation ( dim ) ; } trans . addTranslation ( v ) ; } | Add a translation to the generator | 39 | 6 |
156,836 | @ Override public List < double [ ] > generate ( int count ) { ArrayList < double [ ] > result = new ArrayList <> ( count ) ; while ( result . size ( ) < count ) { double [ ] d = new double [ dim ] ; for ( int i = 0 ; i < dim ; i ++ ) { d [ i ] = axes . get ( i ) . nextRandom ( ) ; } if ( trans != null ) { d = trans . ... | Generate the given number of additional points . | 158 | 9 |
156,837 | @ Override public Clustering < MeanModel > run ( Database database , Relation < V > relation ) { // Database objects to process final DBIDs ids = relation . getDBIDs ( ) ; // Choose initial means double [ ] [ ] means = initializer . chooseInitialMeans ( database , relation , k , getDistanceFunction ( ) ) ; // Setup clu... | Run k - means with cluster size constraints . | 342 | 9 |
156,838 | protected WritableDataStore < Meta > initializeMeta ( Relation < V > relation , double [ ] [ ] means ) { NumberVectorDistanceFunction < ? super V > df = getDistanceFunction ( ) ; // The actual storage final WritableDataStore < Meta > metas = DataStoreUtil . makeStorage ( relation . getDBIDs ( ) , DataStoreFactory . HIN... | Initialize the metadata storage . | 275 | 6 |
156,839 | protected void transfer ( final WritableDataStore < Meta > metas , Meta meta , ModifiableDBIDs src , ModifiableDBIDs dst , DBIDRef id , int dstnum ) { src . remove ( id ) ; dst . add ( id ) ; meta . primary = dstnum ; metas . put ( id , meta ) ; // Make sure the storage is up to date. } | Transfer a single element from one cluster to another . | 82 | 10 |
156,840 | public double toPValue ( double d , int n ) { double b = d / 30 + 1. / ( 36 * n ) ; double z = .5 * MathUtil . PISQUARE * MathUtil . PISQUARE * n * b ; // Exponential approximation if ( z < 1.1 || z > 8.5 ) { double e = FastMath . exp ( 0.3885037 - 1.164879 * z ) ; return ( e > 1 ) ? 1 : ( e < 0 ) ? 0 : e ; } // Tabula... | Convert Hoeffding D value to a p - value . | 260 | 14 |
156,841 | public static void run ( DBIDs ids , Processor ... procs ) { ParallelCore core = ParallelCore . getCore ( ) ; core . connect ( ) ; try { // TODO: try different strategies anyway! ArrayDBIDs aids = DBIDUtil . ensureArray ( ids ) ; final int size = aids . size ( ) ; int numparts = core . getParallelism ( ) ; // TODO: are... | Run a task on all available CPUs . | 337 | 8 |
156,842 | public void replot ( ) { width = co . size ( ) ; height = ( int ) Math . ceil ( width * .2 ) ; ratio = width / ( double ) height ; height = height < MIN_HEIGHT ? MIN_HEIGHT : height > MAX_HEIGHT ? MAX_HEIGHT : height ; if ( scale == null ) { scale = computeScale ( co ) ; } BufferedImage img = new BufferedImage ( width ... | Trigger a redraw of the OPTICS plot | 271 | 9 |
156,843 | public int scaleToPixel ( double reach ) { return ( Double . isInfinite ( reach ) || Double . isNaN ( reach ) ) ? 0 : // ( int ) Math . round ( scale . getScaled ( reach , height - .5 , .5 ) ) ; } | Scale a reachability distance to a pixel value . | 60 | 10 |
156,844 | public String getSVGPlotURI ( ) { if ( plotnum < 0 ) { plotnum = ThumbnailRegistryEntry . registerImage ( plot ) ; } return ThumbnailRegistryEntry . INTERNAL_PREFIX + plotnum ; } | Get the SVG registered plot number | 53 | 6 |
156,845 | public static OPTICSPlot plotForClusterOrder ( ClusterOrder co , VisualizerContext context ) { // Check for an existing plot // ArrayList<OPTICSPlot<D>> plots = ResultUtil.filterResults(co, // OPTICSPlot.class); // if (plots.size() > 0) { // return plots.get(0); // } final StylingPolicy policy = context . getStylingPol... | Static method to find an optics plot for a result or to create a new one using the given context . | 125 | 21 |
156,846 | public double [ ] [ ] inverse ( ) { // Build permuted identity matrix efficiently: double [ ] [ ] b = new double [ piv . length ] [ m ] ; for ( int i = 0 ; i < piv . length ; i ++ ) { b [ piv [ i ] ] [ i ] = 1. ; } return solveInplace ( b ) ; } | Find the inverse matrix . | 77 | 5 |
156,847 | private boolean parseLine ( ) { cureid = null ; curpoly = null ; curlbl = null ; polys . clear ( ) ; coords . clear ( ) ; labels . clear ( ) ; Matcher m = COORD . matcher ( reader . getBuffer ( ) ) ; for ( /* initialized by nextLineExceptComments */ ; tokenizer . valid ( ) ; tokenizer . advance ( ) ) { m . region ( tok... | Parse a single line . | 533 | 6 |
156,848 | public void runResultHandlers ( ResultHierarchy hier , Database db ) { // Run result handlers for ( ResultHandler resulthandler : resulthandlers ) { Thread . currentThread ( ) . setName ( resulthandler . toString ( ) ) ; resulthandler . processNewResult ( hier , db ) ; } } | Run the result handlers . | 77 | 5 |
156,849 | @ SuppressWarnings ( "unchecked" ) public static void setDefaultHandlerVisualizer ( ) { defaultHandlers = new ArrayList <> ( 1 ) ; Class < ? extends ResultHandler > clz ; try { clz = ( Class < ? extends ResultHandler > ) Thread . currentThread ( ) . getContextClassLoader ( ) . loadClass ( // "de.lmu.ifi.dbs.elki.result... | Set the default handler to the Batik addon visualizer if available . | 131 | 14 |
156,850 | public synchronized void connect ( ) { if ( executor == null ) { executor = new ThreadPoolExecutor ( 0 , processors , 10L , TimeUnit . MILLISECONDS , new LinkedBlockingQueue < Runnable > ( ) ) ; executor . allowCoreThreadTimeOut ( true ) ; } if ( ++ connected == 1 ) { executor . allowCoreThreadTimeOut ( false ) ; execu... | Connect to the executor . | 109 | 6 |
156,851 | public void add ( double x , double y ) { data . add ( x ) ; data . add ( y ) ; minx = Math . min ( minx , x ) ; maxx = Math . max ( maxx , x ) ; miny = Math . min ( miny , y ) ; maxy = Math . max ( maxy , y ) ; } | Add a coordinate pair but don t simplify | 78 | 8 |
156,852 | public void addAndSimplify ( double x , double y ) { // simplify curve when possible: final int len = data . size ( ) ; if ( len >= 4 ) { // Look at the previous 2 points final double l1x = data . get ( len - 4 ) ; final double l1y = data . get ( len - 3 ) ; final double l2x = data . get ( len - 2 ) ; final double l2y ... | Add a coordinate pair performing curve simplification if possible . | 292 | 11 |
156,853 | public void rescale ( double sx , double sy ) { for ( int i = 0 ; i < data . size ( ) ; i += 2 ) { data . set ( i , sx * data . get ( i ) ) ; data . set ( i + 1 , sy * data . get ( i + 1 ) ) ; } maxx *= sx ; maxy *= sy ; } | Rescale the graph . | 85 | 6 |
156,854 | private IndexTreePath < E > choosePath ( AbstractMTree < ? , N , E , ? > tree , E object , IndexTreePath < E > subtree ) { N node = tree . getNode ( subtree . getEntry ( ) ) ; // leaf if ( node . isLeaf ( ) ) { return subtree ; } // Initialize from first: int bestIdx = 0 ; E bestEntry = node . getEntry ( 0 ) ; double b... | Chooses the best path of the specified subtree for insertion of the given object . | 247 | 17 |
156,855 | public void rewind ( ) { synchronized ( used ) { for ( ParameterPair pair : used ) { current . addParameter ( pair ) ; } used . clear ( ) ; } } | Rewind the configuration to the initial situation | 40 | 8 |
156,856 | public UniformDistribution estimate ( double min , double max , final int count ) { double grow = ( count > 1 ) ? 0.5 * ( max - min ) / ( count - 1 ) : 0. ; return new UniformDistribution ( Math . max ( min - grow , - Double . MAX_VALUE ) , Math . min ( max + grow , Double . MAX_VALUE ) ) ; } | Estimate from simple characteristics . | 84 | 6 |
156,857 | public static double cdf ( double val , double k , double lambda , double theta ) { return ( val > theta ) ? // ( 1.0 - FastMath . exp ( - FastMath . pow ( ( val - theta ) / lambda , k ) ) ) // : val == val ? 0.0 : Double . NaN ; } | CDF of Weibull distribution | 74 | 7 |
156,858 | public static double quantile ( double val , double k , double lambda , double theta ) { if ( val < 0.0 || val > 1.0 ) { return Double . NaN ; } else if ( val == 0 ) { return 0.0 ; } else if ( val == 1 ) { return Double . POSITIVE_INFINITY ; } else { return theta + lambda * FastMath . pow ( - FastMath . log ( 1.0 - val... | Quantile function of Weibull distribution | 111 | 8 |
156,859 | public PCAResult processIds ( DBIDs ids , Relation < ? extends NumberVector > database ) { return processCovarMatrix ( covarianceMatrixBuilder . processIds ( ids , database ) ) ; } | Run PCA on a collection of database IDs . | 49 | 10 |
156,860 | public PCAResult processQueryResult ( DoubleDBIDList results , Relation < ? extends NumberVector > database ) { return processCovarMatrix ( covarianceMatrixBuilder . processQueryResults ( results , database ) ) ; } | Run PCA on a QueryResult Collection . | 49 | 9 |
156,861 | public boolean isFullRank ( ) { // Find maximum: double t = 0. ; for ( int j = 0 ; j < n ; j ++ ) { double v = Rdiag [ j ] ; if ( v == 0 ) { return false ; } v = Math . abs ( v ) ; t = v > t ? v : t ; } t *= 1e-15 ; // Numerical precision threshold. for ( int j = 1 ; j < n ; j ++ ) { if ( Math . abs ( Rdiag [ j ] ) < t... | Is the matrix full rank? | 130 | 6 |
156,862 | public int rank ( double t ) { int rank = n ; for ( int j = 0 ; j < n ; j ++ ) { if ( Math . abs ( Rdiag [ j ] ) <= t ) { -- rank ; } } return rank ; } | Get the matrix rank? | 54 | 5 |
156,863 | private void setupCSS ( VisualizerContext context , SVGPlot svgp , XYPlot plot ) { StyleLibrary style = context . getStyleLibrary ( ) ; for ( XYPlot . Curve curve : plot ) { CSSClass csscls = new CSSClass ( this , SERIESID + curve . getColor ( ) ) ; // csscls.setStatement(SVGConstants.SVG_STROKE_WIDTH_ATTRIBUTE, "0.2%"... | Setup the CSS classes for the plot . | 380 | 8 |
156,864 | @ Override public int compareTo ( EigenPair o ) { if ( this . eigenvalue < o . eigenvalue ) { return - 1 ; } if ( this . eigenvalue > o . eigenvalue ) { return + 1 ; } return 0 ; } | Compares this object with the specified object for order . Returns a negative integer zero or a positive integer as this object s eigenvalue is greater than equal to or less than the specified object s eigenvalue . | 59 | 43 |
156,865 | protected static double calcPosterior ( double f , double alpha , double mu , double sigma , double lambda ) { final double pi = calcP_i ( f , mu , sigma ) ; final double qi = calcQ_i ( f , lambda ) ; return ( alpha * pi ) / ( alpha * pi + ( 1.0 - alpha ) * qi ) ; } | Compute the a posterior probability for the given parameters . | 82 | 11 |
156,866 | public void split ( ) { if ( hasChildren ( ) ) { return ; } final boolean issplit = ( maxSplitDimension >= ( getDimensionality ( ) - 1 ) ) ; final int childLevel = issplit ? level + 1 : level ; final int splitDim = issplit ? 0 : maxSplitDimension + 1 ; final double splitPoint = getMin ( splitDim ) + ( getMax ( splitDim... | Splits this interval into 2 children . | 442 | 8 |
156,867 | @ Override public void run ( ) { MultipleObjectsBundle data = generator . loadData ( ) ; if ( LOG . isVerbose ( ) ) { LOG . verbose ( "Writing output ..." ) ; } try { if ( outputFile . exists ( ) && LOG . isVerbose ( ) ) { LOG . verbose ( "The file " + outputFile + " already exists, " + "the generator result will be AP... | Runs the wrapper with the specified arguments . | 179 | 9 |
156,868 | private static long getGlobalSeed ( ) { String sseed = System . getProperty ( "elki.seed" ) ; return ( sseed != null ) ? Long . parseLong ( sseed ) : System . nanoTime ( ) ; } | Initialize the default random . | 52 | 6 |
156,869 | public double computeFirstCover ( boolean leaf ) { double max = 0. ; for ( DistanceEntry < E > e : firstAssignments ) { double cover = leaf ? e . getDistance ( ) : ( e . getEntry ( ) . getCoveringRadius ( ) + e . getDistance ( ) ) ; max = cover > max ? cover : max ; } return max ; } | Compute the covering radius of the first assignment . | 82 | 10 |
156,870 | public double computeSecondCover ( boolean leaf ) { double max = 0. ; for ( DistanceEntry < E > e : secondAssignments ) { double cover = leaf ? e . getDistance ( ) : ( e . getEntry ( ) . getCoveringRadius ( ) + e . getDistance ( ) ) ; max = cover > max ? cover : max ; } return max ; } | Compute the covering radius of the second assignment . | 82 | 10 |
156,871 | protected void offerAt ( final int pos , O e ) { if ( pos == NO_VALUE ) { // resize when needed if ( size + 1 > queue . length ) { resize ( size + 1 ) ; } index . put ( e , size ) ; size ++ ; heapifyUp ( size - 1 , e ) ; heapModified ( ) ; return ; } assert ( pos >= 0 ) : "Unexpected negative position." ; assert ( queu... | Offer element at the given position . | 149 | 8 |
156,872 | public O removeObject ( O e ) { int pos = index . getInt ( e ) ; return ( pos >= 0 ) ? removeAt ( pos ) : null ; } | Remove the given object from the queue . | 36 | 8 |
156,873 | private long sumMatrix ( int [ ] [ ] mat ) { long ret = 0 ; for ( int i = 0 ; i < mat . length ; i ++ ) { final int [ ] row = mat [ i ] ; for ( int j = 0 ; j < row . length ; j ++ ) { ret += row [ j ] ; } } return ret ; } | Compute the sum of a matrix . | 76 | 8 |
156,874 | private int countAboveThreshold ( int [ ] [ ] mat , double threshold ) { int ret = 0 ; for ( int i = 0 ; i < mat . length ; i ++ ) { int [ ] row = mat [ i ] ; for ( int j = 0 ; j < row . length ; j ++ ) { if ( row [ j ] >= threshold ) { ret ++ ; } } } return ret ; } | Count the number of cells above the threshold . | 87 | 9 |
156,875 | private int [ ] [ ] houghTransformation ( boolean [ ] [ ] mat ) { final int xres = mat . length , yres = mat [ 0 ] . length ; final double tscale = STEPS * .66 / ( xres + yres ) ; final int [ ] [ ] ret = new int [ STEPS ] [ STEPS ] ; for ( int x = 0 ; x < mat . length ; x ++ ) { final boolean [ ] row = mat [ x ] ; for ... | Perform a hough transformation on the binary image in mat . | 217 | 13 |
156,876 | private static void drawLine ( int x0 , int y0 , int x1 , int y1 , boolean [ ] [ ] pic ) { final int xres = pic . length , yres = pic [ 0 ] . length ; // Ensure bounds y0 = ( y0 < 0 ) ? 0 : ( y0 >= yres ) ? ( yres - 1 ) : y0 ; y1 = ( y1 < 0 ) ? 0 : ( y1 >= yres ) ? ( yres - 1 ) : y1 ; x0 = ( x0 < 0 ) ? 0 : ( x0 >= xres... | Draw a line onto the array using the classic Bresenham algorithm . | 328 | 15 |
156,877 | public Collection < String > getPossibleValues ( ) { // Convert to string array final E [ ] enums = enumClass . getEnumConstants ( ) ; ArrayList < String > values = new ArrayList <> ( enums . length ) ; for ( E t : enums ) { values . add ( t . name ( ) ) ; } return values ; } | Get a list of possible values for this enum parameter . | 79 | 11 |
156,878 | private String joinEnumNames ( String separator ) { E [ ] enumTypes = enumClass . getEnumConstants ( ) ; StringBuilder sb = new StringBuilder ( ) ; for ( int i = 0 ; i < enumTypes . length ; ++ i ) { if ( i > 0 ) { sb . append ( separator ) ; } sb . append ( enumTypes [ i ] . name ( ) ) ; } return sb . toString ( ) ; } | Utility method for merging possible values into a string for informational messages . | 102 | 14 |
156,879 | @ Override protected void preInsert ( MkMaxEntry entry ) { KNNHeap knns_o = DBIDUtil . newHeap ( getKmax ( ) ) ; preInsert ( entry , getRootEntry ( ) , knns_o ) ; } | Adapts the knn distances before insertion of the specified entry . | 57 | 13 |
156,880 | public static IntIterator getCommonDimensions ( Collection < SplitHistory > splitHistories ) { Iterator < SplitHistory > it = splitHistories . iterator ( ) ; long [ ] checkSet = BitsUtil . copy ( it . next ( ) . dimBits ) ; while ( it . hasNext ( ) ) { SplitHistory sh = it . next ( ) ; BitsUtil . andI ( checkSet , sh .... | Get the common split dimensions from a list of split histories . | 107 | 12 |
156,881 | public static Filter handleURL ( ParsedURL url ) { if ( LOG . isDebuggingFiner ( ) ) { LOG . debugFiner ( "handleURL " + url . toString ( ) ) ; } if ( ! isCompatibleURLStatic ( url ) ) { return null ; } int id ; try { id = ParseUtil . parseIntBase10 ( url . getPath ( ) ) ; } catch ( NumberFormatException e ) { return n... | Statically handle the URL access . | 193 | 7 |
156,882 | public static int globalCentroid ( Centroid overallCentroid , Relation < ? extends NumberVector > rel , List < ? extends Cluster < ? > > clusters , NumberVector [ ] centroids , NoiseHandling noiseOption ) { int clustercount = 0 ; Iterator < ? extends Cluster < ? > > ci = clusters . iterator ( ) ; for ( int i = 0 ; ci .... | Update the global centroid . | 294 | 6 |
156,883 | public DBID findPrototype ( DBIDs members ) { // Find the last merge within the cluster. // The object with maximum priority will merge outside of the cluster, // So we need the second largest priority. DBIDIter it = members . iter ( ) ; DBIDVar proto = DBIDUtil . newVar ( it ) , last = DBIDUtil . newVar ( it ) ; int m... | Extract the prototype of a given cluster . When the argument is not a valid cluster of this Pointer Hierarchy the return value is unspecified . | 221 | 29 |
156,884 | public void bulkLoad ( DBIDs ids ) { if ( ids . size ( ) == 0 ) { return ; } assert ( root == null ) : "Tree already initialized." ; DBIDIter it = ids . iter ( ) ; DBID first = DBIDUtil . deref ( it ) ; // Compute distances to all neighbors: ModifiableDoubleDBIDList candidates = DBIDUtil . newDistanceDBIDList ( ids . s... | Bulk - load the index . | 156 | 7 |
156,885 | private void checkCoverTree ( Node cur , int [ ] counts , int depth ) { counts [ 0 ] += 1 ; // Node count counts [ 1 ] += depth ; // Sum of depth counts [ 2 ] = depth > counts [ 2 ] ? depth : counts [ 2 ] ; // Max depth counts [ 3 ] += cur . singletons . size ( ) - 1 ; counts [ 4 ] += cur . singletons . size ( ) - ( cu... | Collect some statistics on the tree . | 161 | 7 |
156,886 | protected void addToStatistics ( NumberVector nv ) { final int d = nv . getDimensionality ( ) ; assert ( d == ls . length ) ; this . n ++ ; for ( int i = 0 ; i < d ; i ++ ) { double v = nv . doubleValue ( i ) ; ls [ i ] += v ; ss += v * v ; } } | Add a number vector to the current node . | 82 | 9 |
156,887 | protected void addToStatistics ( ClusteringFeature other ) { n += other . n ; VMath . plusEquals ( ls , other . ls ) ; ss += other . ss ; } | Merge an other clustering features . | 40 | 8 |
156,888 | public double sumOfSquaresOfSums ( ) { double sum = 0. ; for ( int i = 0 ; i < ls . length ; i ++ ) { double v = ls [ i ] ; sum += v * v ; } return sum ; } | Sum over all dimensions of squares of linear sums . | 54 | 10 |
156,889 | public static double sumOfSquares ( NumberVector v ) { final int dim = v . getDimensionality ( ) ; double sum = 0 ; for ( int d = 0 ; d < dim ; d ++ ) { double x = v . doubleValue ( d ) ; sum += x * x ; } return sum ; } | Compute the sum of squares of a vector . | 68 | 10 |
156,890 | private static void insertionSort ( int [ ] data , final int start , final int end , IntComparator comp ) { // Classic insertion sort. for ( int i = start + 1 ; i < end ; i ++ ) { final int cur = data [ i ] ; int j = i - 1 ; while ( j >= start ) { final int pre = data [ j ] ; if ( comp . compare ( cur , pre ) >= 0 ) { ... | Insertion sort for short arrays . | 120 | 7 |
156,891 | @ Override public double [ ] [ ] processIds ( DBIDs ids , Relation < ? extends NumberVector > relation ) { final int dim = RelationUtil . dimensionality ( relation ) ; final CovarianceMatrix cmat = new CovarianceMatrix ( dim ) ; final Centroid centroid = Centroid . make ( relation , ids ) ; // find maximum distance dou... | Weighted Covariance Matrix for a set of IDs . Since we are not supplied any distance information we ll need to compute it ourselves . Covariance is tied to Euclidean distance so it probably does not make much sense to add support for other distance functions? | 308 | 54 |
156,892 | @ Override public double [ ] [ ] processQueryResults ( DoubleDBIDList results , Relation < ? extends NumberVector > database , int k ) { final int dim = RelationUtil . dimensionality ( database ) ; final CovarianceMatrix cmat = new CovarianceMatrix ( dim ) ; // avoid bad parameters k = k <= results . size ( ) ? k : res... | Compute Covariance Matrix for a QueryResult Collection . | 327 | 12 |
156,893 | public Instance instantiate ( Database database , Relation < V > relation ) { DistanceQuery < V > dq = database . getDistanceQuery ( relation , EuclideanDistanceFunction . STATIC ) ; KNNQuery < V > knnq = database . getKNNQuery ( dq , settings . k ) ; WritableDataStore < PCAFilteredResult > storage = DataStoreUtil . ma... | Full instantiation interface . | 394 | 5 |
156,894 | public static void writeXHTML ( Document htmldoc , OutputStream out ) throws IOException { javax . xml . transform . Result result = new StreamResult ( out ) ; // Use a transformer for pretty printing Transformer xformer ; try { xformer = TransformerFactory . newInstance ( ) . newTransformer ( ) ; xformer . setOutputPr... | Write an HTML document to an output stream . | 247 | 9 |
156,895 | public static Element appendMultilineText ( Document htmldoc , Element parent , String text ) { String [ ] parts = text != null ? text . split ( "\n" ) : null ; if ( parts == null || parts . length == 0 ) { return parent ; } parent . appendChild ( htmldoc . createTextNode ( parts [ 0 ] ) ) ; for ( int i = 1 ; i < parts... | Append a multiline text to a node transforming linewraps into BR tags . | 144 | 19 |
156,896 | public int getPathCount ( ) { int result = 0 ; for ( IndexTreePath < E > path = this ; path != null ; path = path . parentPath ) { result ++ ; } return result ; } | Returns the number of elements in the path . | 45 | 9 |
156,897 | public OutlierResult run ( Database database , Relation < O > relation ) { StepProgress stepprog = LOG . isVerbose ( ) ? new StepProgress ( "CBLOF" , 3 ) : null ; DBIDs ids = relation . getDBIDs ( ) ; LOG . beginStep ( stepprog , 1 , "Computing clustering." ) ; Clustering < MeanModel > clustering = clusteringAlgorithm ... | Runs the CBLOF algorithm on the given database . | 533 | 12 |
156,898 | private int getClusterBoundary ( Relation < O > relation , List < ? extends Cluster < MeanModel > > clusters ) { int totalSize = relation . size ( ) ; int clusterBoundary = clusters . size ( ) - 1 ; int cumulativeSize = 0 ; for ( int i = 0 ; i < clusters . size ( ) - 1 ; i ++ ) { cumulativeSize += clusters . get ( i ) ... | Compute the boundary index separating the large cluster from the small cluster . | 177 | 14 |
156,899 | private void computeCBLOFs ( Relation < O > relation , NumberVectorDistanceFunction < ? super O > distance , WritableDoubleDataStore cblofs , DoubleMinMax cblofMinMax , List < ? extends Cluster < MeanModel > > largeClusters , List < ? extends Cluster < MeanModel > > smallClusters ) { List < NumberVector > largeClusterM... | Compute the CBLOF scores for all the data . | 372 | 12 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.