KDD
2007
ACM
14 years 9 months ago
2007
ACM
KDD
2007
ACM
14 years 9 months ago
2007
ACM
We address the task of learning rankings of documents from search engine logs of user behavior. Previous work on this problem has relied on passively collected clickthrough data. ...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
KDD
2007
ACM
14 years 9 months ago
2007
ACM
How can we find communities in dynamic networks of social interactions, such as who calls whom, who emails whom, or who sells to whom? How can we spot discontinuity timepoints in ...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
Previous work on text mining has almost exclusively focused on a single stream. However, we often have available multiple text streams indexed by the same set of time points (call...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
This work studies the problem of distributed classification in peer-to-peer (P2P) networks. While there has been a significant amount of work in distributed classification, most o...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
We consider the problem of estimating occurrence rates of rare events for extremely sparse data, using pre-existing hierarchies to perform inference at multiple resolutions. In pa...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
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...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
Characterising the differences between two databases is an often occurring problem in Data Mining. Detection of change over time is a prime example, comparing databases from two b...