Sciweavers

KDD
2010
ACM
233views Data Mining» more  KDD 2010»
13 years 8 months ago
Evolutionary hierarchical dirichlet processes for multiple correlated time-varying corpora
Mining cluster evolution from multiple correlated time-varying text corpora is important in exploratory text analytics. In this paper, we propose an approach called evolutionary h...
Jianwen Zhang, Yangqiu Song, Changshui Zhang, Shix...
KDD
2010
ACM
240views Data Mining» more  KDD 2010»
13 years 8 months ago
Diagnosing memory leaks using graph mining on heap dumps
Memory leaks are caused by software programs that prevent the reclamation of memory that is no longer in use. They can cause significant slowdowns, exhaustion of available storag...
Evan K. Maxwell, Godmar Back, Naren Ramakrishnan
KDD
2010
ACM
175views Data Mining» more  KDD 2010»
13 years 8 months ago
Learning with cost intervals
Existing cost-sensitive learning methods work with unequal misclassification cost that is given by domain knowledge and appears as precise values. In many real-world applications,...
Xu-Ying Liu, Zhi-Hua Zhou
KDD
2010
ACM
224views Data Mining» more  KDD 2010»
13 years 8 months ago
Ensemble pruning via individual contribution ordering
An ensemble is a set of learned models that make decisions collectively. Although an ensemble is usually more accurate than a single learner, existing ensemble methods often tend ...
Zhenyu Lu, Xindong Wu, Xingquan Zhu, Josh Bongard
KDD
2010
ACM
228views Data Mining» more  KDD 2010»
13 years 8 months ago
The new iris data: modular data generators
In this paper we introduce a modular, highly flexible, opensource environment for data generation. Using an existing graphical data flow tool, the user can combine various types...
Iris Adä, Michael R. Berthold
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
13 years 8 months 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»
13 years 8 months 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»
13 years 8 months 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»
13 years 8 months ago
Data mining with differential privacy
Arik Friedman, Assaf Schuster
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
13 years 8 months 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