feedbackmine-libsvm-ruby 0.1.0

data/AUTHORS

@@ -0,0 +1,2 @@
+Rudi Cilibrasi <cilibrar@cilibrar.com> (rubysvm binding and packaging)
+FeedbackMine <feedbackmine@feedbackmine.com> (improvement and gem)

data/COPYING

@@ -0,0 +1,340 @@
+		    GNU GENERAL PUBLIC LICENSE
+		       Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.
+     59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+			    Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Library General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+		    GNU GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+  1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+  2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License.  (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) Accompany it with the complete corresponding machine-readable
+    source code, which must be distributed under the terms of Sections
+    1 and 2 above on a medium customarily used for software interchange; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code.  (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+  5. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+  6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+  7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+  10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+			    NO WARRANTY
+
+  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+		     END OF TERMS AND CONDITIONS
+
+	    How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year  name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+  `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+  <signature of Ty Coon>, 1 April 1989
+  Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Library General
+Public License instead of this License.

data/History.txt

@@ -0,0 +1,11 @@
+2009-02-15 feedbackmine.com
+       * Implemented several new methods:
+       Model#save
+       Model#load
+       Parameter#probability
+       Parameter#probability=
+
+2006-07-16  Rudi Cilibrasi <cilibrar@cilibrar.com>
+
+	* Finally repackaged using diffs, autotools, pbuilder for Debian, etc.
+

data/README.txt

@@ -0,0 +1,15 @@
+This is the Ruby binding for LIBSVM.
+Rudi Cilibrasi (cilibrar@cilibrar.com) wrote this Ruby binding.
+It makes it easy to use Support Vector Machines from Ruby.
+
+Improvements made by feedbackmine:
+Model#save
+Model#load
+Parameter#probability
+Parameter#probability=
+
+== INSTALLTION
+
+sudo apt-get install libsvm2 libsvm-dev
+sudo gem sources -a http://gems.github.com (you only have to do this once)
+sudo gem install feedbackmine-libsvm-ruby

data/Rakefile

@@ -0,0 +1,24 @@
+require 'rubygems'
+require 'hoe'
+
+EXT = "ext/blah.#{Hoe::DLEXT}"
+
+Hoe.new('libsvm-ruby', '0.1.0') do |p|
+  p.author = 'FeedbackMine'
+  p.email = 'feedbackmine@feedbackmine.com'
+  p.url = 'http://www.tweetjobsearch.com'
+  p.summary = 'ruby wrapper of libsvm'
+  p.description = 'ruby wrapper of libsvm'
+  
+  p.spec_extras[:extensions] = "ext/extconf.rb"
+  p.clean_globs << EXT << "ext/*.o" << "ext/Makefile"
+end
+
+task :test => EXT
+
+file EXT => ["ext/extconf.rb", "ext/main.cpp"] do       # 4
+  Dir.chdir "ext" do
+    ruby "extconf.rb"
+    sh "make"
+  end
+end

data/ext/extconf.rb

@@ -0,0 +1,9 @@
+require 'mkmf'
+#have_library('stdc++', "main")
+#have_library('svm', "main")
+$CFLAGS = "#{ENV['CFLAGS']} -Wall -O3 "
+pkg_config 'libsvm'
+if CONFIG["MAJOR"].to_i >= 1 && CONFIG["MINOR"].to_i >= 8
+  $CFLAGS << " -DHAVE_DEFINE_ALLOC_FUNCTION"
+end
+create_makefile('SVM')

data/ext/main.cpp

@@ -0,0 +1,727 @@
+/* RubySVM 1.0 by Rudi Cilibrasi (cilibrar@ofb.net)
+ * Released under the GPL
+ * Mon May 12 11:20:48 CEST 2003,
+ * based on libsvm-2.4
+ */
+
+#define obstack_chunk_alloc xmalloc
+#define obstack_chunk_free free
+
+#define HAVE_DEFINE_ALLOC_FUNCTION 1
+
+#include "ruby.h"
+#include "node.h"
+#include <string.h>
+#include <obstack.h>
+#include <stdio.h>
+#include <malloc.h>
+#include <libsvm/svm.h>
+#include <stdlib.h>
+
+VALUE mSVM, cSVMProblem, cSVMParameter, cSVMModel;
+static VALUE cMarshal;
+
+static int getSVCount(struct svm_model *m);
+
+struct RSVM_Problem {
+  struct svm_problem prob;
+  struct obstack xs, ys;
+  int k;
+};
+
+struct RSVM_Model {
+  struct svm_model *m;
+};
+
+struct RSVM_Parameter {
+  struct svm_parameter p;
+};
+
+VALUE svmpa_new(VALUE cl);
+
+/*
+ * Converts a Ruby array of consecutive values into a list of
+ * value-index svm_node's.
+ */
+struct svm_node *rubyArrayToNodelist(VALUE xs)
+{
+  //struct obstack xso;
+  struct svm_node *n;
+  int i;
+  int len = RARRAY(xs)->len;
+  n = (struct svm_node *) calloc(sizeof(struct svm_node), len+1);
+  for (i = 0; i < len; ++i) {
+    n[i].value = 1;
+    n[i].index = NUM2DBL(rb_ary_entry(xs, i));
+  }
+  n[i].value = 0;
+  n[i].index = -1;
+
+  return n;
+}
+
+/*
+ * Serializes an SVMParameter object
+ */
+VALUE svmpa_svm_dump(VALUE self, VALUE limit)
+{
+  struct RSVM_Parameter *rp;
+  VALUE obj = rb_ary_new();
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  rb_ary_push(obj, INT2NUM(rp->p.svm_type));
+  rb_ary_push(obj, INT2NUM(rp->p.kernel_type));
+  rb_ary_push(obj, rb_float_new(rp->p.degree));
+  rb_ary_push(obj, rb_float_new(rp->p.gamma));
+  rb_ary_push(obj, rb_float_new(rp->p.coef0));
+  rb_ary_push(obj, rb_float_new(rp->p.cache_size));
+  rb_ary_push(obj, rb_float_new(rp->p.eps));
+  rb_ary_push(obj, rb_float_new(rp->p.C));
+  rb_ary_push(obj, rb_float_new(rp->p.nu));
+  rb_ary_push(obj, rb_float_new(rp->p.p));
+  rb_ary_push(obj, INT2NUM(rp->p.shrinking));
+  return rb_funcall(cMarshal, rb_intern("dump"), 1, obj);
+}
+
+/*
+ * Deserializes an SVMParameter object
+ */
+
+VALUE svmpa_svm_load(VALUE kl, VALUE obj)
+{
+  struct RSVM_Parameter *rp;
+  printf("In load!\n");
+  VALUE self = svmpa_new(cSVMParameter);
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  printf("RP is %p\n", rp);
+  obj = rb_funcall(cMarshal, rb_intern("load"), 1, obj);
+  rp->p.svm_type = NUM2INT(rb_ary_entry(obj, 0));
+  printf("first!\n");
+  rp->p.kernel_type = NUM2INT(rb_ary_entry(obj, 1));
+  rp->p.degree = (int) NUM2DBL(rb_ary_entry(obj, 2));
+  rp->p.gamma = NUM2DBL(rb_ary_entry(obj, 3));
+  rp->p.coef0 = NUM2DBL(rb_ary_entry(obj, 4));
+  rp->p.cache_size = NUM2DBL(rb_ary_entry(obj, 5));
+  printf("midway!\n");
+  rp->p.eps = NUM2DBL(rb_ary_entry(obj, 6));
+  rp->p.C = NUM2DBL(rb_ary_entry(obj, 7));
+  rp->p.nu = NUM2DBL(rb_ary_entry(obj, 8));
+  rp->p.p = NUM2DBL(rb_ary_entry(obj, 9));
+  rp->p.shrinking = NUM2INT(rb_ary_entry(obj, 10));
+  printf("Never returned!\n");
+  return self;
+}
+
+/*
+ * Gets gamma value, the exponent used in the kernel function
+ */
+VALUE svmpa_gamma(VALUE self) {
+  struct RSVM_Parameter *rp;
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  return rb_float_new(rp->p.gamma);
+}
+
+/*
+ * Sets gamma value, the exponent used in the kernel function
+ */
+VALUE svmpa_gammaeq(VALUE self, VALUE eq) {
+  struct RSVM_Parameter *rp;
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  rp->p.gamma = NUM2DBL(eq);
+  return Qnil;
+}
+/*
+ * Gets coef0, the constant added in the polynomial kernel
+ */
+VALUE svmpa_coef0(VALUE self) {
+  struct RSVM_Parameter *rp;
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  return rb_float_new(rp->p.coef0);
+}
+
+/*
+ * Sets coef0, the constant added in the polynomial kernel
+ */
+VALUE svmpa_coef0eq(VALUE self, VALUE eq) {
+  struct RSVM_Parameter *rp;
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  rp->p.coef0 = NUM2DBL(eq);
+  return Qnil;
+}
+
+/*
+ * Gets coef0, the constant added in the polynomial kernel
+ */
+VALUE svmpa_probability(VALUE self) {
+  struct RSVM_Parameter *rp;
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  return rb_float_new(rp->p.probability);
+}
+
+/*
+ * Sets probability
+ */
+VALUE svmpa_probabilityeq(VALUE self, VALUE eq) {
+  struct RSVM_Parameter *rp;
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  rp->p.probability = NUM2DBL(eq);
+  return Qnil;
+}
+
+/*
+ * Gets cachesize, the number of megabytes of memory to use for the cache
+ */
+VALUE svmpa_cache_size(VALUE self) {
+  struct RSVM_Parameter *rp;
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  return rb_float_new(rp->p.cache_size);
+}
+
+/*
+ * Sets cachesize, the number of megabytes of memory to use for the cache
+ */
+VALUE svmpa_cache_sizeeq(VALUE self, VALUE eq) {
+  struct RSVM_Parameter *rp;
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  rp->p.cache_size = NUM2DBL(eq);
+  return Qnil;
+}
+/*
+ * Gets eps, the tolerance of termination criterion
+ */
+VALUE svmpa_eps(VALUE self) {
+  struct RSVM_Parameter *rp;
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  return rb_float_new(rp->p.eps);
+}
+
+/*
+ * Sets eps, the tolerance of termination criterion
+ */
+VALUE svmpa_epseq(VALUE self, VALUE eq) {
+  struct RSVM_Parameter *rp;
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  rp->p.eps = NUM2DBL(eq);
+  return Qnil;
+}
+/*
+ * Gets C, the cost parameter of C-SVC, epsilon-SVR, and nu-SVR
+ */
+VALUE svmpa_C(VALUE self) {
+  struct RSVM_Parameter *rp;
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  return rb_float_new(rp->p.C);
+}
+
+/*
+ * Sets C, the cost parameter of C-SVC, epsilon-SVR, and nu-SVR
+ */
+VALUE svmpa_Ceq(VALUE self, VALUE eq) {
+  struct RSVM_Parameter *rp;
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  rp->p.C = NUM2DBL(eq);
+  return Qnil;
+}
+
+/*
+ * Gets nu, the SV-ratio parameter of nu-SVC, one-class SVM, and nu-SVR
+ */
+VALUE svmpa_nu(VALUE self) {
+  struct RSVM_Parameter *rp;
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  return rb_float_new(rp->p.nu);
+}
+
+/*
+ * Sets nu, the SV-ratio parameter of nu-SVC, one-class SVM, and nu-SVR
+ */
+VALUE svmpa_nueq(VALUE self, VALUE eq) {
+  struct RSVM_Parameter *rp;
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  rp->p.nu = NUM2DBL(eq);
+  return Qnil;
+}
+
+/*
+ * Gets p, the zero-loss width zone in epsilon-insensitive SVR
+ */
+VALUE svmpa_p(VALUE self) {
+  struct RSVM_Parameter *rp;
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  return rb_float_new(rp->p.p);
+}
+
+/*
+ * Sets p, the zero-loss width zone in epsilon-insensitive SVR
+ */
+VALUE svmpa_peq(VALUE self, VALUE eq) {
+  struct RSVM_Parameter *rp;
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  rp->p.p = NUM2DBL(eq);
+  return Qnil;
+}
+
+/*
+ * Gets degree, the degree of the kernel function
+ */
+VALUE svmpa_degree(VALUE self) {
+  struct RSVM_Parameter *rp;
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  return rb_float_new(rp->p.degree);
+}
+
+/*
+ * Sets degree, the degree of the kernel function
+ */
+VALUE svmpa_degreeeq(VALUE self, VALUE eq) {
+  struct RSVM_Parameter *rp;
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  rp->p.degree = (int) NUM2DBL(eq);
+  return Qnil;
+}
+
+/*
+ * Gets kernel_type, which is one of:
+ * * LINEAR
+ * * POLY
+ * * RBF
+ * * SIGMOID
+ */
+VALUE svmpa_kernel_type(VALUE self) {
+  struct RSVM_Parameter *rp;
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  return INT2FIX(rp->p.kernel_type);
+}
+
+/*
+ * Sets kernel_type, which is one of:
+ * * LINEAR
+ * * POLY
+ * * RBF
+ * * SIGMOID
+ */
+VALUE svmpa_kernel_typeeq(VALUE self, VALUE eq) {
+  struct RSVM_Parameter *rp;
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  rp->p.kernel_type = FIX2INT(eq);
+  return Qnil;
+}
+
+/*
+ * Gets svm_type, which is one of:
+ * * C_SVC
+ * * NU_SVC
+ * * ONE_CLASS
+ * * EPSILON_SVR
+ * * NU_SVR
+ */
+VALUE svmpa_svm_type(VALUE self) {
+  struct RSVM_Parameter *rp;
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  return INT2FIX(rp->p.svm_type);
+}
+
+/*
+ * Sets svm_type, which is one of:
+ * * C_SVC
+ * * NU_SVC
+ * * ONE_CLASS
+ * * EPSILON_SVR
+ * * NU_SVR
+ */
+VALUE svmpa_svm_typeeq(VALUE self, VALUE eq) {
+  struct RSVM_Parameter *rp;
+  Data_Get_Struct(self, struct RSVM_Parameter, rp);
+  rp->p.svm_type = FIX2INT(eq);
+  return Qnil;
+}
+
+struct RSVM_Parameter *newParameter()
+{
+  struct RSVM_Parameter *rp = (struct RSVM_Parameter *)
+    calloc(sizeof(struct RSVM_Parameter), 1);
+  rp->p.svm_type = C_SVC;
+  rp->p.kernel_type = RBF;
+  rp->p.degree = 3;
+  rp->p.gamma = 0;
+  rp->p.coef0 = 0;
+  rp->p.nu = 0.5;
+  rp->p.cache_size = 40;
+  rp->p.C = 1;
+  rp->p.eps = 1e-3;
+  rp->p.p = 0.1;
+  rp->p.shrinking = 1;
+  rp->p.nr_weight = 0;
+  return rp;
+}
+
+/*
+ * Creates a new, empty SVMProblem object.
+ */
+struct RSVM_Problem *newProblem()
+{
+  struct RSVM_Problem *rprob = (struct RSVM_Problem *) calloc(sizeof(struct RSVM_Problem), 1);
+  rprob->prob.l = 0;
+  rprob->prob.x = NULL;
+  rprob->prob.y = NULL;
+  obstack_init(&rprob->xs);
+  obstack_init(&rprob->ys);
+  return rprob;
+}
+
+/*
+ * Adds an example to an SVMProblem given a target value and an input vector.
+ */
+void addExample(struct RSVM_Problem *rp, double y, struct svm_node *x)
+{
+  obstack_grow(&rp->ys, &y, sizeof(double));
+  obstack_grow(&rp->xs, &x, sizeof(struct svm_node *));
+}
+
+void syncProblem(struct RSVM_Problem *rp)
+{
+  rp->prob.l = obstack_object_size(&rp->ys) / sizeof(double);
+  rp->prob.y = (double *) obstack_base(&rp->ys);
+  rp->prob.x = (struct svm_node **) obstack_base(&rp->xs);
+}
+
+/*
+ * Frees an SVMModel
+ */
+static void svmpm_free(void *ptr)
+{
+  struct RSVM_Model *rp = (struct RSVM_Model *) ptr;
+  svm_destroy_model(rp->m);
+  free(rp);
+}
+
+/*
+ * Frees an SVMParameter
+ */
+static void svmpa_free(void *ptr)
+{
+  struct RSVM_Parameter *rp = (struct RSVM_Parameter *) ptr;
+  free(rp);
+}
+
+/*
+ * Frees an SVMProblem
+ */
+static void svmpr_free(void *ptr)
+{
+  struct RSVM_Problem *rp = (struct RSVM_Problem *) ptr;
+  int i;
+  syncProblem(rp);
+  for (i = 0; i < rp->prob.l; ++i)
+    free(rp->prob.x[i]);
+  obstack_free(&(rp->xs),NULL);
+  obstack_free(&(rp->ys),NULL);
+  free(rp);
+}
+
+/*
+ * Creates a new SVMParameter object.
+ * Uses the following default values:
+ * * svm_type = C_SVC
+ * * kernel_type = RBF
+ * * degree = 3
+ * * gamma = 1 / k (0 means this also)
+ * * coef0 = 0
+ * * nu = 0.5
+ * * cache_size = 40
+ * * C = 1
+ * * eps = 1e-3
+ * * p = 0.1
+ * * shrinking = 1
+ * * nr_weight = 0
+ */
+VALUE svmpa_new(VALUE cl)
+{
+  struct RSVM_Parameter *rp = newParameter();
+  VALUE tdata = Data_Wrap_Struct(cl, 0, svmpa_free, rp);
+  printf("In the new!!\n");
+  rb_obj_call_init(tdata, 0, NULL);
+  return tdata;
+}
+
+#ifdef HAVE_DEFINE_ALLOC_FUNCTION
+static VALUE svmpa_allocate(VALUE kl) {
+  return svmpa_new(kl);
+}
+#endif
+
+/*
+ * Creates a new, empty SVMProblem object.
+ */
+VALUE svmpr_new(VALUE cl)
+{
+  struct RSVM_Problem *rp = newProblem();
+  VALUE tdata = Data_Wrap_Struct(cl, 0, svmpr_free, rp);
+  rb_obj_call_init(tdata, 0, NULL);
+  return tdata;
+}
+
+/*
+ * Trains an SVM according to a given problem set and parameter specification
+ */
+VALUE svmpm_new(VALUE cl, VALUE prob, VALUE par)
+{
+  struct RSVM_Model *rp = (struct RSVM_Model *) calloc(sizeof(struct RSVM_Model), 1);
+  struct RSVM_Problem *cpro;
+  struct RSVM_Parameter *cpa;
+  bool defgamma = false;
+  VALUE tdata = Data_Wrap_Struct(cl, 0, svmpm_free, rp);
+  Data_Get_Struct(prob, struct RSVM_Problem, cpro);
+  Data_Get_Struct(par, struct RSVM_Parameter, cpa);
+  syncProblem(cpro);
+  if (cpa->p.gamma == 0)
+    defgamma = true;
+  if (defgamma)
+    cpa->p.gamma = 1.0 / (double) cpro->k;
+  cpa->p.probability = 1;
+  rp->m = svm_train(&cpro->prob, &cpa->p);
+  if (defgamma)
+    cpa->p.gamma = 0;
+  rb_obj_call_init(tdata, 0, NULL);
+  return tdata;
+}
+
+static VALUE svmpm_predict_values(VALUE self, VALUE xs)
+{
+  struct RSVM_Model *rp;
+  double *pe;
+  struct svm_node *x = rubyArrayToNodelist(xs);
+  int i, nr_class, numvals;
+  VALUE decvals;
+  Data_Get_Struct(self, struct RSVM_Model, rp);
+  nr_class = svm_get_nr_class(rp->m);
+  decvals = rb_ary_new();
+  numvals = (nr_class * (nr_class - 1))/2;
+  pe = (double *) calloc(numvals, sizeof(double));
+  svm_predict_values(rp->m, x, pe);
+  for (i = 0; i < numvals; i += 1)
+    rb_ary_push(decvals, rb_float_new(pe[i]));
+  free(pe);
+  return decvals;
+}
+
+static VALUE svmpm_predict_probability(VALUE self, VALUE xs)
+{
+  double result;
+  struct RSVM_Model *rp;
+  double *pe;
+  struct svm_node *x = rubyArrayToNodelist(xs);
+  int i;
+  VALUE probs, retval;
+  retval = rb_ary_new();
+  Data_Get_Struct(self, struct RSVM_Model, rp);
+  probs = rb_ary_new();
+  pe = (double *) calloc(svm_get_nr_class(rp->m), sizeof(double));
+  result = svm_predict_probability(rp->m, x, pe);
+  for (i = 0; i < svm_get_nr_class(rp->m); i += 1)
+    rb_ary_push(probs, rb_float_new(pe[i]));
+  free(pe);
+  rb_ary_push(retval, rb_float_new(result));
+  rb_ary_push(retval, probs);
+  return retval;
+}
+
+/*
+ * Predicts a value (regression or classification) based on an input vector
+ */
+static VALUE svmpm_predict(VALUE self, VALUE xs)
+{
+  double result;
+  struct RSVM_Model *rp;
+  Data_Get_Struct(self, struct RSVM_Model, rp);
+  struct svm_node *x = rubyArrayToNodelist(xs);
+  result = svm_predict(rp->m, x);
+  free(x);
+  return rb_float_new(result);
+}
+
+static VALUE svmpm_save(VALUE self, VALUE filename)
+{
+  int result;
+  struct RSVM_Model *rp;
+  Data_Get_Struct(self, struct RSVM_Model, rp);
+  char *name = STR2CSTR(filename);
+  result = svm_save_model(name, rp->m);
+  return INT2FIX(result);
+}
+
+static VALUE svmpm_load(VALUE cl, VALUE filename)
+{
+  struct RSVM_Model *rp = (struct RSVM_Model *) calloc(sizeof(struct RSVM_Model), 1);
+  char *name = STR2CSTR(filename);
+  struct svm_model * model = svm_load_model(name);
+  rp->m = model;
+  return Data_Wrap_Struct(cl, 0, svmpm_free, rp);
+}
+
+/*
+ * Initializes an SVMModel
+ */
+static VALUE svmpm_init(VALUE self)
+{
+  return self;
+}
+
+/*
+ * Initializes an SVMParameter
+ */
+static VALUE svmpa_init(VALUE self)
+{
+  return self;
+}
+
+/*
+ * Initializes an SVMProblem
+ */
+static VALUE svmpr_init(VALUE self)
+{
+  return self;
+}
+
+/*
+ * Returns the number of samples in an SVMProblem
+ */
+static VALUE svmpr_size(VALUE self)
+{
+  struct RSVM_Problem *rp;
+  Data_Get_Struct(self, struct RSVM_Problem, rp);
+  syncProblem(rp);
+  return INT2FIX(rp->prob.l);
+}
+
+/*
+ * Returns the number of Support Vectors in an SVMModel
+ */
+static VALUE svmpm_svcount(VALUE self)
+{
+  struct RSVM_Model *rp;
+  Data_Get_Struct(self, struct RSVM_Model, rp);
+  return INT2FIX(getSVCount(rp->m));
+}
+
+/*
+ * Adds a training example to an SVMProblem
+ */
+static VALUE svmpr_addex(VALUE self, VALUE y, VALUE xs)
+{
+  struct RSVM_Problem *rp;
+  struct svm_node *fini;
+  double yd;
+  Data_Get_Struct(self, struct RSVM_Problem, rp);
+  yd = NUM2DBL(y);
+  fini = rubyArrayToNodelist(xs);
+  addExample(rp, yd, fini);
+  if (rp->k == 0) rp->k = RARRAY(xs)->len;
+  return Qnil;
+}
+
+/* To be removed in next version */
+struct svm_model
+{
+	svm_parameter param;	// parameter
+	int nr_class;		// number of classes, = 2 in regression/one class svm
+	int l;			// total #SV
+	svm_node **SV;		// SVs (SV[l])
+	double **sv_coef;	// coefficients for SVs in decision functions (sv_coef[n-1][l])
+	double *rho;		// constants in decision functions (rho[n*(n-1)/2])
+
+	// for classification only
+
+	int *label;		// label of each class (label[n])
+	int *nSV;		// number of SVs for each class (nSV[n])
+				// nSV[0] + nSV[1] + ... + nSV[n-1] = l
+	// XXX
+	int free_sv;		// 1 if svm_model is created by svm_load_model
+				// 0 if svm_model is created by svm_train
+};
+
+static int getSVCount(struct svm_model *m)
+{
+  return m->l;
+}
+
+extern "C" {
+void Init_SVM();
+};
+
+void Init_SVM()
+{
+#ifdef QUIETFUNC
+  svm_set_verbosity(0);
+#endif
+  mSVM = rb_define_module("SVM");
+  cSVMProblem = rb_define_class_under(mSVM, "Problem", rb_cObject);
+  cSVMParameter = rb_define_class_under(mSVM, "Parameter", rb_cObject);
+  cSVMModel = rb_define_class_under(mSVM, "Model", rb_cObject);
+
+
+  rb_define_singleton_method(cSVMProblem, "new", (VALUE (*) (...))svmpr_new, 0);
+  rb_define_method(cSVMProblem, "initialize", (VALUE (*) (...))svmpr_init, 0);
+  rb_define_method(cSVMProblem, "size", (VALUE (*) (...))svmpr_size, 0);
+  rb_define_method(cSVMProblem, "addExample", (VALUE (*) (...))svmpr_addex, 2);
+
+  rb_define_const(mSVM, "C_SVC", INT2FIX(C_SVC));
+  rb_define_const(mSVM, "NU_SVC", INT2FIX(NU_SVC));
+  rb_define_const(mSVM, "ONE_CLASS", INT2FIX(ONE_CLASS));
+  rb_define_const(mSVM, "EPSILON_SVR", INT2FIX(EPSILON_SVR));
+  rb_define_const(mSVM, "NU_SVR", INT2FIX(NU_SVR));
+  rb_define_const(mSVM, "LINEAR", INT2FIX(LINEAR));
+  rb_define_const(mSVM, "POLY", INT2FIX(POLY));
+  rb_define_const(mSVM, "RBF", INT2FIX(RBF));
+  rb_define_const(mSVM, "SIGMOID", INT2FIX(SIGMOID));
+
+  rb_define_singleton_method(cSVMParameter, "new", (VALUE (*) (...))svmpa_new, 0);
+  rb_define_method(cSVMParameter, "degree", (VALUE (*) (...))svmpa_degree, 0);
+  rb_define_method(cSVMParameter, "degree=", (VALUE (*) (...))svmpa_degreeeq, 1);
+  rb_define_method(cSVMParameter, "gamma", (VALUE (*) (...))svmpa_gamma, 0);
+  rb_define_method(cSVMParameter, "gamma=", (VALUE (*) (...))svmpa_gammaeq, 1);
+  rb_define_method(cSVMParameter, "coef0", (VALUE (*) (...))svmpa_coef0, 0);
+  rb_define_method(cSVMParameter, "coef0=", (VALUE (*) (...))svmpa_coef0eq, 1);
+  rb_define_method(cSVMParameter, "probability", (VALUE (*) (...))svmpa_probability, 0);
+  rb_define_method(cSVMParameter, "probability=", (VALUE (*) (...))svmpa_probabilityeq, 1);
+  rb_define_method(cSVMParameter, "cache_size", (VALUE (*) (...))svmpa_cache_size, 0);
+  rb_define_method(cSVMParameter, "cache_size=", (VALUE (*) (...))svmpa_cache_sizeeq, 1);
+  rb_define_method(cSVMParameter, "eps", (VALUE (*) (...))svmpa_eps, 0);
+  rb_define_method(cSVMParameter, "eps=", (VALUE (*) (...))svmpa_epseq, 1);
+  rb_define_method(cSVMParameter, "C", (VALUE (*) (...))svmpa_C, 0);
+  rb_define_method(cSVMParameter, "C=", (VALUE (*) (...))svmpa_Ceq, 1);
+  rb_define_method(cSVMParameter, "nu", (VALUE (*) (...))svmpa_nu, 0);
+  rb_define_method(cSVMParameter, "nu=", (VALUE (*) (...))svmpa_nueq, 1);
+  rb_define_method(cSVMParameter, "p", (VALUE (*) (...))svmpa_p, 0);
+  rb_define_method(cSVMParameter, "p=", (VALUE (*) (...))svmpa_peq, 1);
+  rb_define_method(cSVMParameter, "kernel_type", (VALUE (*) (...))svmpa_kernel_type, 0);
+  rb_define_method(cSVMParameter, "kernel_type=", (VALUE (*) (...))svmpa_kernel_typeeq, 1);
+  rb_define_method(cSVMParameter, "svm_type", (VALUE (*) (...))svmpa_svm_type, 0);
+  rb_define_method(cSVMParameter, "svm_type=", (VALUE (*) (...))svmpa_svm_typeeq, 1);
+  /*
+  rb_define_method(cSVMParameter, "_dump_data", (VALUE (*) (...))svmpa_svm_dump_data, 0);
+
+  rb_define_method(cSVMParameter, "_load_data", (VALUE (*) (...))svmpa_svm_load_data, 1);
+  */
+  rb_define_method(cSVMParameter, "_dump", (VALUE (*) (...))svmpa_svm_dump, 1);
+
+  rb_define_singleton_method(cSVMParameter, "_load", (VALUE (*) (...))svmpa_svm_load, 1);
+
+#ifdef HAVE_DEFINE_ALLOC_FUNCTION
+  rb_define_alloc_func(cSVMModel, svmpa_allocate);
+#endif
+  /*rb_undef_alloc_func(cSVMModel); */
+/*  rb_add_method(cSVMModel, ID_ALLOCATOR, NEW_CFUNC(svmpa_allocate, 0), NOEX_PRIVATE | NOEX_CFUNC); */
+/*  rb_define_singleton_method(cSVMModel, "allocate", (VALUE (*) (...))svmpa_allocate, 1);
+  rb_define_singleton_method(cSVMModel, "_alloc", (VALUE (*) (...))svmpa_allocate, 1);
+  */
+
+  rb_define_singleton_method(cSVMModel, "new", (VALUE (*) (...))svmpm_new, 2);
+  rb_define_method(cSVMModel, "predict", (VALUE (*) (...))svmpm_predict, 1);
+  rb_define_method(cSVMModel, "predict_probability", (VALUE (*) (...))svmpm_predict_probability, 1);
+  rb_define_method(cSVMModel, "predict_values", (VALUE (*) (...))svmpm_predict_values, 1);
+  rb_define_method(cSVMModel, "svcount", (VALUE (*) (...))svmpm_svcount, 0);
+  rb_define_method(cSVMModel, "save", (VALUE (*) (...))svmpm_save, 1);
+  rb_define_singleton_method(cSVMModel, "load", (VALUE (*) (...))svmpm_load, 1);
+  cMarshal = rb_const_get(rb_cObject, rb_intern("Marshal"));
+}
+

metadata

@@ -0,0 +1,72 @@
+--- !ruby/object:Gem::Specification 
+name: feedbackmine-libsvm-ruby
+version: !ruby/object:Gem::Version 
+  version: 0.1.0
+platform: ruby
+authors: 
+- FeedbackMine
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2009-02-28 00:00:00 -08:00
+default_executable: 
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: hoe
+  type: :development
+  version_requirement: 
+  version_requirements: !ruby/object:Gem::Requirement 
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        version: 1.8.3
+    version: 
+description: ruby wrapper of libsvm
+email: feedbackmine@feedbackmine.com
+executables: []
+
+extensions: 
+- ext/extconf.rb
+extra_rdoc_files: 
+- History.txt
+- Manifest.txt
+- README.txt
+files: 
+- History.txt
+- COPYING
+- AUTHORS
+- Manifest.txt
+- README.txt
+- Rakefile
+- ext/main.cpp
+- ext/extconf.rb
+has_rdoc: true
+homepage: http://www.tweetjobsearch.com
+post_install_message: 
+rdoc_options: 
+- --main
+- README.txt
+require_paths: 
+- ext
+required_ruby_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+requirements: []
+
+rubyforge_project: 
+rubygems_version: 1.2.0
+signing_key: 
+specification_version: 2
+summary: ruby wrapper of libsvm
+test_files: []
+