878 search results - page 61 / 176 » Modeling Relational Data as Graphs for Mining |
183
click to vote
SDM
2012
SIAM
13 years 7 months ago
2012
SIAM
We propose a new matrix completion algorithm— Kernelized Probabilistic Matrix Factorization (KPMF), which effectively incorporates external side information into the matrix fac...
143
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Long-term search history contains rich information about a user's search preferences. In this paper, we study statistical language modeling based methods to mine contextual i...
150
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
131
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant connected component), and unweighted. Here we study numer...
142
click to vote
SDM
2008
SIAM
15 years 6 months ago
2008
SIAM
Multiple view data, which have multiple representations from different feature spaces or graph spaces, arise in various data mining applications such as information retrieval, bio...