Sciweavers

8 search results - page 1 / 2
» Defining diff as a Data Mining Primitive
Sort
View
KDD
1998
ACM
129views Data Mining» more  KDD 1998»
13 years 9 months ago
Defining diff as a Data Mining Primitive
Ramesh Subramonian
BTW
1999
Springer
157views Database» more  BTW 1999»
13 years 9 months ago
Database Primitives for Spatial Data Mining
Abstract: Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a singl...
Martin Ester, Stefan Grundlach, Hans-Peter Kriegel...
DATAMINE
2000
118views more  DATAMINE 2000»
13 years 4 months ago
Spatial Data Mining: Database Primitives, Algorithms and Efficient DBMS Support
Abstract: Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a singl...
Martin Ester, Alexander Frommelt, Hans-Peter Krieg...
KDD
2004
ACM
160views Data Mining» more  KDD 2004»
14 years 5 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
ICDM
2002
IEEE
163views Data Mining» more  ICDM 2002»
13 years 9 months ago
High Performance Data Mining Using the Nearest Neighbor Join
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
Christian Böhm, Florian Krebs