📄 is.maximal.html
字号:
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><title>R: Find Maximal 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.maximal {arules}"><tr><td>is.maximal {arules}</td><td align="right">R Documentation</td></tr></table>
<h2>Find Maximal Itemsets</h2>
<h3>Description</h3>
<p>
Provides the generic function and the S4 method <code>is.maximal</code> for finding
maximal itemsets. An itemset is maximal in a set if no proper superset of the
itemset is contained in the set (Zaki et al., 1997).
</p>
<h3>Usage</h3>
<pre>
is.maximal(x,...)
## S4 method for signature 'itemMatrix':
is.maximal(x)
</pre>
<h3>Arguments</h3>
<table summary="R argblock">
<tr valign="top"><td><code>x</code></td>
<td>
the set of itemsets or an itemMatrix object. </td></tr>
<tr valign="top"><td><code>...</code></td>
<td>
further arguments.</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 maximal itemset.</p>
<h3>References</h3>
<p>
Mohammed J. Zaki, Srinivasan Parthasarathy, Mitsunori Ogihara, and Wei Li
(1997). <EM>New algorithms for fast discovery of association rules</EM>.
Technical Report 651, Computer Science Department, University of Rochester,
Rochester, NY 14627.
</p>
<h3>See Also</h3>
<p>
<code><a href="is.superset.html">is.superset</a></code>,
<code><a href="itemMatrix-class.html">itemMatrix-class</a></code>,
<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 + -