?? algorithmlbg.html
字號(hào):
<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="AlgorithmLBG()"><!-- --></A><H3>AlgorithmLBG</H3><PRE>public <B>AlgorithmLBG</B>()</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="initialize()"><!-- --></A><H3>initialize</H3><PRE>public boolean <B>initialize</B>()</PRE><DL><DD>Overrides the initialize() method in the base class. Initializes member data and prepares for execution of first step. This method "resets" the algorithm.<P><DD><DL><DT><B>Specified by:</B><DD><CODE><A HREF="Algorithm.html#initialize()">initialize</A></CODE> in class <CODE><A HREF="Algorithm.html" title="class in <Unnamed>">Algorithm</A></CODE></DL></DD><DD><DL><DT><B>Returns:</B><DD>Returns true</DL></DD></DL><HR><A NAME="run()"><!-- --></A><H3>run</H3><PRE>public void <B>run</B>()</PRE><DL><DD>Implementation of the run function from the Runnable interface. Determines what the current step is and calls the appropriate method.<P><DD><DL><DT><B>Specified by:</B><DD><CODE>run</CODE> in interface <CODE>java.lang.Runnable</CODE><DT><B>Specified by:</B><DD><CODE><A HREF="Algorithm.html#run()">run</A></CODE> in class <CODE><A HREF="Algorithm.html" title="class in <Unnamed>">Algorithm</A></CODE></DL></DD><DD><DL></DL></DD></DL><HR><A NAME="generatePool()"><!-- --></A><H3>generatePool</H3><PRE>public void <B>generatePool</B>()</PRE><DL><DD>Collects all the data points together<P><DD><DL></DL></DD></DL><HR><A NAME="getClosestSet(MyPoint)"><!-- --></A><H3>getClosestSet</H3><PRE>public int <B>getClosestSet</B>(MyPoint mean)</PRE><DL><DD>Determines the closest data sets to the cluster<P><DD><DL><DT><B>Parameters:</B><DD><CODE>mean</CODE> - mean point of the cluster<DT><B>Returns:</B><DD>closest data set to the cluster</DL></DD></DL><HR><A NAME="displayClusterError(int, java.util.Vector, int)"><!-- --></A><H3>displayClusterError</H3><PRE>public int <B>displayClusterError</B>(int closest, java.util.Vector cluster, int id)</PRE><DL><DD>Finds the datapoints in error, for all datasets<P><DD><DL><DT><B>Parameters:</B><DD><CODE>closest</CODE> - Variable can be int values 1-4. Marks which set of data is closest<DD><CODE>cluster</CODE> - Stores the points of a cluster<DD><CODE>id</CODE> - ID number<DT><B>Returns:</B><DD>Returns the error number of the misclassified samples</DL></DD></DL><HR><A NAME="computeBinaryDeviates(java.util.Vector)"><!-- --></A><H3>computeBinaryDeviates</H3><PRE>public void <B>computeBinaryDeviates</B>(java.util.Vector decisionRegions)</PRE><DL><DD>Computes the binary deviates after each iteraion<P><DD><DL><DT><B>Parameters:</B><DD><CODE>decisionRegions</CODE> - region: classified data sets</DL></DD></DL><HR><A NAME="clusterDeviation(java.util.Vector, MyPoint)"><!-- --></A><H3>clusterDeviation</H3><PRE>public MyPoint <B>clusterDeviation</B>(java.util.Vector cluster, MyPoint mean)</PRE><DL><DD>Calculates the standard deviation of the cluster<P><DD><DL><DT><B>Parameters:</B><DD><CODE>cluster</CODE> - cluster of data points<DD><CODE>mean</CODE> - mean of the cluster<DT><B>Returns:</B><DD>MYPoint standard deviation of the cluster along x direction and y direction.<DT><B>See Also:</B><DD><CODE>MyPoint</CODE></DL></DD></DL><HR><A NAME="classify(java.util.Vector)"><!-- --></A><H3>classify</H3><PRE>public void <B>classify</B>(java.util.Vector guesses)</PRE><DL><DD>Classifies the data sets based on the k-means iterative algorithm<P><DD><DL><DT><B>Parameters:</B><DD><CODE>guesses</CODE> - stored data sets from the classification</DL></DD></DL><HR><A NAME="getDecisionRegion(java.util.Vector)"><!-- --></A><H3>getDecisionRegion</H3><PRE>public java.util.Vector<MyPoint> <B>getDecisionRegion</B>(java.util.Vector<MyPoint> vec)</PRE><DL><DD>Computes the k-mean decision region - nearest neighbor algorithm<P><DD><DL><DT><B>Parameters:</B><DD><CODE>vec</CODE> - vector of initial guesses<DT><B>Returns:</B><DD>vector of desision region points</DL></DD></DL><HR><A NAME="outputDecisionRegion()"><!-- --></A><H3>outputDecisionRegion</H3><PRE>public void <B>outputDecisionRegion</B>()</PRE><DL><DD>Displays the decision regoin on output panel<P><DD><DL><DT><B>See Also:</B><DD><A HREF="OutputPanel.html" title="class in <Unnamed>"><CODE>OutputPanel</CODE></A></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=2 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="package-summary.html"><FONT CLASS="NavBarFont1"><B>Package</B></FONT></A> </TD> <TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> <FONT CLASS="NavBarFont1Rev"><B>Class</B></FONT> </TD> <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-tree.html"><FONT CLASS="NavBarFont1"><B>Tree</B></FONT></A> </TD> <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="deprecated-list.html"><FONT CLASS="NavBarFont1"><B>Deprecated</B></FONT></A> </TD> <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="index-all.html"><FONT CLASS="NavBarFont1"><B>Index</B></FONT></A> </TD> <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="help-doc.html"><FONT CLASS="NavBarFont1"><B>Help</B></FONT></A> </TD> </TR></TABLE></TD><TD ALIGN="right" VALIGN="top" ROWSPAN=3><EM></EM></TD></TR><TR><TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2"> <A HREF="AlgorithmKMeans.html" title="class in <Unnamed>"><B>PREV CLASS</B></A> <A HREF="AlgorithmLDA.html" title="class in <Unnamed>"><B>NEXT CLASS</B></A></FONT></TD><TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2"> <A HREF="index.html?AlgorithmLBG.html" target="_top"><B>FRAMES</B></A> <A HREF="AlgorithmLBG.html" target="_top"><B>NO FRAMES</B></A> <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: NESTED | FIELD | <A HREF="#constructor_summary">CONSTR</A> | <A HREF="#method_summary">METHOD</A></FONT></TD><TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2">DETAIL: FIELD | <A HREF="#constructor_detail">CONSTR</A> | <A HREF="#method_detail">METHOD</A></FONT></TD></TR></TABLE><A NAME="skip-navbar_bottom"></A><!-- ======== END OF BOTTOM NAVBAR ======= --><HR></BODY></HTML>?? 快捷鍵說(shuō)明
復(fù)制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號(hào)
Ctrl + =
減小字號(hào)
Ctrl + -