⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 rulegeneration.html

📁 由java开发的软件包
💻 HTML
📖 第 1 页 / 共 2 页
字号:
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor"><TD COLSPAN=1><FONT SIZE="+2"><B>Constructor Detail</B></FONT></TD></TR></TABLE><A NAME="RuleGeneration(weka.associations.ItemSet)"><!-- --></A><H3>RuleGeneration</H3><PRE>public <B>RuleGeneration</B>(<A HREF="../../weka/associations/ItemSet.html" title="class in weka.associations">ItemSet</A>&nbsp;itemSet)</PRE><DL><DD>Constructor<P><DT><B>Parameters:</B><DD><CODE>itemSet</CODE> - item set for that rules should be generated. The item set will form the premise of the rules.</DL><!-- ============ METHOD DETAIL ========== --><A NAME="method_detail"><!-- --></A><TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY=""><TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor"><TD COLSPAN=1><FONT SIZE="+2"><B>Method Detail</B></FONT></TD></TR></TABLE><A NAME="binomialDistribution(double, double, double)"><!-- --></A><H3>binomialDistribution</H3><PRE>public static final double <B>binomialDistribution</B>(double&nbsp;accuracy,                                                double&nbsp;ruleCount,                                                double&nbsp;premiseCount)</PRE><DL><DD>calculates the probability using a binomial distribution. If the support of the premise is too large this distribution is approximated by a normal distribution.<P><DD><DL></DL></DD><DD><DL><DT><B>Parameters:</B><DD><CODE>accuracy</CODE> - the accuracy value<DD><CODE>ruleCount</CODE> - the support of the whole rule<DD><CODE>premiseCount</CODE> - the support of the premise<DT><B>Returns:</B><DD>the probability value</DL></DD></DL><HR><A NAME="expectation(double, int, double[], java.util.Hashtable)"><!-- --></A><H3>expectation</H3><PRE>public static final double <B>expectation</B>(double&nbsp;ruleCount,                                       int&nbsp;premiseCount,                                       double[]&nbsp;midPoints,                                       java.util.Hashtable&nbsp;priors)</PRE><DL><DD>calculates the expected predctive accuracy of a rule<P><DD><DL></DL></DD><DD><DL><DT><B>Parameters:</B><DD><CODE>ruleCount</CODE> - the support of the rule<DD><CODE>premiseCount</CODE> - the premise support of the rule<DD><CODE>midPoints</CODE> - array with all mid points<DD><CODE>priors</CODE> - hashtable containing the prior probabilities<DT><B>Returns:</B><DD>the expected predictive accuracy</DL></DD></DL><HR><A NAME="generateRules(int, double[], java.util.Hashtable, double, weka.core.Instances, java.util.TreeSet, int)"><!-- --></A><H3>generateRules</H3><PRE>public java.util.TreeSet <B>generateRules</B>(int&nbsp;numRules,                                       double[]&nbsp;midPoints,                                       java.util.Hashtable&nbsp;priors,                                       double&nbsp;expectation,                                       <A HREF="../../weka/core/Instances.html" title="class in weka.core">Instances</A>&nbsp;instances,                                       java.util.TreeSet&nbsp;best,                                       int&nbsp;genTime)</PRE><DL><DD>Generates all rules for an item set. The item set is the premise.<P><DD><DL></DL></DD><DD><DL><DT><B>Parameters:</B><DD><CODE>numRules</CODE> - the number of association rules the use wants to mine. This number equals the size <i>n<\i> of the list of the best rules.<DD><CODE>midPoints</CODE> - the mid points of the intervals<DD><CODE>priors</CODE> - Hashtable that contains the prior probabilities<DD><CODE>expectation</CODE> - the minimum value of the expected predictive accuracy that is needed to get into the list of the best rules<DD><CODE>instances</CODE> - the instances for which association rules are generated<DD><CODE>best</CODE> - the list of the <i>n<\i> best rules. The list is implemented as a TreeSet<DD><CODE>genTime</CODE> - the maximum time of generation<DT><B>Returns:</B><DD>all the rules with minimum confidence for the given item set</DL></DD></DL><HR><A NAME="aSubsumesB(weka.associations.RuleItem, weka.associations.RuleItem)"><!-- --></A><H3>aSubsumesB</H3><PRE>public static boolean <B>aSubsumesB</B>(<A HREF="../../weka/associations/RuleItem.html" title="class in weka.associations">RuleItem</A>&nbsp;a,                                 <A HREF="../../weka/associations/RuleItem.html" title="class in weka.associations">RuleItem</A>&nbsp;b)</PRE><DL><DD>Methods that decides whether or not rule a subsumes rule b. The defintion of subsumption is: Rule a subsumes rule b, if a subsumes b AND a has got least the same expected predictive accuracy as b.<P><DD><DL></DL></DD><DD><DL><DT><B>Parameters:</B><DD><CODE>a</CODE> - an association rule stored as a RuleItem<DD><CODE>b</CODE> - an association rule stored as a RuleItem<DT><B>Returns:</B><DD>true if rule a subsumes rule b or false otherwise.</DL></DD></DL><HR><A NAME="singleConsequence(weka.core.Instances, int, weka.core.FastVector)"><!-- --></A><H3>singleConsequence</H3><PRE>public static <A HREF="../../weka/core/FastVector.html" title="class in weka.core">FastVector</A> <B>singleConsequence</B>(<A HREF="../../weka/core/Instances.html" title="class in weka.core">Instances</A>&nbsp;instances,                                           int&nbsp;attNum,                                           <A HREF="../../weka/core/FastVector.html" title="class in weka.core">FastVector</A>&nbsp;consequences)</PRE><DL><DD>generates a consequence of length 1 for an association rule.<P><DD><DL></DL></DD><DD><DL><DT><B>Parameters:</B><DD><CODE>instances</CODE> - the instances under consideration<DD><CODE>attNum</CODE> - an item that does not occur in the premise<DD><CODE>consequences</CODE> - FastVector that possibly already contains other consequences of length 1<DT><B>Returns:</B><DD>FastVector with consequences of length 1</DL></DD></DL><HR><A NAME="removeRedundant(weka.associations.RuleItem)"><!-- --></A><H3>removeRedundant</H3><PRE>public boolean <B>removeRedundant</B>(<A HREF="../../weka/associations/RuleItem.html" title="class in weka.associations">RuleItem</A>&nbsp;toInsert)</PRE><DL><DD>Method that removes redundant rules out of the list of the best rules. A rule is in that list if: the expected predictive accuracy of this rule is among the best and it is not subsumed by a rule with at least the same expected predictive accuracy<P><DD><DL></DL></DD><DD><DL><DT><B>Parameters:</B><DD><CODE>toInsert</CODE> - the rule that should be inserted into the list<DT><B>Returns:</B><DD>true if the method has changed the list, false otherwise</DL></DD></DL><HR><A NAME="count()"><!-- --></A><H3>count</H3><PRE>public int <B>count</B>()</PRE><DL><DD>Gets the actual maximum value of the generation time<P><DD><DL></DL></DD><DD><DL><DT><B>Returns:</B><DD>the actual maximum value of the generation time</DL></DD></DL><HR><A NAME="change()"><!-- --></A><H3>change</H3><PRE>public boolean <B>change</B>()</PRE><DL><DD>Gets if the list fo the best rules has been changed<P><DD><DL></DL></DD><DD><DL><DT><B>Returns:</B><DD>whether or not the list fo the best rules has been changed</DL></DD></DL><!-- ========= END OF CLASS DATA ========= --><HR><!-- ======= START OF BOTTOM NAVBAR ====== --><A NAME="navbar_bottom"><!-- --></A><A HREF="#skip-navbar_bottom" title="Skip navigation links"></A><TABLE BORDER="0" WIDTH="100%" CELLPADDING="1" CELLSPACING="0" SUMMARY=""><TR><TD COLSPAN=3 BGCOLOR="#EEEEFF" CLASS="NavBarCell1"><A NAME="navbar_bottom_firstrow"><!-- --></A><TABLE BORDER="0" CELLPADDING="0" CELLSPACING="3" SUMMARY="">  <TR ALIGN="center" VALIGN="top">  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../../overview-summary.html"><FONT CLASS="NavBarFont1"><B>Overview</B></FONT></A>&nbsp;</TD>  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="package-summary.html"><FONT CLASS="NavBarFont1"><B>Package</B></FONT></A>&nbsp;</TD>  <TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> &nbsp;<FONT CLASS="NavBarFont1Rev"><B>Class</B></FONT>&nbsp;</TD>  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="package-tree.html"><FONT CLASS="NavBarFont1"><B>Tree</B></FONT></A>&nbsp;</TD>  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../../deprecated-list.html"><FONT CLASS="NavBarFont1"><B>Deprecated</B></FONT></A>&nbsp;</TD>  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../../index-all.html"><FONT CLASS="NavBarFont1"><B>Index</B></FONT></A>&nbsp;</TD>  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../../../Tutorial.pdf"><FONT CLASS="NavBarFont1"><B>Help</B></FONT></A>&nbsp;</TD> <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="http://www.cs.waikato.ac.nz/ml/weka/index.html"><FONT CLASS="NavBarFont1"><B>Weka's home</B></FONT></A>&nbsp;</TD>  </TR></TABLE></TD><TD ALIGN="right" VALIGN="top" ROWSPAN=3><EM></EM></TD></TR><TR><TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">&nbsp;<A HREF="../../weka/associations/PriorEstimation.html" title="class in weka.associations"><B>PREV CLASS</B></A>&nbsp;&nbsp;<A HREF="../../weka/associations/RuleItem.html" title="class in weka.associations"><B>NEXT CLASS</B></A></FONT></TD><TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">  <A HREF="../../index.html" target="_top"><B>FRAMES</B></A>  &nbsp;&nbsp;<A HREF="RuleGeneration.html" target="_top"><B>NO FRAMES</B></A>  &nbsp;&nbsp;<SCRIPT type="text/javascript">  <!--  if(window==top) {    document.writeln('<A HREF="../../allclasses-noframe.html"><B>All Classes</B></A>');  }  //--></SCRIPT><NOSCRIPT>  <A HREF="../../allclasses-noframe.html"><B>All Classes</B></A></NOSCRIPT></FONT></TD></TR><TR><TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2">  SUMMARY:&nbsp;NESTED&nbsp;|&nbsp;FIELD&nbsp;|&nbsp;<A HREF="#constructor_summary">CONSTR</A>&nbsp;|&nbsp;<A HREF="#method_summary">METHOD</A></FONT></TD><TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2">DETAIL:&nbsp;FIELD&nbsp;|&nbsp;<A HREF="#constructor_detail">CONSTR</A>&nbsp;|&nbsp;<A HREF="#method_detail">METHOD</A></FONT></TD></TR></TABLE><A NAME="skip-navbar_bottom"></A><!-- ======== END OF BOTTOM NAVBAR ======= --><HR></BODY></HTML>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -