1314 search results - page 206 / 263 » Approximate data mining in very large relational data |
129
click to vote
WSDM
2009
ACM
15 years 11 months ago
2009
ACM
Readability is a crucial presentation attribute that web summarization algorithms consider while generating a querybaised web summary. Readability quality also forms an important ...
137
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
154
click to vote
KDD
2010
ACM
15 years 8 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
137
click to vote
CORR
2012
Springer
14 years 3 days ago
2012
Springer
We consider Location-based Service (LBS) settings, where a LBS provider logs the requests sent by mobile device users over a period of time and later wants to publish/share these ...
144
click to vote
MVA
1990
15 years 5 months ago
1990
Abstract When the data is processed from the digitized drawThis paper presents how the recently presented Randomized IIough Transform (RHT) method can be used as a part of an engin...