Algorithm-SVM
view release on metacpan or search on metacpan
Revision history for Perl extension Algorithm::SVM.
0.01 Thu Jun 27 11:16:17 2002
- original version; created by h2xs 1.21 with options
-n Algorithm::SVM svm.h
0.02 Mon Sep 23 13:12:51 EDT 2002
- compilation errors on Mac OS X fixed, other bug fixes
and code cleanups.
0.05 Tue Nov 26 10:46:46 PST 2002
- fixed build error for perl-5.8.0 with ithreads. Thanks
to Mike Castle for this report and patch.
4) BUGS
5) Algorithm::SVM COPYRIGHT AND LICENCE
6) libsvm COPYRIGHT AND LICENCE
7) AUTHOR INFORMATION
8) ACKNOWLEDGEMENTS
1) DESCRIPTION
--------------
Algorithm::SVM was originally written by Cory Spencer of the Simon Fraser
University Brinkman Laboratory and provides Perl bindings for a Support
Vector Machine. It is currently maintained by Matthew Laird and all
inquiries, patches and comments should be sent to him.
Algorithm::SVM is based on the libsvm library written by Chih-Chung Chang
and Chih-Jen Lin.
To read about the latest features, see the Changes file.
The author invites feedback on SVM. If you find a bug, please send the
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
7) AUTHOR INFORMATION
---------------------
The Perl Algorithm::SVM module was originally written by Cory Spencer but is
currently maintained by Matthew Laird <matt@brinkman.mbb.sfu.ca> of the
Brinkman Laboratory at Simon Fraser University, Burnaby, BC, Canada.
http://www.pathogenomics.sfu.ca/brinkman
Any questions related to the underlying library, libsvm, should be directed
to the authors of the libsvm package (Email contact: lincj@ccms.ntu.edu.tw).
The libsvm homepage is currently located at:
http://www.csie.ntu.edu.tw/~cjlin/libsvm/
count=count+1;
else
mae+=fabs(ymv[i]);
mae /= (prob->l-count);
info("Prob. model for test data: target value = predicted value + z,\nz: Laplace distribution e^(-|z|/sigma)/(2sigma),sigma= %g\n",mae);
free(ymv);
return mae;
}
// label: label name, start: begin of each class, count: #data of classes, perm: indices to the original data
// perm, length l, must be allocated before calling this subroutine
void svm_group_classes(const svm_problem *prob, int *nr_class_ret, int **label_ret, int **start_ret, int **count_ret, int *perm)
{
int l = prob->l;
int max_nr_class = 16;
int nr_class = 0;
int *label = Malloc(int,max_nr_class);
int *count = Malloc(int,max_nr_class);
int *data_label = Malloc(int,l);
int i;
( run in 1.108 second using v1.01-cache-2.11-cpan-1c8d708658b )