mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 04:18:34 +08:00
452 lines
29 KiB
HTML
452 lines
29 KiB
HTML
<!-- HTML header for doxygen 1.12.0-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
|
<meta name="generator" content="Doxygen 1.14.0"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>TheAlgorithms/C++: Machine Learning Algorithms</title>
|
|
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
|
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../jquery.js"></script>
|
|
<script type="text/javascript" src="../../dynsections.js"></script>
|
|
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
|
|
<script type="text/javascript">
|
|
DoxygenAwesomeDarkModeToggle.init()
|
|
</script>
|
|
<script type="text/javascript" src="../../clipboard.js"></script>
|
|
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../navtreedata.js"></script>
|
|
<script type="text/javascript" src="../../navtree.js"></script>
|
|
<script type="text/javascript" src="../../cookie.js"></script>
|
|
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
|
<script type="text/javascript" src="../../search/search.js"></script>
|
|
<script type="text/javascript">
|
|
window.MathJax = {
|
|
options: {
|
|
ignoreHtmlClass: 'tex2jax_ignore',
|
|
processHtmlClass: 'tex2jax_process'
|
|
},
|
|
loader: {
|
|
load: ['[tex]/ams']
|
|
},
|
|
tex: {
|
|
macros: {},
|
|
packages: ['base','configmacros','ams']
|
|
}
|
|
};
|
|
</script>
|
|
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
|
|
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr id="projectrow">
|
|
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
|
|
<td id="projectalign">
|
|
<div id="projectname">TheAlgorithms/C++<span id="projectnumber"> 1.0.0</span>
|
|
</div>
|
|
<div id="projectbrief">All the algorithms implemented in C++</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.14.0 -->
|
|
<script type="text/javascript">
|
|
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
|
</script>
|
|
<script type="text/javascript">
|
|
$(function() { codefold.init(); });
|
|
</script>
|
|
<script type="text/javascript" src="../../menudata.js"></script>
|
|
<script type="text/javascript" src="../../menu.js"></script>
|
|
<script type="text/javascript">
|
|
$(function() {
|
|
initMenu('../../',true,false,'search.php','Search',true);
|
|
$(function() { init_search(); });
|
|
});
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
$(function(){initNavTree('d9/d66/group__machine__learning.html','../../',''); });
|
|
</script>
|
|
<div id="container">
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<div id="MSearchResults">
|
|
<div class="SRPage">
|
|
<div id="SRIndex">
|
|
<div id="SRResults"></div>
|
|
<div class="SRStatus" id="Loading">Loading...</div>
|
|
<div class="SRStatus" id="Searching">Searching...</div>
|
|
<div class="SRStatus" id="NoMatches">No Matches</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle"><div class="title">Machine Learning Algorithms </div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 id="header-files" class="groupheader"><a id="files" name="files"></a>
|
|
Files</h2></td></tr>
|
|
<tr class="memitem:adaline_5Flearning_2Ecpp" id="r_adaline_5Flearning_2Ecpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/db0/adaline__learning_8cpp.html">adaline_learning.cpp</a></td></tr>
|
|
<tr class="memdesc:d5/db0/adaline__learning_8cpp"><td class="mdescLeft"> </td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/ADALINE" target="_blank">Adaptive Linear Neuron (ADALINE)</a> implementation <br /></td></tr>
|
|
<tr class="memitem:kohonen_5Fsom_5Ftopology_2Ecpp" id="r_kohonen_5Fsom_5Ftopology_2Ecpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/def/kohonen__som__topology_8cpp.html">kohonen_som_topology.cpp</a></td></tr>
|
|
<tr class="memdesc:d4/def/kohonen__som__topology_8cpp"><td class="mdescLeft"> </td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Self-organizing_map" target="_blank">Kohonen self organizing map</a> (topological map) <br /></td></tr>
|
|
<tr class="memitem:kohonen_5Fsom_5Ftrace_2Ecpp" id="r_kohonen_5Fsom_5Ftrace_2Ecpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d49/kohonen__som__trace_8cpp.html">kohonen_som_trace.cpp</a></td></tr>
|
|
<tr class="memdesc:d9/d49/kohonen__som__trace_8cpp"><td class="mdescLeft"> </td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Self-organizing_map" target="_blank">Kohonen self organizing map</a> (data tracing) <br /></td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 id="header-namespaces" class="groupheader"><a id="namespaces" name="namespaces"></a>
|
|
Namespaces</h2></td></tr>
|
|
<tr class="memitem:machine_5Flearning" id="r_machine_5Flearning"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html">machine_learning</a></td></tr>
|
|
<tr class="memdesc:d8/d77/namespacemachine__learning"><td class="mdescLeft"> </td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/A*_search_algorithm" target="_blank">A* search algorithm</a> <br /></td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
|
|
Functions</h2></td></tr>
|
|
<tr class="memitem:gaf5ce14f026d6d231bef29161bac2b485" id="r_gaf5ce14f026d6d231bef29161bac2b485"><td class="memItemLeft" align="right" valign="top">double </td><td class="memItemRight" valign="bottom"><a class="el" href="#gaf5ce14f026d6d231bef29161bac2b485">_random</a> (double a, double b)</td></tr>
|
|
<tr class="memitem:gabc90175770bf0d5853c466e14993a08c" id="r_gabc90175770bf0d5853c466e14993a08c"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="#gabc90175770bf0d5853c466e14993a08c">save_2d_data</a> (const char *fname, const std::vector< std::valarray< double > > &X)</td></tr>
|
|
<tr class="memitem:ga60f9186ccb682724a8792a2bf81e9b9e" id="r_ga60f9186ccb682724a8792a2bf81e9b9e"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#ga60f9186ccb682724a8792a2bf81e9b9e">get_min_2d</a> (const std::vector< std::valarray< double > > &X, double *val, int *x_idx, int *y_idx)</td></tr>
|
|
<tr class="memitem:gae0208548f8b393528e5db01717e88e67" id="r_gae0208548f8b393528e5db01717e88e67"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="#gae0208548f8b393528e5db01717e88e67">save_nd_data</a> (const char *fname, const std::vector< std::valarray< double > > &X)</td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 id="header-var-members" class="groupheader"><a id="var-members" name="var-members"></a>
|
|
Variables</h2></td></tr>
|
|
<tr class="memitem:ga5118e5cbc4f0886e27b3a7a2544dded1" id="r_ga5118e5cbc4f0886e27b3a7a2544dded1"><td class="memItemLeft" align="right" valign="top">constexpr int </td><td class="memItemRight" valign="bottom"><a class="el" href="#ga5118e5cbc4f0886e27b3a7a2544dded1">MAX_ITER</a> = 500</td></tr>
|
|
</table>
|
|
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
|
|
<a name="doc-define-members" id="doc-define-members"></a><h2 id="header-doc-define-members" class="groupheader">Macro Definition Documentation</h2>
|
|
<a id="ga525335710b53cb064ca56b936120431e" name="ga525335710b53cb064ca56b936120431e"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ga525335710b53cb064ca56b936120431e">◆ </a></span>_USE_MATH_DEFINES <span class="overload">[1/2]</span></h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">#define _USE_MATH_DEFINES</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00026">26</a> of file <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html">kohonen_som_topology.cpp</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<a id="ga525335710b53cb064ca56b936120431e" name="ga525335710b53cb064ca56b936120431e"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ga525335710b53cb064ca56b936120431e">◆ </a></span>_USE_MATH_DEFINES <span class="overload">[2/2]</span></h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">#define _USE_MATH_DEFINES</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00021">21</a> of file <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html">kohonen_som_trace.cpp</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
<a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
|
|
<a id="gaf5ce14f026d6d231bef29161bac2b485" name="gaf5ce14f026d6d231bef29161bac2b485"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#gaf5ce14f026d6d231bef29161bac2b485">◆ </a></span>_random()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">double _random </td>
|
|
<td>(</td>
|
|
<td class="paramtype">double</td> <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">double</td> <td class="paramname"><span class="paramname"><em>b</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Helper function to generate a random number in a given interval. <br />
|
|
Steps:</p><ol type="1">
|
|
<li><span class="tt">r1 = rand() % 100</span> gets a random number between 0 and 99</li>
|
|
<li><span class="tt">r2 = r1 / 100</span> converts random number to be between 0 and 0.99</li>
|
|
<li>scale and offset the random number to given range of \([a,b]\)</li>
|
|
</ol>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramdir">[in]</td><td class="paramname">a</td><td>lower limit </td></tr>
|
|
<tr><td class="paramdir">[in]</td><td class="paramname">b</td><td>upper limit </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>random number in the range \([a,b]\) </dd></dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html">kohonen_som_topology.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 53</span> {</div>
|
|
<div class="line"><span class="lineno"> 54</span> <span class="keywordflow">return</span> ((b - a) * (std::rand() % 100) / 100.f) + a;</div>
|
|
<div class="line"><span class="lineno"> 55</span>}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="ga60f9186ccb682724a8792a2bf81e9b9e" name="ga60f9186ccb682724a8792a2bf81e9b9e"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ga60f9186ccb682724a8792a2bf81e9b9e">◆ </a></span>get_min_2d()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">void get_min_2d </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const std::vector< std::valarray< double > > &</td> <td class="paramname"><span class="paramname"><em>X</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">double *</td> <td class="paramname"><span class="paramname"><em>val</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int *</td> <td class="paramname"><span class="paramname"><em>x_idx</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">int *</td> <td class="paramname"><span class="paramname"><em>y_idx</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Get minimum value and index of the value in a matrix </p><dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramdir">[in]</td><td class="paramname">X</td><td>matrix to search </td></tr>
|
|
<tr><td class="paramdir">[in]</td><td class="paramname">N</td><td>number of points in the vector </td></tr>
|
|
<tr><td class="paramdir">[out]</td><td class="paramname">val</td><td>minimum value found </td></tr>
|
|
<tr><td class="paramdir">[out]</td><td class="paramname">idx_x</td><td>x-index where minimum value was found </td></tr>
|
|
<tr><td class="paramdir">[out]</td><td class="paramname">idx_y</td><td>y-index where minimum value was found </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00105">105</a> of file <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html">kohonen_som_topology.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 106</span> {</div>
|
|
<div class="line"><span class="lineno"> 107</span> val[0] = INFINITY; <span class="comment">// initial min value</span></div>
|
|
<div class="line"><span class="lineno"> 108</span> <span class="keywordtype">size_t</span> N = X.size();</div>
|
|
<div class="line"><span class="lineno"> 109</span> </div>
|
|
<div class="line"><span class="lineno"> 110</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < N; i++) { <span class="comment">// traverse each x-index</span></div>
|
|
<div class="line"><span class="lineno"> 111</span> <span class="keyword">auto</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = std::min_element(std::begin(X[i]), std::end(X[i]));</div>
|
|
<div class="line"><span class="lineno"> 112</span> <span class="keywordtype">double</span> d_min = *<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
|
|
<div class="line"><span class="lineno"> 113</span> std::ptrdiff_t j = std::distance(std::begin(X[i]), result);</div>
|
|
<div class="line"><span class="lineno"> 114</span> </div>
|
|
<div class="line"><span class="lineno"> 115</span> <span class="keywordflow">if</span> (d_min < val[0]) { <span class="comment">// if a lower value is found</span></div>
|
|
<div class="line"><span class="lineno"> 116</span> <span class="comment">// save the value and its index</span></div>
|
|
<div class="line"><span class="lineno"> 117</span> x_idx[0] = i;</div>
|
|
<div class="line"><span class="lineno"> 118</span> y_idx[0] = j;</div>
|
|
<div class="line"><span class="lineno"> 119</span> val[0] = d_min;</div>
|
|
<div class="line"><span class="lineno"> 120</span> }</div>
|
|
<div class="line"><span class="lineno"> 121</span> }</div>
|
|
<div class="line"><span class="lineno"> 122</span>}</div>
|
|
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="gabc90175770bf0d5853c466e14993a08c" name="gabc90175770bf0d5853c466e14993a08c"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#gabc90175770bf0d5853c466e14993a08c">◆ </a></span>save_2d_data()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">int save_2d_data </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const char *</td> <td class="paramname"><span class="paramname"><em>fname</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">const std::vector< std::valarray< double > > &</td> <td class="paramname"><span class="paramname"><em>X</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Save a given n-dimensional data martix to file.</p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramdir">[in]</td><td class="paramname">fname</td><td>filename to save in (gets overwriten without confirmation) </td></tr>
|
|
<tr><td class="paramdir">[in]</td><td class="paramname">X</td><td>matrix to save </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>0 if all ok </dd>
|
|
<dd>
|
|
-1 if file creation failed </dd></dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00065">65</a> of file <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html">kohonen_som_topology.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 66</span> {</div>
|
|
<div class="line"><span class="lineno"> 67</span> <span class="keywordtype">size_t</span> num_points = X.size(); <span class="comment">// number of rows</span></div>
|
|
<div class="line"><span class="lineno"> 68</span> <span class="keywordtype">size_t</span> num_features = X[0].size(); <span class="comment">// number of columns</span></div>
|
|
<div class="line"><span class="lineno"> 69</span> </div>
|
|
<div class="line"><span class="lineno"> 70</span> std::ofstream fp;</div>
|
|
<div class="line"><span class="lineno"> 71</span> fp.open(fname);</div>
|
|
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">if</span> (!fp.is_open()) {</div>
|
|
<div class="line"><span class="lineno"> 73</span> <span class="comment">// error with opening file to write</span></div>
|
|
<div class="line"><span class="lineno"> 74</span> std::cerr << <span class="stringliteral">"Error opening file "</span> << fname << <span class="stringliteral">": "</span></div>
|
|
<div class="line"><span class="lineno"> 75</span> << std::strerror(errno) << <span class="stringliteral">"\n"</span>;</div>
|
|
<div class="line"><span class="lineno"> 76</span> <span class="keywordflow">return</span> -1;</div>
|
|
<div class="line"><span class="lineno"> 77</span> }</div>
|
|
<div class="line"><span class="lineno"> 78</span> </div>
|
|
<div class="line"><span class="lineno"> 79</span> <span class="comment">// for each point in the array</span></div>
|
|
<div class="line"><span class="lineno"> 80</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_points; i++) {</div>
|
|
<div class="line"><span class="lineno"> 81</span> <span class="comment">// for each feature in the array</span></div>
|
|
<div class="line"><span class="lineno"> 82</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < num_features; j++) {</div>
|
|
<div class="line"><span class="lineno"> 83</span> fp << X[i][j]; <span class="comment">// print the feature value</span></div>
|
|
<div class="line"><span class="lineno"> 84</span> <span class="keywordflow">if</span> (j < num_features - 1) { <span class="comment">// if not the last feature</span></div>
|
|
<div class="line"><span class="lineno"> 85</span> fp << <span class="stringliteral">","</span>; <span class="comment">// suffix comma</span></div>
|
|
<div class="line"><span class="lineno"> 86</span> }</div>
|
|
<div class="line"><span class="lineno"> 87</span> }</div>
|
|
<div class="line"><span class="lineno"> 88</span> <span class="keywordflow">if</span> (i < num_points - 1) { <span class="comment">// if not the last row</span></div>
|
|
<div class="line"><span class="lineno"> 89</span> fp << <span class="stringliteral">"\n"</span>; <span class="comment">// start a new line</span></div>
|
|
<div class="line"><span class="lineno"> 90</span> }</div>
|
|
<div class="line"><span class="lineno"> 91</span> }</div>
|
|
<div class="line"><span class="lineno"> 92</span> </div>
|
|
<div class="line"><span class="lineno"> 93</span> fp.close();</div>
|
|
<div class="line"><span class="lineno"> 94</span> <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><span class="lineno"> 95</span>}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="gae0208548f8b393528e5db01717e88e67" name="gae0208548f8b393528e5db01717e88e67"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#gae0208548f8b393528e5db01717e88e67">◆ </a></span>save_nd_data()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">int save_nd_data </td>
|
|
<td>(</td>
|
|
<td class="paramtype">const char *</td> <td class="paramname"><span class="paramname"><em>fname</em></span>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">const std::vector< std::valarray< double > > &</td> <td class="paramname"><span class="paramname"><em>X</em></span> )</td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Save a given n-dimensional data martix to file.</p>
|
|
<dl class="params"><dt>Parameters</dt><dd>
|
|
<table class="params">
|
|
<tr><td class="paramdir">[in]</td><td class="paramname">fname</td><td>filename to save in (gets overwriten without confirmation) </td></tr>
|
|
<tr><td class="paramdir">[in]</td><td class="paramname">X</td><td>matrix to save </td></tr>
|
|
</table>
|
|
</dd>
|
|
</dl>
|
|
<dl class="section return"><dt>Returns</dt><dd>0 if all ok </dd>
|
|
<dd>
|
|
-1 if file creation failed </dd></dl>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00058">58</a> of file <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html">kohonen_som_trace.cpp</a>.</p>
|
|
<div class="fragment"><div class="line"><span class="lineno"> 59</span> {</div>
|
|
<div class="line"><span class="lineno"> 60</span> <span class="keywordtype">size_t</span> num_points = X.size(); <span class="comment">// number of rows</span></div>
|
|
<div class="line"><span class="lineno"> 61</span> <span class="keywordtype">size_t</span> num_features = X[0].size(); <span class="comment">// number of columns</span></div>
|
|
<div class="line"><span class="lineno"> 62</span> </div>
|
|
<div class="line"><span class="lineno"> 63</span> std::ofstream fp;</div>
|
|
<div class="line"><span class="lineno"> 64</span> fp.open(fname);</div>
|
|
<div class="line"><span class="lineno"> 65</span> <span class="keywordflow">if</span> (!fp.is_open()) {</div>
|
|
<div class="line"><span class="lineno"> 66</span> <span class="comment">// error with opening file to write</span></div>
|
|
<div class="line"><span class="lineno"> 67</span> std::cerr << <span class="stringliteral">"Error opening file "</span> << fname << <span class="stringliteral">"\n"</span>;</div>
|
|
<div class="line"><span class="lineno"> 68</span> <span class="keywordflow">return</span> -1;</div>
|
|
<div class="line"><span class="lineno"> 69</span> }</div>
|
|
<div class="line"><span class="lineno"> 70</span> </div>
|
|
<div class="line"><span class="lineno"> 71</span> <span class="comment">// for each point in the array</span></div>
|
|
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_points; i++) {</div>
|
|
<div class="line"><span class="lineno"> 73</span> <span class="comment">// for each feature in the array</span></div>
|
|
<div class="line"><span class="lineno"> 74</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < num_features; j++) {</div>
|
|
<div class="line"><span class="lineno"> 75</span> fp << X[i][j]; <span class="comment">// print the feature value</span></div>
|
|
<div class="line"><span class="lineno"> 76</span> <span class="keywordflow">if</span> (j < num_features - 1) { <span class="comment">// if not the last feature</span></div>
|
|
<div class="line"><span class="lineno"> 77</span> fp << <span class="stringliteral">","</span>; <span class="comment">// suffix comma</span></div>
|
|
<div class="line"><span class="lineno"> 78</span> }</div>
|
|
<div class="line"><span class="lineno"> 79</span> }</div>
|
|
<div class="line"><span class="lineno"> 80</span> <span class="keywordflow">if</span> (i < num_points - 1) { <span class="comment">// if not the last row</span></div>
|
|
<div class="line"><span class="lineno"> 81</span> fp << <span class="stringliteral">"\n"</span>; <span class="comment">// start a new line</span></div>
|
|
<div class="line"><span class="lineno"> 82</span> }</div>
|
|
<div class="line"><span class="lineno"> 83</span> }</div>
|
|
<div class="line"><span class="lineno"> 84</span> </div>
|
|
<div class="line"><span class="lineno"> 85</span> fp.close();</div>
|
|
<div class="line"><span class="lineno"> 86</span> <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><span class="lineno"> 87</span>}</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a name="doc-var-members" id="doc-var-members"></a><h2 id="header-doc-var-members" class="groupheader">Variable Documentation</h2>
|
|
<a id="ga5118e5cbc4f0886e27b3a7a2544dded1" name="ga5118e5cbc4f0886e27b3a7a2544dded1"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ga5118e5cbc4f0886e27b3a7a2544dded1">◆ </a></span>MAX_ITER</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<table class="mlabels">
|
|
<tr>
|
|
<td class="mlabels-left">
|
|
<table class="memname">
|
|
<tr>
|
|
<td class="memname">int MAX_ITER = 500</td>
|
|
</tr>
|
|
</table>
|
|
</td>
|
|
<td class="mlabels-right">
|
|
<span class="mlabels"><span class="mlabel constexpr">constexpr</span></span> </td>
|
|
</tr>
|
|
</table>
|
|
</div><div class="memdoc">
|
|
<p>Maximum number of iterations to learn </p>
|
|
|
|
<p class="definition">Definition at line <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html">adaline_learning.cpp</a>.</p>
|
|
|
|
</div>
|
|
</div>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<div id="page-nav" class="page-nav-panel">
|
|
<div id="page-nav-resize-handle"></div>
|
|
<div id="page-nav-tree">
|
|
<div id="page-nav-contents">
|
|
</div><!-- page-nav-contents -->
|
|
</div><!-- page-nav-tree -->
|
|
</div><!-- page-nav -->
|
|
</div><!-- container -->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.14.0 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|