tree__cand__gen_8h-source.html
来自「这是一个用于数据挖掘的常用算法的模板库（数据挖掘的C++模板库for UNIX)」· HTML 代码 · 共 189 行 · 第 1/2 页
HTML
189 行
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1"><title>DMTL: tree_cand_gen.h Source File</title><link href="doxygen.css" rel="stylesheet" type="text/css"><link href="tabs.css" rel="stylesheet" type="text/css"></head><body><!-- Generated by Doxygen 1.4.7 --><div class="tabs"> <ul> <li><a href="index.html"><span>Main Page</span></a></li> <li><a href="annotated.html"><span>Classes</span></a></li> <li id="current"><a href="files.html"><span>Files</span></a></li> <li><a href="pages.html"><span>Related Pages</span></a></li> </ul></div><h1>tree_cand_gen.h</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span><a name="l00002"></a>00002 <span class="comment"> * Copyright (C) 2005 M.J. Zaki <zaki@cs.rpi.edu> Rensselaer Polytechnic Institute</span><a name="l00003"></a>00003 <span class="comment"> * Written by parimi@cs.rpi.edu</span><a name="l00004"></a>00004 <span class="comment"> * Updated by chaojv@cs.rpi.edu, alhasan@cs.rpi.edu, salems@cs.rpi.edu</span><a name="l00005"></a>00005 <span class="comment"> *</span><a name="l00006"></a>00006 <span class="comment"> * This program is free software; you can redistribute it and/or</span><a name="l00007"></a>00007 <span class="comment"> * modify it under the terms of the GNU General Public License</span><a name="l00008"></a>00008 <span class="comment"> * as published by the Free Software Foundation; either version 2</span><a name="l00009"></a>00009 <span class="comment"> * of the License, or (at your option) any later version.</span><a name="l00010"></a>00010 <span class="comment"> *</span><a name="l00011"></a>00011 <span class="comment"> * This program is distributed in the hope that it will be useful,</span><a name="l00012"></a>00012 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span><a name="l00013"></a>00013 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span><a name="l00014"></a>00014 <span class="comment"> * GNU General Public License for more details.</span><a name="l00015"></a>00015 <span class="comment"> *</span><a name="l00016"></a>00016 <span class="comment"> * You should have received a copy of the GNU General Public License along</span><a name="l00017"></a>00017 <span class="comment"> * with this program; if not, write to the Free Software Foundation, Inc.,</span><a name="l00018"></a>00018 <span class="comment"> * 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.</span><a name="l00019"></a>00019 <span class="comment"> */</span><a name="l00020"></a>00020 <span class="comment">// candidate generation for trees</span><a name="l00021"></a>00021 <a name="l00022"></a>00022 <span class="preprocessor">#ifndef _TREE_CAND_GEN_H</span><a name="l00023"></a>00023 <span class="preprocessor"></span><span class="preprocessor">#define _TREE_CAND_GEN_H</span><a name="l00024"></a>00024 <span class="preprocessor"></span><a name="l00025"></a>00025 <span class="preprocessor">#include <algorithm></span><a name="l00026"></a>00026 <a name="l00027"></a>00027 <span class="preprocessor">#include "tree_iso_check.h"</span><a name="l00028"></a>00028 <span class="preprocessor">#include "tree_operators.h"</span><a name="l00029"></a>00029 <span class="preprocessor">#include "typedefs.h"</span><a name="l00030"></a>00030 <a name="l00031"></a>00031 <span class="keyword">extern</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> freq_pats_count;<a name="l00032"></a>00032 <span class="keyword">extern</span> <span class="keywordtype">bool</span> print;<a name="l00033"></a>00033 <a name="l00034"></a>00034 <span class="keyword">template</span><<span class="keyword">class</span> PP, <span class="keyword">class</span> MP, <span class="keyword">class</span> PAT_ST, <span class="keyword">template</span><<span class="keyword">typename</span>, <span class="keyword">typename</span>, <span class="keyword">typename</span>, <span class="keyword">template</span> <<span class="keyword">typename</span>> <span class="keyword">class</span>> <span class="keyword">class </span>CC, <a name="l00035"></a>00035 template<typename> class ALLOC, class SM_TYPE><a name="l00036"></a>00036 <a name="l00037"></a>00037 void cand_gen(const <a class="code" href="classpat__fam.html">pat_fam</a><TREE_PATTERN >& Fk, <span class="keyword">const</span> <a class="code" href="classpat__fam.html">pat_fam<TREE_PATTERN ></a>&, <span class="keyword">const</span> <span class="keywordtype">int</span>& minsup, <a name="l00038"></a>00038 <a class="code" href="classpat__fam.html">pat_fam<TREE_PATTERN ></a>& freq_pats, <a class="code" href="classcount__support.html">count_support<TREE_PROP, V_Fkk_MINE_PROP, PAT_ST, CC, ALLOC, SM_TYPE></a>& cs) {<a name="l00039"></a>00039 <a name="l00040"></a>00040 <span class="keyword">typedef</span> <a class="code" href="classpat__fam.html">pat_fam<TREE_PATTERN></a> PAT_FAM;<a name="l00041"></a>00041 <span class="keyword">typedef</span> <span class="keyword">typename</span> PAT_FAM::CONST_IT PF_CIT;<a name="l00042"></a>00042 <a name="l00043"></a>00043 PF_CIT it_i, it_j;<a name="l00044"></a>00044 <span class="keyword">const</span> <span class="keywordtype">int</span> num_cands=2;<a name="l00045"></a>00045 <a name="l00046"></a>00046 <span class="keywordflow">for</span>(it_i=Fk.begin(); it_i!=Fk.end(); it_i++) {<a name="l00047"></a>00047 <a name="l00048"></a>00048 PAT_FAM pat_fam_i;<a name="l00049"></a>00049 TREE_PATTERN* pat_i=*it_i;<a name="l00050"></a>00050 <a name="l00051"></a>00051 <span class="comment">// check if this pattern should be extended</span><a name="l00052"></a>00052 <span class="keywordflow">if</span>(!pat_i->is_freq(minsup) || !pat_i->is_canonical())<a name="l00053"></a>00053 <span class="keywordflow">continue</span>;<a name="l00054"></a>00054 <a name="l00055"></a>00055 <span class="keywordtype">int</span> pos_i=compute_pos(pat_i);<a name="l00056"></a>00056 <span class="keywordflow">for</span>(it_j=Fk.begin(); it_j!=Fk.end(); it_j++) {<a name="l00057"></a>00057 <a name="l00058"></a>00058 TREE_PATTERN* pat_j=*it_j;<a name="l00059"></a>00059 <span class="keywordtype">int</span> i;<a name="l00060"></a>00060 <a name="l00061"></a>00061 <span class="comment">// check if valid candidate can result</span><a name="l00062"></a>00062 <span class="keywordtype">int</span> pos_j=compute_pos(pat_j);<a name="l00063"></a>00063 <a name="l00064"></a>00064 <span class="keywordflow">if</span>(pos_i<pos_j) {<a name="l00065"></a>00065 <span class="keywordflow">continue</span>;<a name="l00066"></a>00066 }<a name="l00067"></a>00067 <a name="l00068"></a>00068 <span class="comment">// generate new candidates</span><a name="l00069"></a>00069 TREE_PATTERN** cand_pats=join(pat_i, pat_j, pos_i, pos_j);<a name="l00070"></a>00070 <a name="l00071"></a>00071 <span class="keywordflow">for</span>(i=0; i<num_cands; i++)<a name="l00072"></a>00072 <span class="keywordflow">if</span>(cand_pats[i])<a name="l00073"></a>00073 check_isomorphism(cand_pats[i]);<a name="l00074"></a>00074 <a name="l00075"></a>00075 <span class="comment">// count support of candidates</span><a name="l00076"></a>00076 cs.count(pat_i, pat_j, cand_pats, minsup, num_cands);<a name="l00077"></a>00077 <a name="l00078"></a>00078 <span class="comment">// discard infrequent patterns</span><a name="l00079"></a>00079 <span class="keywordflow">for</span>(i=0; i<num_cands; i++) {<a name="l00080"></a>00080 <span class="keywordflow">if</span>(!cand_pats[i])<a name="l00081"></a>00081 <span class="keywordflow">continue</span>;⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?