1599 search results - page 45 / 320 » Theoretical Frameworks for Data Mining |
KDD
2004
ACM
14 years 9 months ago
2004
ACM
Privacy-preserving data mining has concentrated on obtaining valid results when the input data is private. An extreme example is Secure Multiparty Computation-based methods, where...
ACSC
2002
IEEE
14 years 1 months ago
2002
IEEE
We show how frequently occurring sequential patterns may be found from large datasets by first inducing a finite state automaton model describing the data, and then querying the m...
ICDE
2005
IEEE
14 years 10 months ago
2005
IEEE
To preserve client privacy in the data mining process, a variety of techniques based on random perturbation of individual data records have been proposed recently. In this paper, ...
KDD
2006
ACM
14 years 9 months ago
2006
ACM
We introduce a novel framework (BLOSOM) for mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions into four categories: p...
ADMA
2009
Springer
14 years 3 months ago
2009
Springer
The goal of multi-objective clustering (MOC) is to decompose a dataset into similar groups maximizing multiple objectives in parallel. In this paper, we provide a methodology, arch...