Sciweavers

377 search results - page 16 / 76
» Assessing Data Mining Results on Matrices with Randomization
Sort
View
ICDM
2003
IEEE
142views Data Mining» more  ICDM 2003»
14 years 1 months ago
Privacy-Preserving Collaborative Filtering Using Randomized Perturbation Techniques
Collaborative Filtering (CF) techniques are becoming increasingly popular with the evolution of the Internet. E-commerce sites use CF systems to suggest products to customers base...
Huseyin Polat, Wenliang Du
WWW
2005
ACM
14 years 9 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
SDM
2009
SIAM
215views Data Mining» more  SDM 2009»
14 years 5 months ago
Hybrid Clustering of Text Mining and Bibliometrics Applied to Journal Sets.
To obtain correlated and complementary information contained in text mining and bibliometrics, hybrid clustering to incorporate textual content and citation information has become...
Bart De Moor, Frizo A. L. Janssens, Shi Yu, Wolfga...
ICDM
2009
IEEE
168views Data Mining» more  ICDM 2009»
14 years 3 months ago
Bi-relational Network Analysis Using a Fast Random Walk with Restart
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
Jing Xia, Doina Caragea, William H. Hsu
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
14 years 2 months ago
Recommendation via Query Centered Random Walk on K-Partite Graph
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...
Haibin Cheng, Pang-Ning Tan, Jon Sticklen, William...