12943 search results - page 1945 / 2589 » Predicting When Not to Predict |
201
click to vote
KDD
2007
ACM
16 years 7 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...
198
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Typical approaches to multi-label classification problem require learning an independent classifier for every label from all the examples and features. This can become a computati...
193
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
232
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
227
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Interaction graphs are ubiquitous in many fields such as bioinformatics, sociology and physical sciences. There have been many studies in the literature targeted at studying and m...