5107 search results - page 810 / 1022 » Data Mining and Information Retrieval |
166
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
164
click to vote
SDM
2004
SIAM
15 years 8 months ago
2004
SIAM
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
228
click to vote
SDM
2012
SIAM
13 years 9 months ago
2012
SIAM
Matrix factorization (MF) has been demonstrated to be one of the most competitive techniques for collaborative filtering. However, state-of-the-art MFs do not consider contextual...
184
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
Nowadays the Web represents a growing collection of an enormous amount of contents where the need for better ways to find and organize the available data is becoming a fundamental...
195
click to vote
WSDM
2009
ACM
16 years 1 months ago
2009
ACM
The Web is a dynamic, ever changing collection of information. This paper explores changes in Web content by analyzing a crawl of 55,000 Web pages, selected to represent different...