Buscar
Mostrando ítems 1-10 de 97
Improved analysis of a max-cut algorithm based on spectral partitioning
(SIAM, 2015)
Trevisan [SIAM J. Comput., 41 (2012), pp. 1769-1786] presented an algorithm for Max-Cut based on spectral partitioning techniques. This is the first algorithm for Max-Cut with an approximation guarantee strictly larger ...
Agrupamento de sequências de miRNA utilizando aprendizado não-supervisionado baseado em grafos
(Universidade Federal de São CarlosUFSCarPrograma de Pós-Graduação em Ciência da Computação - PPGCCCâmpus São Carlos, 2016-08-12)
Cluster analysis is the organization of a collection of patterns into clusters based on similarity
which is determined by using properties of data. Clustering techniques can be useful in a
variety of knowledge domains ...
A spectral clustering algorithm for manufacturing cell formation
(PERGAMON-ELSEVIER SCIENCE LTD, 2009)
A graph clustering algorithm constructs groups of closely related parts and machines separately. After they are matched for the least intercell moves, a refining process runs on the initial cell formation to decrease the ...
Exploração do comportamento de um algoritmo combinatório para o particionamento de grafos núcleo-periferia
(Universidade Tecnológica Federal do ParanáCuritibaBrasilBacharelado em Sistemas de InformaçãoUTFPR, 2018-06-15)
Most real life large-scale networks present a topological structure that can be partitioned into two substructures, the Core and the Periphery. When such a partitioning is achieved, an analysis of the behaviour of the core ...
Algorithmic advances for the adjacency spectral embedding
(IEEE, 2022)
The Random Dot Product Graph (RDPG) is a popular generative graph model for relational data. RDPGs postulate there exist latent positions for each node, and specifies the edge formation probabilities via the inner product ...
Teoria Espectral de Grafos aplicada ao problema de Isomorfismo de Grafos
(Universidade Federal do Espírito SantoBRCiência da ComputaçãoPrograma de Pós-Graduação em InformáticaUFES, 2010-08-23)
In this work we investigated the use of concepts from Spectral Graph Theory (SGT) to support the construction of algorithms that solve the Graph Isomorphism Problem (GIP). Three theoretical results which consider information ...
Um algoritmo eficiente para estimar os momentos espectrais de grafos grandes não dirigidos com pesos
(Universidade Tecnológica Federal do ParanáCornelio ProcopioBrasilPrograma de Pós-Graduação em InformáticaUTFPR, 2020-08-13)
A graph is a collection of vertexes and edges, each one connecting two vertexes. We can use the spectral moments to characterize the topology of the graph. The algorithms that calculate the spectral moments have a cubic-order ...