📄 readme.txt
字号:
------------------------------------------------------------------------KMlocal: A testbed for k-means clustering algorithms based on localsearchVersion: 1.7.1Date: 10/01/2005------------------------------------------------------------------------Copyright (c) 2004-2005 David M. Mount and the University of MarylandAll Rights Reserved.PLEASE READ THE FILE "Copyright.txt" FOR COPYRIGHT INFORMATION ANDDISCLAIMER.Author------David MountDept of Computer ScienceUniversity of Maryland,College Park, MD 20742 USAmount@cs.umd.eduhttp://www.cs.umd.edu/~mount/------------------------------------------------------------------------For detailed explanation of the k-means algorithm and technicalinformation the use of the program see the documentation filedoc/kmlocal-doc.pdf.Organization------------The source files for the testbed are stored mostly in src. Thedirectory ann contains utilities for building and search kd-trees.Consult the file README files in those directories for furtherinformation.The main executable file is kmltest. It is a driver, which provides aprimitive script language for inputting and generating data sets,running different algorithms on these data sets, and printingstatistical results. There is a utility km2fig, which produces xfigoutput from the kmltest output files. This is handy for generatingfigures for papers. README This file. Makefile The Makefile for compiling/testing everything. bin/ Where the executables are stored (kmltest) src/ The directory containing all the source files. test/ Some test input/output files for validation.Compilation-----------To start, you can compile kmltest (in theory) by entering (from thisdirectory) "make". This is set up for the g++ compiler (version 2.7.2or higher) on Solaris and will probably generate a number of errormessages if you try it from another compiler or platform. (I made noattempt to make it ANSI compatible).The program kmltest is the main driver for the algorithms. See the filesrc/kmltest-README for more information on the input to kmltest. To geta sense of what input files look like, you can look at the *.in files indirectory test. (By the way, don't trust any of the comments in thesefiles.)Validation----------To validate that you have successfully compiled everything enter (fromthis directory) "make validate". This will compare the results of myruns with the currently compiled version. Assuming the samearchitecture (Sun Solaris), and same random number generator (random())you should expect the same numerical results, although execution timeswill differ.If the random number generator is different then results will differmassively, since the algorithm's output is very sensitive to the initialset of centers, which are chosen randomly.Final Warning-------------Don't believe anything you read. (Not even this file). The program doeswhat it does; nothing more, nothing less. :-)History-------Version: 1.0 04/29/2002 Initial releaseVersion: 1.01 10/02/2002 Modified output levelsVersion: 1.1 04/08/2003 Added EZ_Hybrid and dampening. Fixed memory leaks.Version: 1.2 09/13/2003 No changes to the program. Created documention directory. Added sample programs, kmlsample.cpp and kmlminimal.cpp.Version: 1.3 01/18/2004 No changes to the program. Converted license to GNU General Public LicenseVersion: 1.4 02/05/2004 No changes to the program. Added a test for kmlminimal and kmlsample in the test directory.Version: 1.5 05/14/2004 Changed sample program kmlsample to allow random point generation. Made minor changes for compilation under Redhat Linux and Visual Studio.NET.Version: 1.6 03/09/2005 Fixed memory leak in KMfilterCenters.cpp, added project file for Microsoft Studio.NET, and fixed random number error for Microsoft Visual C++.Version: 1.7 08/10/2005 Fixed errors in documentation. Added capability for reporting final assignment to clusters.Version: 1.7.1 10/01/2005 No functional change. Corrected copyright text in source files.
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -