পদ্ধতির তুলনা করুন

	কমিউনিটি ডিটেকশন	গ্রাফ অ্যাটেনশন নেটওয়ার্ক
ক্ষেত্র	নেটওয়ার্ক বিশ্লেষণ	গভীর শিখন
পরিবার	Process / pipeline	Machine learning
উদ্ভবের বছর	2002–2019 (algorithm family)	2018
প্রবর্তক	Louvain: Blondel et al. (2008); Leiden: Traag et al. (2019); Girvan-Newman: Girvan & Newman (2002); Infomap: Rosvall & Bergstrom (2008)	Veličković, P. et al.
ধরন	Graph-partitioning / clustering algorithm family	Graph neural network (attention-based)
মৌলিক উৎস	Blondel, V.D., Guillaume, J.-L., Lambiotte, R. & Lefebvre, E. (2008). Fast Unfolding of Communities in Large Networks. Journal of Statistical Mechanics, 2008(10), P10008.	Veličković, P. et al. (2018). Graph Attention Networks. ICLR.
অপর নাম	graph clustering, network partitioning, Topluluk Tespiti (Louvain, Girvan-Newman, Leiden)	Graf Dikkat Ağı (GAT), GAT, graph attention network, attention-based graph neural network
সম্পর্কিত	5	4
সারসংক্ষেপ	Community detection is a family of graph-partitioning algorithms that discover densely connected sub-groups — communities — within a network. First formalised through the modularity measure by Girvan and Newman (2002), the field advanced rapidly with the Louvain method (Blondel et al., 2008), the Leiden refinement (Traag et al., 2019), and the information-theoretic Infomap approach. All variants answer the same question: which nodes cluster together more tightly among themselves than with the rest of the network?	The Graph Attention Network (GAT), introduced by Veličković and colleagues in 2018, is a graph neural network variant that learns how much importance to assign to each neighbouring node through a self-attention mechanism. On heterogeneous neighbourhoods and relational classification it produces results superior to graph convolutional networks (GCN).