Sciweavers

77 search results - page 11 / 16
» On the Anonymization of Sparse High-Dimensional Data
Sort
View
ICDM
2008
IEEE
141views Data Mining» more  ICDM 2008»
14 years 1 months ago
Scalable Tensor Decompositions for Multi-aspect Data Mining
Modern applications such as Internet traffic, telecommunication records, and large-scale social networks generate massive amounts of data with multiple aspects and high dimensiona...
Tamara G. Kolda, Jimeng Sun
WEBI
2009
Springer
14 years 1 months ago
Fast Matching for All Pairs Similarity Search
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
Amit C. Awekar, Nagiza F. Samatova
SP
2008
IEEE
14 years 1 months ago
Robust De-anonymization of Large Sparse Datasets
We present a new class of statistical deanonymization attacks against high-dimensional micro-data, such as individual preferences, recommendations, transaction records and so on. ...
Arvind Narayanan, Vitaly Shmatikov
ECML
2007
Springer
14 years 26 days ago
Principal Component Analysis for Large Scale Problems with Lots of Missing Values
Abstract. Principal component analysis (PCA) is a well-known classical data analysis technique. There are a number of algorithms for solving the problem, some scaling better than o...
Tapani Raiko, Alexander Ilin, Juha Karhunen
IDEAS
1999
IEEE
175views Database» more  IDEAS 1999»
13 years 11 months ago
A Parallel Scalable Infrastructure for OLAP and Data Mining
Decision support systems are important in leveraging information present in data warehouses in businesses like banking, insurance, retail and health-care among many others. The mu...
Sanjay Goil, Alok N. Choudhary