2227 search results - page 148 / 446 » Graph Mining based on a Data Partitioning Approach |
113
Voted
KDD
2006
ACM
16 years 1 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.)...
148
click to vote
SDM
2012
SIAM
13 years 3 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...
124
Voted
ICDM
2009
IEEE
14 years 10 months ago
2009
IEEE
Text classification poses some specific challenges. One such challenge is its high dimensionality where each document (data point) contains only a small subset of them. In this pap...
124
click to vote
KDD
1997
ACM
15 years 5 months ago
1997
ACM
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
104
Voted
KDD
2004
ACM
16 years 1 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...