Sciweavers

235 search results - page 4 / 47
» A New Approach of Eliminating Redundant Association Rules
Sort
View
ICTAI
2003
IEEE
14 years 2 months ago
Eliminating Redundancies in SAT Search Trees
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, ...
IJCAI
1997
13 years 10 months ago
Equational Reasoning using AC Constraints
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
David A. Plaisted, Yunshan Zhu
IJSWIS
2007
133views more  IJSWIS 2007»
13 years 8 months ago
Association Rule Ontology Matching Approach
This paper presents a hybrid, extensional and asymmetric matching approach designed to find out semantic relations (equivalence and subsumption) between entities issued from two ...
Jérôme David, Fabrice Guillet, Henri ...
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
IMECS
2007
13 years 10 months ago
A New Class Based Associative Classification Algorithm
—applying the association rule into classification can improve the accuracy and obtain some valuable rules and information that cannot be captured by other classification approac...
Zhonghua Tang, Qin Liao