Sciweavers

1998 search results - page 197 / 400
» Basic Association Rules
Sort
View
DKE
2008
124views more  DKE 2008»
15 years 4 months ago
A MaxMin approach for hiding frequent itemsets
In this paper, we are proposing a new algorithmic approach for sanitizing raw data from sensitive knowledge in the context of mining of association rules. The new approach (a) rel...
George V. Moustakides, Vassilios S. Verykios
JUCS
2008
148views more  JUCS 2008»
15 years 4 months ago
Learner Course Recommendation in e-Learning Based on Swarm Intelligence
: This paper analyses aspects about the recommendation process in distributed information systems. It extracts similarities and differences between recommendations in estores and t...
Ana Belén Gil, Francisco José Garc&i...
PPL
2008
88views more  PPL 2008»
15 years 4 months ago
Evaluating Computational Costs while Handling Data and Control Parallelism
The aim of this work is to introduce a computational costs system associated to a semantic framework for orthogonal data and control parallelism handling. In such a framework a pa...
Sonia Campa
CORR
2004
Springer
146views Education» more  CORR 2004»
15 years 3 months ago
Mining Frequent Itemsets from Secondary Memory
Mining frequent itemsets is at the core of mining association rules, and is by now quite well understood algorithmically for main memory databases. In this paper, we investigate a...
Gösta Grahne, Jianfei Zhu
PODS
2003
ACM
156views Database» more  PODS 2003»
16 years 4 months ago
Limiting privacy breaches in privacy preserving data mining
There has been increasing interest in the problem of building accurate data mining models over aggregate data, while protecting privacy at the level of individual records. One app...
Alexandre V. Evfimievski, Johannes Gehrke, Ramakri...