Network unfolding map by vertex-edge dynamics modeling (2018)
- Authors:
- Autor USP: LIANG, ZHAO - FFCLRP
- Unidade: FFCLRP
- DOI: 10.1109/TNNLS.2016.2626341
- Subjects: REDES NEURAIS; REDES COMPLEXAS; SISTEMAS DINÂMICOS
- Keywords: Complex networks; Nonlinerar dynamical systems; Particle competition; Semisupervised learning (SSL)
- Language: Inglês
- Imprenta:
- Publisher place: Piscataway
- Date published: 2018
- Source:
- Título: IEEE Transactions on Neural Networks and Learning Systems
- ISSN: 2162-237X
- Volume/Número/Paginação/Ano: v. 29, n. 2, p. 405-418, 2018
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
VERRI, Filipe Alves Neto e URIO, Paulo Roberto e LIANG, Zhao. Network unfolding map by vertex-edge dynamics modeling. IEEE Transactions on Neural Networks and Learning Systems, v. 29, n. 2, p. 405-418, 2018Tradução . . Disponível em: https://doi.org/10.1109/TNNLS.2016.2626341. Acesso em: 25 jan. 2026. -
APA
Verri, F. A. N., Urio, P. R., & Liang, Z. (2018). Network unfolding map by vertex-edge dynamics modeling. IEEE Transactions on Neural Networks and Learning Systems, 29( 2), 405-418. doi:10.1109/TNNLS.2016.2626341 -
NLM
Verri FAN, Urio PR, Liang Z. Network unfolding map by vertex-edge dynamics modeling [Internet]. IEEE Transactions on Neural Networks and Learning Systems. 2018 ; 29( 2): 405-418.[citado 2026 jan. 25 ] Available from: https://doi.org/10.1109/TNNLS.2016.2626341 -
Vancouver
Verri FAN, Urio PR, Liang Z. Network unfolding map by vertex-edge dynamics modeling [Internet]. IEEE Transactions on Neural Networks and Learning Systems. 2018 ; 29( 2): 405-418.[citado 2026 jan. 25 ] Available from: https://doi.org/10.1109/TNNLS.2016.2626341 - Fractal color image compression
- Network-based stochastic semisupervised learning
- Imputation of missing data supported by complete p-partite attribute-based decision graphs
- K-associated optimal network for graph embedding dimensionality reduction
- Chaotic synchronization for scene segmentation
- Musical scales recognition via deterministic walk in a graph
- Phase-noise-induced resonance in arrays of coupled excitable neural models
- Uncovering overlapping structures via stochastic competitive learning
- Selecting nodes with inhomogeneous centrality profile for labeling for network-based semi-supervised learning
- A scheme for high level data classification using random walk and network measures
Informações sobre o DOI: 10.1109/TNNLS.2016.2626341 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
