282 search results - page 28 / 57 » Generating non-redundant association rules |
101
click to vote
WAIM
2010
Springer
14 years 8 months ago
2010
Springer
In this paper we propose a generic model to generate basic multi-partite graphs obtained by associations found in arbitrary data. The interest of such a model is to be the formal ...
DGO
2007
14 years 11 months ago
2007
Solving complex global problems such as illegal immigration, border control, and terrorism requires government organizations at all levels to share not only data but, more importa...
DIS
2008
Springer
14 years 11 months ago
2008
Springer
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
TPHOL
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
99
Voted
CSJM
2008
14 years 9 months ago
2008
A hybrid network of evolutionary processors (an HNEP) is a graph where each node is associated with an evolutionary processor (a special rewriting system), a set of words, an inpu...