Sciweavers

942 search results - page 82 / 189
» Efficiently Mining Long Patterns from Databases
Sort
View
KDD
2004
ACM
160views Data Mining» more  KDD 2004»
15 years 10 months ago
k-TTP: a new privacy model for large-scale distributed environments
Secure multiparty computation allows parties to jointly compute a function of their private inputs without revealing anything but the output. Theoretical results [2] provide a gen...
Bobi Gilburd, Assaf Schuster, Ran Wolff
ESANN
2004
14 years 11 months ago
Neural networks for data mining: constrains and open problems
When we talk about using neural networks for data mining we have in mind the original data mining scope and challenge. How did neural networks meet this challenge? Can we run neura...
Razvan Andonie, Boris Kovalerchuk
PAKDD
2000
ACM
140views Data Mining» more  PAKDD 2000»
15 years 1 months ago
Performance Controlled Data Reduction for Knowledge Discovery in Distributed Databases
The objective of data reduction is to obtain a compact representation of a large data set to facilitate repeated use of non-redundant information with complex and slow learning alg...
Slobodan Vucetic, Zoran Obradovic
KDD
2000
ACM
121views Data Mining» more  KDD 2000»
15 years 1 months ago
Mining high-speed data streams
Many organizations today have more than very large databases; they have databases that grow without limit at a rate of several million records per day. Mining these continuous dat...
Pedro Domingos, Geoff Hulten
IEEEICCI
2006
IEEE
15 years 3 months ago
Evolved Patterns of Connectivity in Associative Memory Models
This paper investigates possible connection strategies in sparsely connected associative memory models. This is interesting because real neural networks must have both efficient p...
Rod Adams, Lee Calcraft, Neil Davey