Sciweavers

1998 search results - page 200 / 400
» Basic Association Rules
Sort
View
140
Voted
SAIG
2001
Springer
15 years 8 months ago
Short Cut Fusion: Proved and Improved
Abstract. Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermed...
Patricia Johann
165
Voted
SP
1999
IEEE
184views Security Privacy» more  SP 1999»
15 years 8 months ago
A Data Mining Framework for Building Intrusion Detection Models
There is often the need to update an installed Intrusion Detection System (IDS) due to new attack methods or upgraded computing environments. Since many current IDSs are construct...
Wenke Lee, Salvatore J. Stolfo, Kui W. Mok
ECAI
1992
Springer
15 years 8 months ago
A Strategy for the Computation of Conditional Answers
We consider non-Horn Deductive Data Bases (DDB) represented in a First Order language without function symbols. In this context the DDB is an incomplete description of the world. ...
Robert Demolombe
KDD
1995
ACM
99views Data Mining» more  KDD 1995»
15 years 7 months 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
RTA
1995
Springer
15 years 7 months ago
Completion for Multiple Reduction Orderings
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
Masahito Kurihara, Hisashi Kondo, Azuma Ohuchi