Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>I may have found a <a href="http://sourceforge.net/apps/mediawiki/mee5/index.php?title=Main_Page" rel="nofollow">possible C++ "implementation" of C5.0 (See5.0)</a>, but I haven't been able to dig into the source code enough to determine if it really works as advertised.</p> <p>To reiterate my original concerns, the author of the port states the following about the C5.0 algorithm:</p> <blockquote> <p>Another drawback with See5Sam [C5.0] is the impossibility to have more than one application tree at the same time. An application is read from files each time the executable is run and is stored in global variables here and there.</p> </blockquote> <p>I will update my answer as soon as I get some time to look into the source code.</p> <h2>Update</h2> <p>It's looking pretty good, here is the C++ interface: </p> <pre><code>class CMee5 { public: /** Create a See 5 engine from tree/rules files. \param pcFileStem The stem of the See 5 file system. The engine initialisation will look for the following files: - pcFileStem.names Vanilla See 5 names file (mandatory) - pcFileStem.tree or pcFileStem.rules Vanilla See 5 tree or rules file (mandatory) - pcFileStem.costs Vanilla See 5 costs file (mandatory) */ inline CMee5(const char* pcFileStem, bool bUseRules); /** Release allocated memory for this engine. */ inline ~CMee5(); /** General classification routine accepting a data record. */ inline unsigned int classifyDataRec(DataRec Case, float* pOutConfidence); /** Show rules that were used to classify the last case. Classify() will have set RulesUsed[] to number of active rules for trial 0, first active rule, second active rule, ..., last active rule, number of active rules for trial 1, first active rule, second active rule, ..., last active rule, and so on. */ inline void showRules(int Spaces); /** Open file with given extension for read/write with the actual file stem. */ inline FILE* GetFile(String Extension, String RW); /** Read a raw case from file Df. For each attribute, read the attribute value from the file. If it is a discrete valued attribute, find the associated no. of this attribute value (if the value is unknown this is 0). Returns the array of attribute values. */ inline DataRec GetDataRec(FILE *Df, Boolean Train); inline DataRec GetDataRecFromVec(float* pfVals, Boolean Train); inline float TranslateStringField(int Att, const char* Name); inline void Error(int ErrNo, String S1, String S2); inline int getMaxClass() const; inline int getClassAtt() const; inline int getLabelAtt() const; inline int getCWtAtt() const; inline unsigned int getMaxAtt() const; inline const char* getClassName(int nClassNo) const; inline char* getIgnoredVals(); inline void FreeLastCase(void* DVec); } </code></pre> <p>I would say that this is the best alternative I've found so far.</p>
    singulars
    1. This table or related slice is empty.
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
 

Querying!

 
Guidance

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload