Sciweavers

349 search results - page 22 / 70
» Information Preserving Dimensionality Reduction
Sort
View
DMIN
2006
115views Data Mining» more  DMIN 2006»
13 years 11 months ago
Privacy Preserving in Clustering using Fuzzy Sets
Data mining techniques, in spite of their benefit in a wide range of applications have also raised threat to privacy and data security. This paper addresses the problem of preservi...
S. Srinivasa Rao 0002, K. V. S. V. N. Raju, P. Kus...
CIDM
2007
IEEE
14 years 4 months ago
Scalable Clustering for Large High-Dimensional Data Based on Data Summarization
Clustering large data sets with high dimensionality is a challenging data-mining task. This paper presents a framework to perform such a task efficiently. It is based on the notio...
Ying Lai, Ratko Orlandic, Wai Gen Yee, Sachin Kulk...
NIPS
1998
13 years 11 months ago
Restructuring Sparse High Dimensional Data for Effective Retrieval
The task in text retrieval is to find the subset of a collection of documents relevant to a user's information request, usually expressed as a set of words. Classically, docu...
Charles Lee Isbell Jr., Paul A. Viola
VLDB
2005
ACM
136views Database» more  VLDB 2005»
14 years 3 months ago
On k-Anonymity and the Curse of Dimensionality
In recent years, the wide availability of personal data has made the problem of privacy preserving data mining an important one. A number of methods have recently been proposed fo...
Charu C. Aggarwal
NIPS
1997
13 years 11 months ago
Mapping a Manifold of Perceptual Observations
Nonlinear dimensionality reduction is formulated here as the problem of trying to find a Euclidean feature-space embedding of a set of observations that preserves as closely as p...
Joshua B. Tenenbaum