Sciweavers

5849 search results - page 875 / 1170
» Predictive search distributions
Sort
View
SIGSOFT
2007
ACM
16 years 7 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
16 years 7 months ago
User grouping behavior in online forums
Online forums represent one type of social media that is particularly rich for studying human behavior in information seeking and diffusing. The way users join communities is a re...
Xiaolin Shi, Jun Zhu, Rui Cai, Lei Zhang
219
Voted
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
16 years 7 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto
221
Voted
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
16 years 7 months ago
Knowledge transfer via multiple model local structure mapping
The effectiveness of knowledge transfer using classification algorithms depends on the difference between the distribution that generates the training examples and the one from wh...
Jing Gao, Wei Fan, Jing Jiang, Jiawei Han
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
16 years 7 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...