tutorial_on_spectral_clustering.zip - In recent years, spectral clustering has become one of the most popular modern clustering algorithms.
It is simple to implement, can be solved efficiently by standard linear algebra software, and very often outperforms
traditional clustering algorithms such as the k-means algorithm. Nevertheless, on the first glance spectral clustering
looks a bit mysterious, and it is not obvious to see why it works at all and what it really does. This article is a
tutorial introduction to spectral clustering. We describe different graph Laplacians and their basic properties,
present the most common spectral clustering algorithms, and derive those algorithms from scratch by several
different approaches. Advantages and disadvantages of the different spectral clustering algorithms are discussed.,2010-04-04 16:33:46,下载20次
SpectraLib.zip - This toolbox contains the code written to perform various spectral clustering algorithms. The details related to
the code and some experiments is available in [VM03]. This document is very short and the reader is encourage
to look at the directories to see other code.,2010-04-04 16:32:27,下载12次
matfile_format.zip - This document describes the internal format of MATLAB ® Version 5 and
Version 4 MAT-files. A MAT-file stores data in binary (not human-readable)
form. In MATLAB, you create MAT-files by using the save command, which
writes the arrays currently in memory to a file as a continuous byte stream. By
convention, this file has the filename extension .mat thus the name MAT-file.
The load command reads the arrays from a MAT-file into the MATLAB
workspace.,2010-04-04 16:31:22,下载6次
spectralclustering-1.1.zip - This directory includes sources used in the following paper:
Parallel Spectral Clustering in Distributed Systems
Wen-Yen Chen, Yangqiu Song, Hongjie Bai, Chih-Jen Lin, and Edward Chang
Accepted by IEEE Transactions on Pattern Analysis and Machine Intelligence, 2010
This code has been tested under 64-bit Linux environment using MATLAB 7.4.0.287 (R2007a).
You will be able to regenerate experiment results in the paper. However, results may be
slightly different due to the randomness, the CPU speed, and the load of your computer.
,2010-04-04 16:30:01,下载134次
Ncut.zip - 本文介绍了web文本聚类的流程，着重介绍了Normalized Cut谱聚类的原理和算法，提出以Minimum cut作为类内部的内聚强度作为衡量Normalized Cut的迭代停止条件,2010-04-04 16:24:59,下载144次