Sciweavers

2049 search results - page 314 / 410
» Privacy-Preserving Data Mining Systems
Sort
View
ICDM
2006
IEEE
138views Data Mining» more  ICDM 2006»
15 years 5 months ago
Adaptive Blocking: Learning to Scale Up Record Linkage
Many information integration tasks require computing similarity between pairs of objects. Pairwise similarity computations are particularly important in record linkage systems, as...
Mikhail Bilenko, Beena Kamath, Raymond J. Mooney
CIKM
2005
Springer
15 years 4 months ago
Privacy leakage in multi-relational databases via pattern based semi-supervised learning
In multi-relational databases, a view, which is a context- and content-dependent subset of one or more tables (or other views), is often used to preserve privacy by hiding sensiti...
Hui Xiong, Michael Steinbach, Vipin Kumar
ICDM
2003
IEEE
181views Data Mining» more  ICDM 2003»
15 years 4 months ago
Dynamic Weighted Majority: A New Ensemble Method for Tracking Concept Drift
Algorithms for tracking concept drift are important for many applications. We present a general method based on the Weighted Majority algorithm for using any online learner for co...
Jeremy Z. Kolter, Marcus A. Maloof
KESAMSTA
2010
Springer
15 years 3 months ago
Classifying Agent Behaviour through Relational Sequential Patterns
Abstract. In Multi-Agent System, observing other agents and modelling their behaviour represents an essential task: agents must be able to quickly adapt to the environment and infe...
Grazia Bombini, Nicola Di Mauro, Stefano Ferilli, ...
DAWAK
1999
Springer
15 years 3 months ago
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
Stefan Berchtold, Christian Böhm, Hans-Peter ...