Sciweavers

4972 search results - page 558 / 995
» Ranking on graph data
Sort
View
PKDD
2010
Springer
155views Data Mining» more  PKDD 2010»
15 years 5 months ago
Latent Structure Pattern Mining
Pattern mining methods for graph data have largely been restricted to ground features, such as frequent or correlated subgraphs. Kazius et al. have demonstrated the use of elaborat...
Andreas Maunz, Christoph Helma, Tobias Cramer, Ste...
181
Voted
MICCAI
2004
Springer
16 years 7 months ago
Clustering Fiber Traces Using Normalized Cuts
In this paper we present a framework for unsupervised segmentation of white matter fiber traces obtained from diffusion weighted MRI data. Fiber traces are compared pairwise to cre...
Anders Brun, Hans Knutsson, Hae-Jeong Park, Martha...
204
Voted
ICML
2004
IEEE
16 years 7 months ago
Kernel conditional random fields: representation and clique selection
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
John D. Lafferty, Xiaojin Zhu, Yan Liu
166
Voted
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
16 years 4 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld
174
Voted
ICDM
2009
IEEE
162views Data Mining» more  ICDM 2009»
16 years 1 months ago
Accurate Estimation of the Degree Distribution of Private Networks
—We describe an efficient algorithm for releasing a provably private estimate of the degree distribution of a network. The algorithm satisfies a rigorous property of differenti...
Michael Hay, Chao Li, Gerome Miklau, David Jensen