Sciweavers

1538 search results - page 20 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
FCS
2009
13 years 5 months ago
Spectral Analysis of Attractors in Random Boolean Network Models
Circuits and loops in graph systems can be used to model the attractors in gene-regulatory networks. The number of such attractors grows very rapidly with network size and even fo...
Kenneth A. Hawick
NIPS
2004
13 years 9 months ago
Hierarchical Eigensolver for Transition Matrices in Spectral Methods
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
Chakra Chennubhotla, Allan D. Jepson
DATESO
2010
148views Database» more  DATESO 2010»
13 years 5 months ago
Using Spectral Clustering for Finding Students' Patterns of Behavior in Social Networks
Abstract. The high dimensionality of the data generated by social networks has been a big challenge for researchers. In order to solve the problems associated with this phenomenon,...
Gamila Obadi, Pavla Drázdilová, Jan ...
SDM
2009
SIAM
123views Data Mining» more  SDM 2009»
14 years 5 months ago
Randomization Techniques for Graphs.
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
Gemma C. Garriga, Kai Puolamäki, Sami Hanhij&...
ICIP
2007
IEEE
14 years 2 months ago
Classification by Cheeger Constant Regularization
This paper develops a classification algorithm in the framework of spectral graph theory where the underlying manifold of a high dimensional data set is described by a graph. The...
Hsun-Hsien Chang, José M. F. Moura