Sciweavers

371 search results - page 65 / 75
» A Framework for Privacy Preserving Classification in Data Mi...
Sort
View
KDD
2001
ACM
216views Data Mining» more  KDD 2001»
14 years 8 months ago
The distributed boosting algorithm
In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneo...
Aleksandar Lazarevic, Zoran Obradovic
KDD
2009
ACM
298views Data Mining» more  KDD 2009»
14 years 2 months ago
Mind the gaps: weighting the unknown in large-scale one-class collaborative filtering
One-Class Collaborative Filtering (OCCF) is a task that naturally emerges in recommender system settings. Typical characteristics include: Only positive examples can be observed, ...
Rong Pan, Martin Scholz
CVPR
2008
IEEE
13 years 7 months ago
Joint learning and dictionary construction for pattern recognition
We propose a joint representation and classification framework that achieves the dual goal of finding the most discriminative sparse overcomplete encoding and optimal classifier p...
Duc-Son Pham, Svetha Venkatesh
CCS
2009
ACM
14 years 2 months ago
Privacy-preserving genomic computation through program specialization
In this paper, we present a new approach to performing important classes of genomic computations (e.g., search for homologous genes) that makes a significant step towards privacy...
Rui Wang, XiaoFeng Wang, Zhou Li, Haixu Tang, Mich...
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 8 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson