Sciweavers

30 search results - page 6 / 6
» Learning spectral graph transformations for link prediction
Sort
View
NIPS
2008
13 years 6 months ago
Regularized Co-Clustering with Dual Supervision
By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive perf...
Vikas Sindhwani, Jianying Hu, Aleksandra Mojsilovi...
KDD
2009
ACM
179views Data Mining» more  KDD 2009»
13 years 11 months ago
Identifying graphs from noisy and incomplete data
There is a growing wealth of data describing networks of various types, including social networks, physical networks such as transportation or communication networks, and biologic...
Galileo Mark S. Namata Jr., Lise Getoor
SAC
2009
ACM
13 years 11 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad
RECSYS
2009
ACM
13 years 11 months ago
Recommending new movies: even a few ratings are more valuable than metadata
In the Netflix Prize competition many new collaborative filtering (CF) approaches emerged, which are excellent in optimizing the RMSE of the predictions. Matrix factorization (M...
István Pilászy, Domonkos Tikk
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 5 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori