318 search results - page 30 / 64 » Efficient Mining of Generalized Negative Association Rules |
KDD
2008
ACM
14 years 8 months ago
2008
ACM
We present a prototype of an inductive database. Our system enables the user to query not only the data stored in the database but also generalizations (e.g. rules or trees) over ...
DATAMINE
2008
13 years 7 months ago
2008
Abstract. In this paper we aim at extending the non-derivable condensed representation in frequent itemset mining to sequential pattern mining. We start by showing a negative examp...
KDD
1995
ACM
13 years 11 months ago
1995
ACM
Our work tackles the problem of finding partial determinations in databases and proposes a compressionbased measure to evaluate them. Partial determinations can be viewed as gener...
KDD
2005
ACM
14 years 1 months ago
2005
ACM
This paper presents a framework for user-oriented text mining. It is then illustrated with an example of discovering knowledge from competitors’ websites. The knowledge to be di...
CIKM
2006
Springer
13 years 11 months ago
2006
Springer
The rapid growth of transactional data brought, soon enough, into attention the need of its further exploitation. In this paper, we investigate the problem of securing sensitive k...