Sciweavers

851 search results - page 94 / 171
» On the Complexity of Mining Association Rules
Sort
View
AVI
2004
13 years 10 months ago
SWAPit: a multiple views paradigm for exploring associations of texts and structured data
Visualization interfaces that offer multiple coordinated views on a particular set of data items are useful for navigating and exploring complex information spaces. In this paper ...
Andreas Becks, Christian Seeling
KDD
1995
ACM
99views Data Mining» more  KDD 1995»
14 years 9 days ago
Active Data Mining
We introduce an active data mining paradigm that combines the recent work in data mining with the rich literature on active database systems. In this paradigm, data is continuousl...
Rakesh Agrawal, Giuseppe Psaila
AUSDM
2008
Springer
211views Data Mining» more  AUSDM 2008»
13 years 10 months ago
LBR-Meta: An Efficient Algorithm for Lazy Bayesian Rules
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
Zhipeng Xie
PAKDD
2007
ACM
121views Data Mining» more  PAKDD 2007»
14 years 2 months ago
Two-Phase Algorithms for a Novel Utility-Frequent Mining Model
When companies seek for the combination of products which can constantly generate high profit, the association rule mining (ARM) or the utility mining will not achieve such task. ...
Jieh-Shan Yeh, Yu-Chiang Li, Chin-Chen Chang
PAKDD
2005
ACM
124views Data Mining» more  PAKDD 2005»
14 years 2 months ago
Finding Sporadic Rules Using Apriori-Inverse
We define sporadic rules as those with low support but high confidence: for example, a rare association of two symptoms indicating a rare disease. To find such rules using the w...
Yun Sing Koh, Nathan Rountree