2168 search results - page 408 / 434 » Randomized Algorithms and Complexity Theory |
139
click to vote
SIGIR
2012
ACM
13 years 2 months ago
2012
ACM
In this paper, we propose a novel top-k learning to rank framework, which involves labeling strategy, ranking model and evaluation measure. The motivation comes from the difficul...
132
click to vote
VIS
2009
IEEE
16 years 28 days ago
2009
IEEE
In this paper we describe a novel method to integrate interactive visual analysis and machine learning to support the insight generation of the user. The suggested approach combine...
159
click to vote
WWW
2008
ACM
16 years 12 days ago
2008
ACM
We discover communities from social network data, and analyze the community evolution. These communities are inherent characteristics of human interaction in online social network...
WWW
2004
ACM
16 years 12 days ago
2004
ACM
This paper investigates how the vision of the Semantic Web can be carried over to the realm of email. We introduce a general notion of semantic email, in which an email message co...
114
click to vote
KDD
2008
ACM
16 years 3 days ago
2008
ACM
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...