Sciweavers

504 search results - page 30 / 101
» PCS: An Efficient Clustering Method for High-Dimensional Dat...
Sort
View
IEEECIT
2005
IEEE
14 years 1 months ago
Case Study: Distance-Based Image Retrieval in the MoBIoS DBMS
Similarity search leveraging distance-based index structures is increasingly being used for complex data types. It has been shown that for high dimensional uniform vectors with si...
Rui Mao, Wenguo Liu, Daniel P. Miranker, Qasim Iqb...
EDBT
2008
ACM
124views Database» more  EDBT 2008»
14 years 7 months ago
An efficient clustering method for k-anonymization
The k-anonymity model is a privacy-preserving approach that has been extensively studied for the past few years. To minimize the information loss due to anonymization, it is cruci...
Jun-Lin Lin, Meng-Cheng Wei
TKDE
2002
168views more  TKDE 2002»
13 years 7 months ago
CLARANS: A Method for Clustering Objects for Spatial Data Mining
Spatial data mining is the discovery of interesting relationships and characteristics that may exist implicitly in spatial databases. To this end, this paper has three main contrib...
Raymond T. Ng, Jiawei Han
ICDE
2007
IEEE
165views Database» more  ICDE 2007»
14 years 9 months ago
On Randomization, Public Information and the Curse of Dimensionality
A key method for privacy preserving data mining is that of randomization. Unlike k-anonymity, this technique does not include public information in the underlying assumptions. In ...
Charu C. Aggarwal
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
14 years 9 months ago
Mining Approximate Order Preserving Clusters in the Presence of Noise
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
Mengsheng Zhang, Wei Wang 0010, Jinze Liu