Sciweavers

261 search results - page 23 / 53
» Mining Web Graphs for Recommendations
Sort
View
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
14 years 8 months ago
Web usage mining based on probabilistic latent semantic analysis
The primary goal of Web usage mining is the discovery of patterns in the navigational behavior of Web users. Standard approaches, such as clustering of user sessions and discoveri...
Xin Jin, Yanzan Zhou, Bamshad Mobasher
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
14 years 8 months ago
Fast discovery of connection subgraphs
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
Christos Faloutsos, Kevin S. McCurley, Andrew Tomk...
ICIW
2009
IEEE
13 years 5 months ago
Using Propagation of Distrust to Find Untrustworthy Web Neighborhoods
Web spamming, the practice of introducing artificial text and links into web pages to affect the results of searches, has been recognized as a major problem for search engines. Bu...
Panagiotis Takis Metaxas
KDD
2009
ACM
237views Data Mining» more  KDD 2009»
14 years 8 months ago
Exploring social tagging graph for web object classification
This paper studies web object classification problem with the novel exploration of social tags. Automatically classifying web objects into manageable semantic categories has long ...
Zhijun Yin, Rui Li, Qiaozhu Mei, Jiawei Han
WWW
2010
ACM
14 years 2 months ago
Factorizing personalized Markov chains for next-basket recommendation
Recommender systems are an important component of many websites. Two of the most popular approaches are based on matrix factorization (MF) and Markov chains (MC). MF methods learn...
Steffen Rendle, Christoph Freudenthaler, Lars Schm...