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

📄 is.closed.html

📁 本程序是基于linux系统下c++代码
💻 HTML
字号:
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><title>R: Find Closed Itemsets</title>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
<link rel="stylesheet" type="text/css" href="../../R.css">
</head><body>

<table width="100%" summary="page for is.closed {arules}"><tr><td>is.closed {arules}</td><td align="right">R Documentation</td></tr></table>
<h2>Find Closed Itemsets</h2>


<h3>Description</h3>

<p>
Provides the generic function and the S4 method <code>is.closed</code> for finding
closed itemsets.  The closure of an itemset is its largest proper superset
which has the same support (is containt in exactly the same transactions). An
itemset is closed, if it is its own closure (Pasquier et al. 1999).
</p>


<h3>Usage</h3>

<pre>
is.closed(x)
</pre>


<h3>Arguments</h3>

<table summary="R argblock">
<tr valign="top"><td><code>x</code></td>
<td>
a set of itemsets. </td></tr>
</table>

<h3>Value</h3>

<p>
a logical vector with the same length as <code>x</code> indicating
for each element in <code>x</code> if it is a closed itemset.</p>

<h3>References</h3>

<p>
Nicolas Pasquier, Yves Bastide, Rafik Taouil, and Lotfi Lakhal (1999).
Discovering frequent closed itemsets for association rules. In <EM>Proceeding
of the 7th International Conference on Database Theory</EM>, Lecture Notes In
Computer Science (LNCS 1540), pages 398&ndash;416. Springer, 1999.
</p>


<h3>See Also</h3>

<p>
<code><a href="itemsets-class.html">itemsets-class</a></code>
</p>



<hr><div align="center">[Package <em>arules</em> version 0.6-6 <a href="00Index.html">Index]</a></div>

</body></html>

⌨️ 快捷键说明

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