Sciweavers

1998 search results - page 4 / 400
» Basic Association Rules
Sort
View
TKDE
2002
133views more  TKDE 2002»
13 years 8 months ago
Binary Rule Generation via Hamming Clustering
The generation of a set of rules underlying a classification problem is performed by applying a new algorithm, called Hamming Clustering (HC). It reconstructs the and-or expressio...
Marco Muselli, Diego Liberati
CADE
1998
Springer
14 years 25 days ago
Strict Basic Superposition
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...
Leo Bachmair, Harald Ganzinger
ICCSA
2004
Springer
14 years 2 months ago
Exception Rules Mining Based on Negative Association Rules
Exception rules have been previously defined as rules with low interest and high confidence. In this paper a new approach to mine exception rules will be proposed and evaluated. In...
Olena Daly, David Taniar
RSFDGRC
2005
Springer
110views Data Mining» more  RSFDGRC 2005»
14 years 2 months ago
A Rough Set Based Model to Rank the Importance of Association Rules
Abstract. Association rule algorithms often generate an excessive number of rules, many of which are not significant. It is difficult to determine which rules are more useful, int...
Jiye Li, Nick Cercone
TCS
2002
13 years 8 months ago
Associative language descriptions
The new Associative Language Description (ALD) model, a combination of locally testable and constituent structure ideas, is proposed, arguing that in practice it equals context-fr...
Alessandra Cherubini, Stefano Crespi-Reghizzi, Pie...