enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Codes for electromagnetic scattering by spheres - Wikipedia

    en.wikipedia.org/wiki/Codes_for_electromagnetic...

    Codes which calculate exactly electromagnetic scattering by an aggregate of spheres and spheres within spheres for complex materials. Works in parallel as well. 2015 py_gmm G. Pellegrini [20] Python + Fortran A Python + Fortran 90 implementation of the Generalized Multiparticle Mie method, especially suited for plasmonics and near field ...

  3. Scagnostics - Wikipedia

    en.wikipedia.org/wiki/Scagnostics

    Scagnostics (scatterplot diagnostics) is a series of measures that characterize certain properties of a point cloud in a scatter plot. The term and idea was coined by John Tukey and Paul Tukey , though they didn't publish it; later it was elaborated by Wilkinson, Anand, and Grossman.

  4. scikit-learn - Wikipedia

    en.wikipedia.org/wiki/Scikit-learn

    scikit-learn (formerly scikits.learn and also known as sklearn) is a free and open-source machine learning library for the Python programming language. [3] It features various classification, regression and clustering algorithms including support-vector machines, random forests, gradient boosting, k-means and DBSCAN, and is designed to interoperate with the Python numerical and scientific ...

  5. Weka (software) - Wikipedia

    en.wikipedia.org/wiki/Weka_(software)

    Waikato Environment for Knowledge Analysis (Weka) is a collection of machine learning and data analysis free software licensed under the GNU General Public License. It was developed at the University of Waikato, New Zealand and is the companion software to the book "Data Mining: Practical Machine Learning Tools and Techniques". [1]

  6. DBSCAN - Wikipedia

    en.wikipedia.org/wiki/DBSCAN

    DBSCAN optimizes the following loss function: [10] For any possible clustering = {, …,} out of the set of all clusterings , it minimizes the number of clusters under the condition that every pair of points in a cluster is density-reachable, which corresponds to the original two properties "maximality" and "connectivity" of a cluster: [1]

  7. t-distributed stochastic neighbor embedding - Wikipedia

    en.wikipedia.org/wiki/T-distributed_stochastic...

    While t-SNE plots often seem to display clusters, the visual clusters can be strongly influenced by the chosen parameterization (especially the perplexity) and so a good understanding of the parameters for t-SNE is needed. Such "clusters" can be shown to even appear in structured data with no clear clustering, [13] and so

  8. Determining the number of clusters in a data set - Wikipedia

    en.wikipedia.org/wiki/Determining_the_number_of...

    The average silhouette of the data is another useful criterion for assessing the natural number of clusters. The silhouette of a data instance is a measure of how closely it is matched to data within its cluster and how loosely it is matched to data of the neighboring cluster, i.e., the cluster whose average distance from the datum is lowest. [8]

  9. Kibana - Wikipedia

    en.wikipedia.org/wiki/Kibana

    Users can create bar, line and scatter plots, or pie charts and maps on top of large volumes of data. [ 4 ] Kibana also provides a presentation tool, referred to as Canvas , that allows users to create slide decks that pull live data directly from Elasticsearch.