fptreenode.html

来自「数据挖掘方面最新软件」· HTML 代码 · 共 712 行 · 第 1/3 页

HTML
712
字号
</TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>&nbsp;int</CODE></FONT></TD><TD><CODE><B><A HREF="../../../../../../com/rapidminer/operator/learner/associations/fpgrowth/FPTreeNode.html#getFrequency(int)">getFrequency</A></B>(int&nbsp;height)</CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;this returns the frequency of the node in current recursion</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>&nbsp;<A HREF="../../../../../../com/rapidminer/operator/learner/associations/fpgrowth/FPTreeNode.html" title="class in com.rapidminer.operator.learner.associations.fpgrowth">FPTreeNode</A></CODE></FONT></TD><TD><CODE><B><A HREF="../../../../../../com/rapidminer/operator/learner/associations/fpgrowth/FPTreeNode.html#getLastSibling()">getLastSibling</A></B>()</CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Returns the last node of the chain of nodes representing the same item as this node</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>&nbsp;<A HREF="../../../../../../com/rapidminer/operator/learner/associations/Item.html" title="interface in com.rapidminer.operator.learner.associations">Item</A></CODE></FONT></TD><TD><CODE><B><A HREF="../../../../../../com/rapidminer/operator/learner/associations/fpgrowth/FPTreeNode.html#getNodeItem()">getNodeItem</A></B>()</CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;this returns the item, this node represents</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>&nbsp;<A HREF="../../../../../../com/rapidminer/operator/learner/associations/fpgrowth/FPTreeNode.html" title="class in com.rapidminer.operator.learner.associations.fpgrowth">FPTreeNode</A></CODE></FONT></TD><TD><CODE><B><A HREF="../../../../../../com/rapidminer/operator/learner/associations/fpgrowth/FPTreeNode.html#getSibling()">getSibling</A></B>()</CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Returns the next node representing the same item as this node.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>&nbsp;boolean</CODE></FONT></TD><TD><CODE><B><A HREF="../../../../../../com/rapidminer/operator/learner/associations/fpgrowth/FPTreeNode.html#hasFather()">hasFather</A></B>()</CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Returns true if node has father.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>&nbsp;boolean</CODE></FONT></TD><TD><CODE><B><A HREF="../../../../../../com/rapidminer/operator/learner/associations/fpgrowth/FPTreeNode.html#hasSibling()">hasSibling</A></B>()</CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Returns true if this node is not the last one in the chain of nodes representing the same item as this node.</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>&nbsp;void</CODE></FONT></TD><TD><CODE><B><A HREF="../../../../../../com/rapidminer/operator/learner/associations/fpgrowth/FPTreeNode.html#increaseFrequency(int, int)">increaseFrequency</A></B>(int&nbsp;recursionDepth,                  int&nbsp;value)</CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;This method increases the frequency of this current node by the given weight in given recusionDepth</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>&nbsp;void</CODE></FONT></TD><TD><CODE><B><A HREF="../../../../../../com/rapidminer/operator/learner/associations/fpgrowth/FPTreeNode.html#popFrequency(int)">popFrequency</A></B>(int&nbsp;height)</CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;This method clears the frequency stack on top</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>&nbsp;void</CODE></FONT></TD><TD><CODE><B><A HREF="../../../../../../com/rapidminer/operator/learner/associations/fpgrowth/FPTreeNode.html#setSibling(com.rapidminer.operator.learner.associations.fpgrowth.FPTreeNode)">setSibling</A></B>(<A HREF="../../../../../../com/rapidminer/operator/learner/associations/fpgrowth/FPTreeNode.html" title="class in com.rapidminer.operator.learner.associations.fpgrowth">FPTreeNode</A>&nbsp;sibling)</CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;This method sets the next node in the chain of node representing the same item as this node</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>&nbsp;java.lang.String</CODE></FONT></TD><TD><CODE><B><A HREF="../../../../../../com/rapidminer/operator/learner/associations/fpgrowth/FPTreeNode.html#toString(int)">toString</A></B>(int&nbsp;recursionDepth)</CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</TD></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1"><CODE>&nbsp;java.lang.String</CODE></FONT></TD><TD><CODE><B><A HREF="../../../../../../com/rapidminer/operator/learner/associations/fpgrowth/FPTreeNode.html#toString(java.lang.String, int)">toString</A></B>(java.lang.String&nbsp;abs,         int&nbsp;recursionDepth)</CODE><BR>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</TD></TR></TABLE>&nbsp;<A NAME="methods_inherited_from_class_java.lang.Object"><!-- --></A><TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY=""><TR BGCOLOR="#EEEEFF" CLASS="TableSubHeadingColor"><TH ALIGN="left"><B>Methods inherited from class java.lang.Object</B></TH></TR><TR BGCOLOR="white" CLASS="TableRowColor"><TD><CODE>clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait</CODE></TD></TR></TABLE>&nbsp;<P><!-- ============ FIELD DETAIL =========== --><A NAME="field_detail"><!-- --></A><TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY=""><TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor"><TH ALIGN="left" COLSPAN="1"><FONT SIZE="+2"><B>Field Detail</B></FONT></TH></TR></TABLE><A NAME="frequencies"><!-- --></A><H3>frequencies</H3><PRE>protected <A HREF="../../../../../../com/rapidminer/operator/learner/associations/fpgrowth/FrequencyStack.html" title="interface in com.rapidminer.operator.learner.associations.fpgrowth">FrequencyStack</A> <B>frequencies</B></PRE><DL><DL></DL></DL><HR><A NAME="nodeItem"><!-- --></A><H3>nodeItem</H3><PRE>protected <A HREF="../../../../../../com/rapidminer/operator/learner/associations/Item.html" title="interface in com.rapidminer.operator.learner.associations">Item</A> <B>nodeItem</B></PRE><DL><DL></DL></DL><HR><A NAME="sibling"><!-- --></A><H3>sibling</H3><PRE>protected <A HREF="../../../../../../com/rapidminer/operator/learner/associations/fpgrowth/FPTreeNode.html" title="class in com.rapidminer.operator.learner.associations.fpgrowth">FPTreeNode</A> <B>sibling</B></PRE><DL><DL></DL></DL><HR><A NAME="father"><!-- --></A><H3>father</H3><PRE>protected <A HREF="../../../../../../com/rapidminer/operator/learner/associations/fpgrowth/FPTreeNode.html" title="class in com.rapidminer.operator.learner.associations.fpgrowth">FPTreeNode</A> <B>father</B></PRE><DL><DL></DL></DL><HR><A NAME="children"><!-- --></A><H3>children</H3><PRE>protected java.util.Map&lt;<A HREF="../../../../../../com/rapidminer/operator/learner/associations/Item.html" title="interface in com.rapidminer.operator.learner.associations">Item</A>,<A HREF="../../../../../../com/rapidminer/operator/learner/associations/fpgrowth/FPTreeNode.html" title="class in com.rapidminer.operator.learner.associations.fpgrowth">FPTreeNode</A>&gt; <B>children</B></PRE><DL><DL></DL></DL><!-- ========= CONSTRUCTOR DETAIL ======== --><A NAME="constructor_detail"><!-- --></A><TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY=""><TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor"><TH ALIGN="left" COLSPAN="1"><FONT SIZE="+2"><B>Constructor Detail</B></FONT></TH></TR></TABLE><A NAME="FPTreeNode()"><!-- --></A><H3>FPTreeNode</H3><PRE>public <B>FPTreeNode</B>()</PRE><DL></DL><HR><A NAME="FPTreeNode(com.rapidminer.operator.learner.associations.fpgrowth.FPTreeNode, com.rapidminer.operator.learner.associations.Item)"><!-- --></A><H3>FPTreeNode</H3><PRE>public <B>FPTreeNode</B>(<A HREF="../../../../../../com/rapidminer/operator/learner/associations/fpgrowth/FPTreeNode.html" title="class in com.rapidminer.operator.learner.associations.fpgrowth">FPTreeNode</A>&nbsp;father,                  <A HREF="../../../../../../com/rapidminer/operator/learner/associations/Item.html" title="interface in com.rapidminer.operator.learner.associations">Item</A>&nbsp;nodeItem)</PRE><DL></DL><!-- ============ METHOD DETAIL ========== --><A NAME="method_detail"><!-- --></A><TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY=""><TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor"><TH ALIGN="left" COLSPAN="1"><FONT SIZE="+2"><B>Method Detail</B></FONT></TH></TR></TABLE><A NAME="addItemSet(java.util.Collection, java.util.Map, int)"><!-- --></A><H3>addItemSet</H3><PRE>public void <B>addItemSet</B>(java.util.Collection&lt;<A HREF="../../../../../../com/rapidminer/operator/learner/associations/Item.html" title="interface in com.rapidminer.operator.learner.associations">Item</A>&gt;&nbsp;itemSet,                       java.util.Map&lt;<A HREF="../../../../../../com/rapidminer/operator/learner/associations/Item.html" title="interface in com.rapidminer.operator.learner.associations">Item</A>,<A HREF="../../../../../../com/rapidminer/operator/learner/associations/fpgrowth/Header.html" title="class in com.rapidminer.operator.learner.associations.fpgrowth">Header</A>&gt;&nbsp;headerTable,                       int&nbsp;weight)</PRE><DL><DD>This method only works at recursiondepth 0, therefore may only be used for tree constructing. This method adds a set of Items to the tree of this node. This set of items has to be sorted after the frequency of the contained items. This method is recursivly used to expand the tree for the given set, by adding a node for the first item and then call this method with the remaining set on the new node. The frequency of the set is represented of weight. siblingChain is the headerTable, giving this method a startingpoint for finding the other nodes of the item to append new nodes<P><DD><DL><DT><B>Parameters:</B><DD><CODE>itemSet</CODE> - the sorted set of items<DD><CODE>headerTable</CODE> - gives the headertable for finding other nodes of an item</DL></DD></DL><HR><A NAME="getFather()"><!-- --></A><H3>getFather</H3><PRE>public <A HREF="../../../../../../com/rapidminer/operator/learner/associations/fpgrowth/FPTreeNode.html" title="class in com.rapidminer.operator.learner.associations.fpgrowth">FPTreeNode</A> <B>getFather</B>()</PRE><DL><DD>Returns the father of this node or null if node is root<P><DD><DL></DL></DD></DL><HR><A NAME="hasFather()"><!-- --></A><H3>hasFather</H3><PRE>public boolean <B>hasFather</B>()</PRE><DL><DD>Returns true if node has father. If node is root, false is returned<P>

⌨️ 快捷键说明

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