Sciweavers

KDD
2010
ACM
199views Data Mining» more  KDD 2010»
14 years 15 days ago
Overlapping experiment infrastructure: more, better, faster experimentation
At Google, experimentation is practically a mantra; we evaluate almost every change that potentially affects what our users experience. Such changes include not only obvious user-...
Diane Tang, Ashish Agarwal, Deirdre O'Brien, Mike ...
KDD
2010
ACM
224views Data Mining» more  KDD 2010»
14 years 15 days ago
Suggesting friends using the implicit social graph
Maayan Roth, Assaf Ben-David, David Deutscher, Guy...
KDD
2010
ACM
235views Data Mining» more  KDD 2010»
14 years 15 days ago
Mining advisor-advisee relationships from research publication networks
Chi Wang, Jiawei Han, Yuntao Jia, Jie Tang, Duo Zh...
KDD
2010
ACM
243views Data Mining» more  KDD 2010»
14 years 15 days ago
Data mining with differential privacy
Arik Friedman, Assaf Schuster
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
14 years 15 days ago
Mining top-k frequent items in a data stream with flexible sliding windows
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...
Hoang Thanh Lam, Toon Calders
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
14 years 15 days ago
Beyond heuristics: learning to classify vulnerabilities and predict exploits
The security demands on modern system administration are enormous and getting worse. Chief among these demands, administrators must monitor the continual ongoing disclosure of sof...
Mehran Bozorgi, Lawrence K. Saul, Stefan Savage, G...
KDD
2010
ACM
244views Data Mining» more  KDD 2010»
14 years 15 days ago
Connecting the dots between news articles
The process of extracting useful knowledge from large datasets has become one of the most pressing problems in today’s society. The problem spans entire sectors, from scientists...
Dafna Shahaf, Carlos Guestrin
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
14 years 15 days ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
KDD
2010
ACM
182views Data Mining» more  KDD 2010»
14 years 15 days ago
Extracting temporal signatures for comprehending systems biology models
Naren Sundaravaradan, K. S. M. Tozammel Hossain, V...
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
14 years 15 days ago
Frequent regular itemset mining
Concise representations of frequent itemsets sacrifice readability and direct interpretability by a data analyst of the concise patterns extracted. In this paper, we introduce an...
Salvatore Ruggieri