Sciweavers

438 search results - page 3 / 88
» Temporized and Localized Rule Sets
Sort
View
ICDE
2004
IEEE
87views Database» more  ICDE 2004»
14 years 9 months ago
On Local Pruning of Association Rules Using Directed Hypergraphs
In this paper we propose an adaptive local pruning method for association rules. Our method exploits the exact mapping between a certain class of association rules, namely those w...
Sanjay Chawla, Joseph G. Davis, Gaurav Pandey
ASC
2011
13 years 2 months ago
A rough set approach to multiple dataset analysis
In the area of data mining, the discovery of valuable changes and connections (e.g., causality) from multiple data sets has been recognized as an important issue. This issue essen...
Ken Kaneiwa
IJAR
2008
82views more  IJAR 2008»
13 years 7 months ago
Probabilistic rough set approximations
This paper reviews probabilistic approaches to rough sets in granulation, approximation, and rule induction. The Shannon entropy function is used to quantitatively characterize pa...
Yiyu Yao
HAIS
2011
Springer
12 years 11 months ago
Evolving Temporal Fuzzy Association Rules from Quantitative Data with a Multi-Objective Evolutionary Algorithm
A novel method for mining association rules that are both quantitative and temporal using a multi-objective evolutionary algorithm is presented. This method successfully identifie...
Stephen G. Matthews, Mario A. Góngora, Adri...
ALGORITHMICA
2006
161views more  ALGORITHMICA 2006»
13 years 7 months ago
The Expected Size of the Rule k Dominating Set
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
Jennie C. Hansen, Eric Schmutz, Li Sheng