A divide-and-link algorithm for hierarchical clustering in networks
From MaRDI portal
Publication:1749837
DOI10.1016/j.ins.2015.04.011zbMath1390.68528DBLPjournals/isci/GomezZYM15OpenAlexW2085399970WikidataQ57618639 ScholiaQ57618639MaRDI QIDQ1749837
Javier Yáñez, Javier Montero, Edwin Zarrazola, Daniel Gómez
Publication date: 17 May 2018
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2015.04.011
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Social networks; opinion dynamics (91D30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (3)
A new modularity measure for fuzzy community detection problems based on overlap and grouping functions ⋮ A network embedding-enhanced Bayesian model for generalized community detection in complex networks ⋮ A Methodology for Hierarchical Image Segmentation Evaluation
Cites Work
- Unnamed Item
- Communicability graph and community structures in complex networks
- A coloring fuzzy graph approach for image classification
- Fuzzy classification systems.
- Personalized PageRank clustering: a graph clustering algorithm based on random walks
- Modeling centrality measures in social network analysis using bi-criteria network flow optimization problems
- Maximizing modularity intensity for community partition and evolution
- On the relevance of some families of fuzzy sets
- Multiple criteria districting problemsthe public transportation network pricing system of the Paris region
- Revealing network communities with a nonlinear programming method
- Improvements to Remote Sensing Using Fuzzy Classification, Graphs and Accuracy Statistics
- Community structure in social and biological networks
- Fast unfolding of communities in large networks
- Machine Learning: ECML 2004
This page was built for publication: A divide-and-link algorithm for hierarchical clustering in networks
