Sciweavers

779 search results - page 4 / 156
» Spectral Generative Models for Graphs
Sort
View
BMCBI
2006
202views more  BMCBI 2006»
13 years 7 months ago
Spectral embedding finds meaningful (relevant) structure in image and microarray data
Background: Accurate methods for extraction of meaningful patterns in high dimensional data have become increasingly important with the recent generation of data types containing ...
Brandon W. Higgs, Jennifer W. Weller, Jeffrey L. S...
IPPS
2000
IEEE
13 years 11 months ago
A Multilevel Algorithm for Spectral Partitioning with Extended Eigen-Models
Parallel solution of irregular problems require solving the graph partitioning problem. The extended eigenproblem appears as the solution of some relaxed formulations of the graph ...
Suely Oliveira, Takako Soma
WAW
2010
Springer
312views Algorithms» more  WAW 2010»
13 years 5 months ago
The Geometric Protean Model for On-Line Social Networks
We introduce a new geometric, rank-based model for the link structure of on-line social networks (OSNs). In the geo-protean (GEO-P) model for OSNs nodes are identified with points ...
Anthony Bonato, Jeannette Janssen, Pawel Pralat
FCT
2005
Springer
14 years 26 days ago
Reconstructing Many Partitions Using Spectral Techniques
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...
Joachim Giesen, Dieter Mitsche
ICPR
2008
IEEE
14 years 8 months ago
Impulse noise removal by spectral clustering and regularization on graphs
In this paper we present a method for impulse noise removal that makes use of spectral clustering and graph regularization. The image is modeled as a graph and local spectral anal...
Olivier Lezoray, Vinh-Thong Ta, Abderrahim Elmoata...