Sciweavers

KDD
2007
ACM
186views Data Mining» more  KDD 2007»
14 years 9 months ago
An Ad Omnia Approach to Defining and Achieving Private Data Analysis
We briefly survey several privacy compromises in published datasets, some historical and some on paper. An inspection of these suggests that the problem lies with the nature of the...
Cynthia Dwork
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
14 years 9 months ago
Privacy-Preserving Data Mining through Knowledge Model Sharing
Privacy-preserving data mining (PPDM) is an important topic to both industry and academia. In general there are two approaches to tackling PPDM, one is statistics-based and the oth...
Patrick Sharkey, Hongwei Tian, Weining Zhang, Shou...
KDD
2007
ACM
142views Data Mining» more  KDD 2007»
14 years 9 months ago
Towards Privacy-Preserving Model Selection
Abstract. Model selection is an important problem in statistics, machine learning, and data mining. In this paper, we investigate the problem of enabling multiple parties to perfor...
Zhiqiang Yang, Sheng Zhong, Rebecca N. Wright
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 9 months ago
Domain-constrained semi-supervised mining of tracking models in sensor networks
Accurate localization of mobile objects is a major research problem in sensor networks and an important data mining application. Specifically, the localization problem is to deter...
Rong Pan, Junhui Zhao, Vincent Wenchen Zheng, Jeff...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 9 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
KDD
2007
ACM
167views Data Mining» more  KDD 2007»
14 years 9 months ago
Multiscale topic tomography
Modeling the evolution of topics with time is of great value in automatic summarization and analysis of large document collections. In this work, we propose a new probabilistic gr...
Ramesh Nallapati, Susan Ditmore, John D. Lafferty,...
KDD
2007
ACM
122views Data Mining» more  KDD 2007»
14 years 9 months ago
Expertise modeling for matching papers with reviewers
An essential part of an expert-finding task, such as matching reviewers to submitted papers, is the ability to model the expertise of a person based on documents. We evaluate seve...
David M. Mimno, Andrew McCallum
KDD
2007
ACM
135views Data Mining» more  KDD 2007»
14 years 9 months ago
Nestedness and segmented nestedness
Consider each row of a 0-1 dataset as the subset of the
Heikki Mannila, Evimaria Terzi
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
14 years 9 months ago
A probabilistic framework for relational clustering
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu