Sciweavers

4972 search results - page 263 / 995
» Ranking on graph data
Sort
View
SODA
2003
ACM
139views Algorithms» more  SODA 2003»
15 years 8 months ago
Compact representations of separable graphs
We consider the problem of representing graphs compactly while supporting queries efficiently. In particular we describe a data structure for representing n-vertex unlabeled graph...
Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
16 years 2 days ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han
FLAIRS
2008
15 years 9 months ago
Incorporating Latent Semantic Indexing into Spectral Graph Transducer for Text Classification
Spectral Graph Transducer(SGT) is one of the superior graph-based transductive learning methods for classification. As for the Spectral Graph Transducer algorithm, a good graph re...
Xinyu Dai, Baoming Tian, Junsheng Zhou, Jiajun Che...
GG
2008
Springer
15 years 7 months ago
Workshop on Graph Computation Models
A variety of computation models have been developed using graphs and graph transformations. These include models for sequential, distributed, parallel or mobile computation. A grap...
Mohamed Mosbah, Annegret Habel
CORR
2010
Springer
131views Education» more  CORR 2010»
15 years 6 months ago
A PAC-Bayesian Analysis of Graph Clustering and Pairwise Clustering
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...
Yevgeny Seldin