Beschreibung
Source: Wikipedia. Pages: 90. Chapters: BIRCH (data clustering), Canopy clustering algorithm, Cluster-weighted modeling, Cobweb (clustering), Complete-linkage clustering, Constrained clustering, CURE data clustering algorithm, Data stream clustering, DBSCAN, Expectation-maximization algorithm, FLAME clustering, Fuzzy clustering, Hierarchical clustering, Information bottleneck method, K-means++, K-means clustering, K-medians clustering, K-medoids, Linde-Buzo-Gray algorithm, Lloyd's algorithm, Nearest-neighbor chain algorithm, Neighbor joining, OPTICS algorithm, Pitman-Yor process, Self-organizing map, Single-linkage clustering, Spectral clustering, SUBCLU, UPGMA, Ward's method. Excerpt: 208 article summaries including: An Efficient Constrained K-Means Clustering using Self Organizing Map. Classification of Indian power coals using K-means clustering and self organizing map neural network. 4 The Kernel Pitman-Yor Process. The Expectation Maximization Algorithm. Space-Alternating Generalized Expectation-Maximization Algorithm. Expectation-maximization algorithm with local adaptivity. Distributed Data Clustering Using Expectation Maximization Algorithm. Symbol Based Modulation Classification using Combination of Fuzzy Clustering and Hierarchical Clustering. 12 The information bottleneck method. Rough self organizing map. Associative Self-Organizing Map. Supervised k-Means Clustering. A Parallel Training Algorithm for Hierarchical Pitman-Yor Process Language Models. 22 Parameter Estimation from Censored Samples using the Expectation-Maximization Algorithm. On-line expectation-maximization algorithm for latent data models. Comparing Approaches to Initializing the Expectation-Maximization Algorithm. On-line gossip-based distributed expectation maximization algorithm. A maximum likelihood expectation maximization algorithm with thresholding. A multiresolution diffused expectation-maximization algorithm for medical image segmentation. A robust Expectation-Maximization algorithm for Multiple Sclerosis lesion segmentation. A Pareto Self-Organizing Map. Graph based k-means clustering. Single Linkage Clustering and Continuum Percolation. 38 Why neighbor-joining works. Neighbor-Joining Revealed. Document Clustering using Sequential Information Bottleneck Method. 45 Document Clustering using Sequential Information Bottleneck Method. Image Segmentation Using Information Bottleneck Method. 49 Generalized Linear Gaussian Cluster-Weighted Modeling. The parameterless self-organizing map algorithm. A supervised self-organizing map for structures. Hybrid Self Organizing Map for Overlapping Clusters. Event Sequence Analysis using Self Organizing Map. Hybrid self organizing map for overlapping clusters. 60 The Parameter-Less Self-Organizing Map algorithm. 61 Self Organizing Map algorithm and distortion measure. 62 A Study of Parallel Self-Organizing Map. Fuzzy rough granular self organizing map. Game kernel design using self organizing map. Auditing Journal Entries Using Self-Organizing Map. Self-organizing map for symbolic data. Latent Semantic Indexing by Self-Organizing Map. The activation frequency self-organizing map. Data Visualization by Self-Organizing Map. Fast Learning Approach Using Self Organizing Map. Self Organizing Map algorithm and distortion measure. 77 Deterministic Feature Selection for $k$-means Clustering. Modifications in K-Means Clustering Algorithm. 79 Random Projecti.
Herstellerkennzeichnung:
BoD - Books on Demand
In de Tarpen 42
22848 Norderstedt
DE
E-Mail: info@bod.de
