Sciweavers

235 search results - page 2 / 47
» A New Approach of Eliminating Redundant Association Rules
Sort
View
DATAMINE
2007
101views more  DATAMINE 2007»
13 years 5 months ago
Using metarules to organize and group discovered association rules
The high dimensionality of massive data results in the discovery of a large number of association rules. The huge number of rules makes it difficult to interpret and react to all ...
Abdelaziz Berrado, George C. Runger
ICEIS
2009
IEEE
13 years 12 months ago
NARFO Algorithm: Mining Non-redundant and Generalized Association Rules Based on Fuzzy Ontologies
Traditional approaches for mining generalized association rules are based only on database contents, and focus on exact matches among items. However, in many applications, the use ...
Rafael Garcia Miani, Cristiane A. Yaguinuma, Maril...
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 6 months ago
Generalized Closed Itemsets for Association Rule Mining
The output of boolean association rule mining algorithms is often too large for manual examination. For dense datasets, it is often impractical to even generate all frequent items...
Vikram Pudi, Jayant R. Haritsa
ICDE
1998
IEEE
103views Database» more  ICDE 1998»
14 years 6 months ago
Online Generation of Association Rules
We have a large database consisting of sales transactions. We investigate the problem of online mining of association rules in this large database. We show how to preprocess the d...
Charu C. Aggarwal, Philip S. Yu
APAL
2010
123views more  APAL 2010»
13 years 5 months ago
Cut elimination and strong separation for substructural logics: An algebraic approach
Abstract. We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existin...
Nikolaos Galatos, Hiroakira Ono