Sciweavers

1625 search results - page 257 / 325
» Privacy-preserving data publishing
Sort
View
BMCBI
2011
14 years 9 months ago
Comparing genotyping algorithms for Illumina's Infinium whole-genome SNP BeadChips
Background: Illumina’s Infinium SNP BeadChips are extensively used in both small and large-scale genetic studies. A fundamental step in any analysis is the processing of raw all...
Matthew E. Ritchie, Ruijie Liu, Benilton Carvalho,...
KDD
2009
ACM
172views Data Mining» more  KDD 2009»
16 years 2 months ago
Towards combining web classification and web information extraction: a case study
: ? Towards Combining Web Classification and Web Information Extraction: a Case Study Ping Luo, Fen Lin, Yuhong Xiong, Yong Zhao, Zhongzhi Shi HP Laboratories HPL-2009-86 Classific...
Ping Luo, Fen Lin, Yuhong Xiong, Yong Zhao, Zhongz...
KDD
2009
ACM
158views Data Mining» more  KDD 2009»
16 years 2 months ago
Feature shaping for linear SVM classifiers
: ? Feature Shaping for Linear SVM Classifiers George Forman, Martin Scholz, Shyamsundar Rajaram HP Laboratories HPL-2009-31R1 text classification machine learning, feature weighti...
George Forman, Martin Scholz, Shyamsundar Rajaram
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
16 years 2 months ago
Efficient methods for topic model inference on streaming document collections
Topic models provide a powerful tool for analyzing large text collections by representing high dimensional data in a low dimensional subspace. Fitting a topic model given a set of...
Limin Yao, David M. Mimno, Andrew McCallum
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
16 years 2 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...