Sequential Superparamagnetic Clustering as Network Self-organisation Process
Description
Clustering methods are useful tools for the unsupervised classification and analysis of the elements of a set or scene, e.g., a visual or auditory scene. Such methods can be seen as an integral part of cognition-like operations performed by artificial systems. The problematic is that usually no a priori information is available about the structure, the size or the number of classes. Therefore, unbiased methods that are able to provide a 'natural' classification are of interest. As it has been shown (Blatt, Wiseman, Domany), superparamagnetic clustering (SC) is a promising algorithm that comes close to an ideal unbiased method. SC gives the option of choosing different classes on different resolution levels. It, however, does not directly provide an intrinsic criterion for the choice of the 'most natural' levels, i.e. for finding the most natural classes.
| Slides | |
| 0:02 | Sequential Superparamagnetic Clustering |
| 0:55 | Point out |
| 2:28 | Clustering |
| 2:44 | Drawing |
| 5:44 | Sheme |
| 6:53 | Drawing |
| 7:05 | Sheme |
| 7:15 | Superparamagnetic Clustering |
| 10:01 | Superparamagnetic Clustering (2) |
| 14:18 | Superparamagnetic Clustering: Example |
| 14:36 | Positive/Negative |
| 15:22 | Superparamagnetic Clustering: Example |
| 16:14 | Positive/Negative |
| 16:49 | Ultimate question |
| 18:43 | Failure |
| 19:33 | Superparamagnetic Clustering: Example |
| 19:48 | Failure |
| 20:09 | Ultimate question |
| 21:24 | Hebbian-like learning rule |
| 22:43 | Connections within clusters |
| 22:53 | Connections within clusters |
| 23:21 | Hebbian-like learning rule |
| 23:42 | Connections within clusters |
| 24:50 | Sequential superparamagnetic clustering SSC |
| 25:16 | Hebbian-like learning rule |
| 25:49 | Connections within clusters |
| 25:58 | Dendrogram |
| 27:19 | Sequential superparamagnetic clustering SSC (2) |
| 27:40 | Successful application of SSC |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Related content
SEE ALSO:
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !




