An ultra-fast modularity-based graph clustering algorithm (2009)
- Authors:
- Autor USP: LOPES, ALNEU DE ANDRADE - ICMC
- Unidade: ICMC
- Assunto: INTELIGÊNCIA ARTIFICIAL
- Language: Inglês
- Imprenta:
- ISBN: 9789729689543
- Source:
- Conference titles: Portuguese Conference on Artificial Intelligence - EPIA
-
ABNT
ALMEIDA, Leonardo Jesus e LOPES, Alneu de Andrade. An ultra-fast modularity-based graph clustering algorithm. 2009, Anais.. Braga: APPIA, 2009. . Acesso em: 14 fev. 2026. -
APA
Almeida, L. J., & Lopes, A. de A. (2009). An ultra-fast modularity-based graph clustering algorithm. In New trends in artificial intelligence : proceedings. Braga: APPIA. -
NLM
Almeida LJ, Lopes A de A. An ultra-fast modularity-based graph clustering algorithm. New trends in artificial intelligence : proceedings. 2009 ;[citado 2026 fev. 14 ] -
Vancouver
Almeida LJ, Lopes A de A. An ultra-fast modularity-based graph clustering algorithm. New trends in artificial intelligence : proceedings. 2009 ;[citado 2026 fev. 14 ] - A multi-view approach for semi-supervised scientific paper classification
- Exploiting behaviors of communities of twitter users for link prediction
- An adaptive graph-based K-nearest neighbor
- Causation generalization through the identification of equivalent nodes in causal sparse graphs constructed from text using node similarity strategies
- Reconstructing pedestrian trajectories from partial observations in the urban context
- Network construction and applications for semi-supervised learning
- Optimizing the class information divergence for transductive classification of texts using propagation in bipartite graphs
- Exploiting social and mobility patterns for friendship prediction in location-based social networks
- Trajectory network assessment based on analysis of stay points cluster
- The impact of network sampling on relational classification
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
