All entries.
Showing Items 101-110 of 537 on page 11 of 54: First Previous 6 7 8 9 10 11 12 13 14 15 16 Next Last

Logo ELKI 0.6.0

by erich - January 10, 2014, 18:32:28 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 9550 views, 1756 downloads, 3 subscriptions

About: ELKI is a framework for implementing data-mining algorithms with support for index structures, that includes a wide variety of clustering and outlier detection methods.

Changes:

Additions and Improvements from ELKI 0.5.5:

Algorithms

Clustering:

  • Hierarchical Clustering - the slower naive variants were added, and the code was refactored
  • Partition extraction from hierarchical clusterings - different linkage strategies (e.g. Ward)
  • Canopy pre-Clustering
  • Naive Mean-Shift Clustering
  • Affinity propagation clustering (both with distances and similarities / kernel functions)
  • K-means variations: Best-of-multiple-runs, bisecting k-means
  • New k-means initialization: farthest points, sample initialization
  • Cheng and Church Biclustering
  • P3C Subspace Clustering
  • One-dimensional clustering algorithm based on kernel density estimation

Outlier detection

  • COP - correlation outlier probabilities
  • LDF - a kernel density based LOF variant
  • Simplified LOF - a simpler version of LOF (not using reachability distance)
  • Simple Kernel Density LOF - a simple LOF using kernel density (more consistent than LDF)
  • Simple outlier ensemble algorithm
  • PINN - projection indexed nearest neighbors, via projected indexes.
  • ODIN - kNN graph based outlier detection
  • DWOF - Dynamic-Window Outlier Factor (contributed by Omar Yousry)
  • ABOD refactored, into ABOD, FastABOD and LBABOD

Distances

  • Geodetic distances now support different world models (WGS84 etc.) and are subtantially faster.
  • Levenshtein distances for processing strings, e.g. for analyzing phonemes (contributed code, see "Word segmentation through cross-lingual word-to-phoneme alignment", SLT2013, Stahlberg et al.)
  • Bray-Curtis, Clark, Kulczynski1 and Lorentzian distances with R-tree indexing support
  • Histogram matching distances
  • Probabilistic divergence distances (Jeffrey, Jensen-Shannon, Chi2, Kullback-Leibler)
  • Kulczynski2 similarity
  • Kernel similarity code has been refactored, and additional kernel functions have been added

Database Layer and Data Types

Projection layer * Parser for simple textual data (for use with Levenshtein distance) Various random projection families (including Feature Bagging, Achlioptas, and p-stable) Latitude+Longitude to ECEF Sparse vector improvements and bug fixes New filter: remove NaN values and missing values New filter: add histogram-based jitter New filter: normalize using statistical distributions New filter: robust standardization using Median and MAD New filter: Linear discriminant analysis (LDA)

Index Layer

  • Another speed up in R-trees
  • Refactoring of M- and R-trees: Support for different strategies in M-tree New strategies for M-tree splits Speedups in M-tree
  • New index structure: in-memory k-d-tree
  • New index structure: in-memory Locality Sensitive Hashing (LSH)
  • New index structure: approximate projected indexes, such as PINN
  • Index support for geodetic data - (Details: Geodetic Distance Queries on R-Trees for Indexing Geographic Data, SSTD13)
  • Sampled k nearest neighbors: reference KDD13 "Subsampling for Efficient and Effective Unsupervised Outlier Detection Ensembles"
  • Cached (precomputed) k-nearest neighbors to share across multiple runs
  • Benchmarking "algorithms" for indexes

Mathematics and Statistics

  • Many new distributions have been added, now 28 different distributions are supported
  • Additional estimation methods (using advanced statistics such as L-Moments), now 44 estimators are available
  • Trimming and Winsorizing
  • Automatic best-fit distribution estimation
  • Preprocessor using these distributions for rescaling data sets
  • API changes related to the new distributions support
  • More kernel density functions
  • RANSAC covariance matrix builder (unfortunately rather slow)

Visualization

  • 3D projected coordinates (Details: Interactive Data Mining with 3D-Parallel-Coordinate-Trees, SIGMOD2013)
  • Convex hulls now also include nested hierarchical clusters

Other

  • Parser speedups
  • Sparse vector bug fixes and improvements
  • Various bug fixes
  • PCA, MDS and LDA filters
  • Text output was slightly improved (but still needs to be redesigned from scratch - please contribute!)
  • Refactoring of hierarchy classes
  • New heap classes and infrastructure enhancements
  • Classes can have aliases, e.g. "l2" for euclidean distance.
  • Some error messages were made more informative.
  • Benchmarking classes, also for approximate nearest neighbor search.

Logo r-cran-svmpath 0.952

by r-cran-robot - February 1, 2012, 00:00:11 CET [ Project Homepage BibTeX Download ] 9470 views, 1979 downloads, 1 subscription

About: svmpath

Changes:

Fetched by r-cran-robot on 2012-02-01 00:00:11.755984


Logo LIBOCAS 0.93

by vf - June 20, 2010, 12:22:05 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 9232 views, 1378 downloads, 2 subscriptions

About: The library implements Optimized Cutting Plane Algorithm (OCAS) for efficient training of linear SVM classifiers from large-scale data.

Changes:

Implemented COFFIN framework which allows efficient training of invariant image classifiers via virtual examples.


Logo SVM and Kernel Methods Toolbox 0.5

by arakotom - June 10, 2008, 21:29:39 CET [ Project Homepage BibTeX Download ] 9168 views, 2154 downloads, 2 subscriptions

Rating Whole StarWhole StarWhole Star1/2 StarEmpty Star
(based on 1 vote)

About: SVM Toolbox fully written in Matlab (even the QP solver). Features : SVM, MultiClassSVM, One-Class, SV Regression, AUC-SVM and Rankboost, 1-norm SVM, Regularization Networks, Kernel Basis Pursuit [...]

Changes:

Initial Announcement on mloss.org.


Logo Penalized Partial Least Squares Regression 1.03

by nkraemer - May 5, 2009, 19:53:20 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 8895 views, 1314 downloads, 0 subscriptions

About: This package contains functions to estimate linear and nonlinear regression methods with Penalized Partial Least Squares.

Changes:
  • fixed several bugs
  • drastic speed-up of computation time

Logo HSSVM 1.0.1

by xjbean - June 8, 2010, 16:16:05 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 8859 views, 1757 downloads, 1 subscription

Rating Whole StarWhole StarWhole StarWhole StarWhole Star
(based on 1 vote)

About: HSSVM is a software for solving multi-class problem using Hyper-sphere Support Vector Machines model, implemented by Java.

Changes:
  1. From this version, the version number is normalized to hssvm1.0.1;
  2. In this version, we delete the features about running parameter searching and run-all from Ant script, that is, commands "ant search-param" and "ant run-all" which exist in previous version are no longer available, and they are replaced with commands "svm search conf" and "svm runall conf", both of them are used on Linux(or all other POSIX systems).If you want to use this program on Windows, the cygwin is required to be installed.

Logo KeplerWeka 20101008

by fracpete - October 9, 2010, 05:27:13 CET [ Project Homepage BibTeX Download ] 8837 views, 3054 downloads, 1 subscription

About: KeplerWeka represents the integration of all the functionality of the WEKA Machine Learning Workbench into the open-source scientific workflow Kepler. Among them are classification, [...]

Changes:
  • Now compatible with Kepler 2.0
  • New version of WEKA included (patched 3.7.2 release), WEKA's new package manager works in conjunction with Kepler
  • Renamed actor Count to ConditionalTee, introduced new Count actor
  • Removed actors OutputLogger, MultiSync, TwinSync

Logo r-cran-VR 7.2-49

by r-cran-robot - September 25, 2009, 00:00:00 CET [ Project Homepage BibTeX Download ] 8826 views, 2263 downloads, 1 subscription

About: VR

Changes:

Fetched by r-cran-robot on 2009-10-03 07:16:05.643423


Logo SimpleSVM 2.99

by gaelle - November 15, 2007, 16:59:45 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 8726 views, 1543 downloads, 0 subscriptions

About: The SimpleSVM toolbox contains the svm solver of the same name. The current version includes C-SVM, HM-SVM and nu-SVM based on the regularization path. It will soon include OC-SVM, regularization [...]

Changes:

Initial Announcement on mloss.org.


Logo FABIA 2.8.0

by hochreit - October 18, 2013, 10:14:57 CET [ Project Homepage BibTeX BibTeX for corresponding Paper Download ] 8657 views, 1812 downloads, 1 subscription

Rating Whole StarWhole StarWhole StarWhole Star1/2 Star
(based on 1 vote)

About: FABIA is a biclustering algorithm that clusters rows and columns of a matrix simultaneously. Consequently, members of a row cluster are similar to each other on a subset of columns and, analogously, members of a column cluster are similar to each other on a subset of rows. Biclusters are found by factor analysis where both the factors and the loading matrix are sparse. FABIA is a multiplicative model that extracts linear dependencies between samples and feature patterns. Applications include detection of transcriptional modules in gene expression data and identification of haplotypes/>identity by descent< consisting of rare variants obtained by next generation sequencing.

Changes:

CHANGES IN VERSION 2.8.0

NEW FEATURES

o rescaling of lapla
o extractPlot does not plot sorted matrices

CHANGES IN VERSION 2.4.0

o spfabia bugfixes

CHANGES IN VERSION 2.3.1

NEW FEATURES

o Getters and setters for class Factorization

2.0.0:

  • spfabia: fabia for a sparse data matrix (in sparse matrix format) and sparse vector/matrix computations in the code to speed up computations. spfabia applications: (a) detecting >identity by descent< in next generation sequencing data with rare variants, (b) detecting >shared haplotypes< in disease studies based on next generation sequencing data with rare variants;
  • fabia for non-negative factorization (parameter: non_negative);
  • changed to C and removed dependencies to Rcpp;
  • improved update for lambda (alpha should be smaller, e.g. 0.03);
  • introduced maximal number of row elements (lL);
  • introduced cycle bL when upper bounds nL or lL are effective;
  • reduced computational complexity;
  • bug fixes: (a) update formula for lambda: tighter approximation, (b) corrected inverse of the conditional covariance matrix of z;

1.4.0:

  • New option nL: maximal number of biclusters per row element;
  • Sort biclusters according to information content;
  • Improved and extended preprocessing;
  • Update to R2.13

Showing Items 101-110 of 537 on page 11 of 54: First Previous 6 7 8 9 10 11 12 13 14 15 16 Next Last