Sciweavers

1538 search results - page 8 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
APVIS
2007
13 years 9 months ago
A comparison of vertex ordering algorithms for large graph visualization
In this study, we examine the use of graph ordering algorithms for visual analysis of data sets using visual similarity matrices. Visual similarity matrices display the relationsh...
Christopher Mueller, Benjamin Martin, Andrew Lumsd...
ECML
2006
Springer
13 years 9 months ago
B-Matching for Spectral Clustering
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
Tony Jebara, Vlad Shchogolev
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
14 years 8 months ago
Co-clustering documents and words using bipartite spectral graph partitioning
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
Inderjit S. Dhillon
WEA
2009
Springer
104views Algorithms» more  WEA 2009»
14 years 7 days ago
Empirical Evaluation of Graph Partitioning Using Spectral Embeddings and Flow
We present initial results from the first empirical evaluation of a graph partitioning algorithm inspired by the Arora-Rao-Vazirani algorithm of [5], which combines spectral and ...
Kevin J. Lang, Michael W. Mahoney, Lorenzo Orecchi...
FLAIRS
2008
13 years 10 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...