Sciweavers

497 search results - page 62 / 100
» Mining for Profitable Customers
Sort
View
KDD
2008
ACM
195views Data Mining» more  KDD 2008»
16 years 8 days ago
Learning from multi-topic web documents for contextual advertisement
Contextual advertising on web pages has become very popular recently and it poses its own set of unique text mining challenges. Often advertisers wish to either target (or avoid) ...
Yi Zhang, Arun C. Surendran, John C. Platt, Mukund...
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
16 years 8 days 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
KDD
2008
ACM
217views Data Mining» more  KDD 2008»
16 years 8 days ago
Stream prediction using a generative model based on frequent episodes in event sequences
This paper presents a new algorithm for sequence prediction over long categorical event streams. The input to the algorithm is a set of target event types whose occurrences we wis...
Srivatsan Laxman, Vikram Tankasali, Ryen W. White
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
16 years 8 days ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
KDD
2006
ACM
173views Data Mining» more  KDD 2006»
16 years 8 days ago
Robust information-theoretic clustering
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
Christian Böhm, Christos Faloutsos, Claudia P...