Sciweavers

569 search results - page 64 / 114
» An efficient clustering method for k-anonymization
Sort
View
WWW
2008
ACM
14 years 9 months ago
Efficient similarity joins for near duplicate detection
With the increasing amount of data and the need to integrate data from multiple data sources, a challenging issue is to find near duplicate records efficiently. In this paper, we ...
Chuan Xiao, Wei Wang 0011, Xuemin Lin, Jeffrey Xu ...
PROCEDIA
2010
105views more  PROCEDIA 2010»
13 years 7 months ago
Improvement of parallelization efficiency of batch pattern BP training algorithm using Open MPI
The use of tuned collective’s module of Open MPI to improve a parallelization efficiency of parallel batch pattern back propagation training algorithm of a multilayer perceptron...
Volodymyr Turchenko, Lucio Grandinetti, George Bos...
ICDE
2003
IEEE
193views Database» more  ICDE 2003»
14 years 10 months ago
An Adaptive and Efficient Dimensionality Reduction Algorithm for High-Dimensional Indexing
The notorious "dimensionality curse" is a well-known phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well known approach to o...
Hui Jin, Beng Chin Ooi, Heng Tao Shen, Cui Yu, Aoy...
SSD
2007
Springer
131views Database» more  SSD 2007»
14 years 2 months ago
Efficiently Mining Regional Outliers in Spatial Data
With the increasing availability of spatial data in many applications, spatial clustering and outlier detection has received a lot of attention in the database and data mining comm...
Richard Frank, Wen Jin, Martin Ester
ICDE
1987
IEEE
81views Database» more  ICDE 1987»
14 years 6 days ago
Multidimensional Dynamic Quantile Hashing is Very Efficient for Non-Uniform Record Distributions
: Previous multidimensional dynamic hashing schemes exhibit two obvious shortcomings. First, even for uniform record distribution, the retrieval performance of these schemes suffer...
Hans-Peter Kriegel, Bernhard Seeger