http://citeseerx.ist.psu.edu/index;jsessionid=1149D58E5AF143B2BFF8BF6392187875
SOM tutorial part 1 Kohonen's Self Organizing Feature Maps Introductory Note This tutorial is the first of two related to self organising feature maps. BioText Search Engine PubMed home Journal home : Nature Raphael Lis, Charles C. Karrasch, Michael G. Poulos, Balvir Kunar, David Redmond, Jose G. Barcia Duran, Chaitanya R. Badwe, William Schachterle, Michael Ginsberg, Jenny Xiang, Arash Rafii Tabrizi, Koji Shido, Zev Rosenwaks, Olivier Elemento, Nancy A. Speck, Jason M. FREE - Federal Registry for Educational Excellence FREE Features These features originally appeared on the FREE.ED.gov features blog. The features highlight resources and ideas related to holidays, awareness months, anniversaries and seasonal topics. January February March
Data Mining Algorithms In R/Clustering/Self-Organizing Maps (SOM) 1: Initialize the centroids. 2: repeat 3: Select the next object. 4: Determine the closest centroid to the object. 5: Update this centroid and the centroids that are close, i.e., in a specified neighborhood. 6: until The centroids don't change much or a threshold is exceeded. 7: Assign each object to its closest centroid and return the centroids and clusters. The kohonen package implements self-organizing maps as well as some extensions for supervised pattern recognition and data fusion.The som package provides functions for self-organizing maps.The wccsom package SOM networks for comparing patterns with peak shifts. som(data, grid=somgrid(), rlen = 100, alpha = c(0.05, 0.01), radius = quantile(nhbrdist, 0.67) * c(1, -1), init, toroidal = FALSE, n.hood, keep.data = TRUE) the arguments are: return an object of class "kohonen" with components:
Connexions - Sharing Knowledge and Building Communities Google Scholar Clustering - Introduction A Tutorial on Clustering Algorithms Introduction | K-means | Fuzzy C-means | Hierarchical | Mixture of Gaussians | Links Clustering: An Introduction What is Clustering? Clustering can be considered the most important unsupervised learning problem; so, as every other problem of this kind, it deals with finding a structure in a collection of unlabeled data. A loose definition of clustering could be “the process of organizing objects into groups whose members are similar in some way”.
ERIC - Education Resources Information Center An approach to overcome the limits of K-means Time ago, I posted a banal case to show the limits of K-mean clustering. A follower gave us a grid of different clustering techniques (calling internal routines of Mathematica) to solve the case discussed. As you know, I like write by myself the algorithms and I like show alternative paths, so I've decided to explain a powerful clustering algorithm based on the SVM.
ipl2: Information You Can Trust
CiteSeerx is an evolving scientific literature digital library and search engine that has focused primarily on the literature in computer and information science. CiteSeerx aims to improve the dissemination of scientific literature and to provide improvements in functionality, usability, availability, cost, comprehensiveness, efficiency, and timeliness in the access of scientific and scholarly knowledge. Rather than creating just another digital library, CiteSeerx attempts to provide resources such as algorithms, data, metadata, services, techniques, and software that can be used to promote other digital libraries. CiteSeerx has developed new methods and algorithms to index PostScript and PDF research articles on the Web. Citeseerx provides the following features. by jmercher Nov 30
Wow! Randomly your link. I really wish I knew a bout this site before! It's amazing! by nomel Nov 12