Sciweavers

330 search results - page 30 / 66
» A Performance Prediction Framework for Grid-Based Data Minin...
Sort
View
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
14 years 9 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
WWW
2010
ACM
14 years 3 months ago
Find me if you can: improving geographical prediction with social and spatial proximity
Geography and social relationships are inextricably intertwined; the people we interact with on a daily basis almost always live near us. As people spend more time online, data re...
Lars Backstrom, Eric Sun, Cameron Marlow
KDD
2005
ACM
106views Data Mining» more  KDD 2005»
14 years 2 months ago
Enhancing the lift under budget constraints: an application in the mutual fund industry
A lift curve, with the true positive rate on the y-axis and the customer pull (or contact) rate on the x-axis, is often used to depict the model performance in many data mining ap...
Lian Yan, Michael Fassino, Patrick Baldasare
KDD
2007
ACM
178views Data Mining» more  KDD 2007»
14 years 9 months ago
Real-time ranking with concept drift using expert advice
In many practical applications, one is interested in generating a ranked list of items using information mined from continuous streams of data. For example, in the context of comp...
Hila Becker, Marta Arias
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
14 years 9 months ago
Discovering significant OPSM subspace clusters in massive gene expression data
Order-preserving submatrixes (OPSMs) have been accepted as a biologically meaningful subspace cluster model, capturing the general tendency of gene expressions across a subset of ...
Byron J. Gao, Obi L. Griffith, Martin Ester, Steve...