Sciweavers

318 search results - page 33 / 64
» Efficient Mining of Generalized Negative Association Rules
Sort
View
IJAIT
2007
180views more  IJAIT 2007»
13 years 7 months ago
Detection and Prediction of Rare Events in Transaction Databases
Rare events analysis is an area that includes methods for the detection and prediction of events, e.g. a network intrusion or an engine failure, that occur infrequently and have s...
Christos Berberidis, Ioannis P. Vlahavas
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 8 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 8 months ago
Providing k-anonymity in data mining
In this paper we present extended definitions of k-anonymity and use them to prove that a given data mining model does not violate the k-anonymity of the individuals represented in...
Arik Friedman, Ran Wolff, Assaf Schuster
ICMLA
2004
13 years 9 months ago
Mining interesting contrast rules for a web-based educational system
Web-based educational technologies allow educators to study how students learn (descriptive studies) and which learning strategies are most effective (causal/predictive studies). ...
Behrouz Minaei-Bidgoli, Pang-Ning Tan, William F. ...
KDD
2006
ACM
130views Data Mining» more  KDD 2006»
14 years 8 months ago
Discovering significant rules
In many applications, association rules will only be interesting if they represent non-trivial correlations between all constituent items. Numerous techniques have been developed ...
Geoffrey I. Webb