SDM 2007 - PDF Preprint Papers

SDM 2007 Secure Data Management

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SDM-2007 Paper

click to vote

SDM
2007
SIAM

204views Data Mining» more SDM 2007»

Flexible Anonymization For Privacy Preserving Data Publishing: A Systematic Search Based Approach

14 years 1 months ago

Download siam.org

k-anonymity is a popular measure of privacy for data publishing: It measures the risk of identity-disclosure of individuals whose personal information are released in the form of ...

Bijit Hore, Ravi Chandra Jammalamadaka, Sharad Meh...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	204	Flexible Anonymization For Privacy Preserving Data Publishing: A Systematic Search Based Approach	claim
2	201	Fast Best-Match Shape Searching in Rotation Invariant Metric Spaces	claim
3	198	Learning from Time-Changing Data with Adaptive Windowing	claim
4	195	On Anonymization of String Data	claim
5	190	AC-Framework for Privacy-Preserving Collaboration	claim
6	187	Topic Models over Text Streams: A Study of Batch and Online Unsupervised Learning	claim
7	184	Mining Naturally Smooth Evolution of Clusters from Dynamic Data	claim
8	182	Distance Preserving Dimension Reduction for Manifold Learning	claim
9	177	Multi-way Clustering on Relation Graphs	claim
10	177	Bursty Feature Representation for Clustering Text Streams	claim
11	176	Adaptive Concept Learning through Clustering and Aggregation of Relational Data	claim
12	171	A Better Alternative to Piecewise Linear Time Series Segmentation	claim
13	169	Rank Aggregation for Similar Items	claim
14	167	Bandits for Taxonomies: A Model-based Approach	claim
15	162	Probabilistic Joint Feature Selection for Multi-task Learning	claim
16	152	HP2PC: Scalable Hierarchically-Distributed Peer-to-Peer Clustering	claim
17	149	WAT: Finding Top-K Discords in Time Series Database	claim
18	147	Constraint-Based Pattern Set Mining	claim
19	146	ROAM: Rule- and Motif-Based Anomaly Detection in Massive Moving Object Data Sets	claim
20	145	Finding Motifs in a Database of Shapes	claim
21	143	Patterns of Cascading Behavior in Large Blog Graphs	claim
22	143	Clustering by weighted cuts in directed graphs	claim
23	143	Less is More: Compact Matrix Decomposition for Large Sparse Graphs	claim
24	140	A General Framework for Mining Concept-Drifting Data Streams with Skewed Distributions	claim
25	139	Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree	claim
26	138	Fast Newton-type Methods for the Least Squares Nonnegative Matrix Approximation Problem	claim
27	137	Are approximation algorithms for consensus clustering worthwhile?	claim
28	137	Semi-supervised Feature Selection via Spectral Analysis	claim
29	133	On Point Sampling Versus Space Sampling for Dimensionality Reduction	claim
30	133	Change-Point Detection using Krylov Subspace Learning	claim
31	131	Load Shedding in Classifying Multi-Source Streaming Data: A Bayes Risk Approach	claim
32	130	Maximizing the Area under the ROC Curve with Decision Lists and Rule Sets	claim
33	130	Towards Attack-Resilient Geometric Data Perturbation	claim
34	126	Scalable Name Disambiguation using Multi-level Graph Partition	claim
35	126	Nonlinear Dimensionality Reduction using Approximate Nearest Neighbors	claim
36	122	Incremental Spectral Clustering With Application to Monitoring of Evolving Blog Communities	claim
37	121	Mining Visual and Textual Data for Constructing a Multi-Modal Thesaurus	claim
38	120	An Analysis of Logistic Models: Exponential Family Connections and Online Performance	claim
39	118	On Privacy-Preservation of Text and Sparse Binary Data with Sketches	claim
40	117	Discriminating Subsequence Discovery for Sequence Clustering	claim
41	117	Summarizing Review Scores of "Unequal" Reviewers	claim
42	114	Harmonium Models for Semantic Video Representation and Classification	claim
43	112	PoClustering: Lossless Clustering of Dissimilarity Data	claim
44	111	Fast Counting with AV-Space for Efficient Rule Induction	claim
45	109	Segmentations with Rearrangements	claim
46	108	Semi-Supervised Dimensionality Reduction	claim
47	107	On Demand Phenotype Ranking through Subspace Clustering	claim
48	106	Approximating Representations for Large Numerical Databases	claim
49	106	Performance of Recommendation Systems in Dynamic Streaming Environments	claim
50	104	Boosting Optimal Logical Patterns Using Noisy Data	claim
51	104	Fast Multilevel Transduction on Graphs	claim
52	103	A System for Keyword Search on Textual Streams	claim
53	98	An incremental data-stream sketch using sparse random projections	claim
54	98	Lattice based Clustering of Temporal Gene-Expression Matrices	claim
55	96	Understanding and Utilizing the Hierarchy of Abnormal BGP Events	claim
56	96	Higher Order Orthogonal Iteration of Tensors (HOOI) and its Relation to PCA and GLRAM	claim
57	90	Co-Preserving Patterns in Bipartite Partitioning for Topic Identification	claim
58	89	Preventing Information Leaks in Email	claim
59	86	Identifying Bundles of Product Options using Mutual Information Clustering	claim
60	85	Kernel Based Detection of Mislabeled Training Examples	claim
61	81	A PAC Bound for Approximate Support Vector Machines	claim
62	74	HACS: Heuristic Algorithm for Clustering Subsets	claim
63	73	Sketching Landscapes of Page Farms	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers