পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| নির্দেশিত সম্প্রদায় সনাক্তকরণ× | মডিউলারিটি বিশ্লেষণ× | |
|---|---|---|
| ক্ষেত্র | নেটওয়ার্ক বিশ্লেষণ | নেটওয়ার্ক বিশ্লেষণ |
| পরিবার | Machine learning | Machine learning |
| উদ্ভবের বছর≠ | 2008 | 2004 |
| প্রবর্তক≠ | Leicht, E. A. & Newman, M. E. J.; Rosvall, M. & Bergstrom, C. T. | Newman, M. E. J. & Girvan, M. |
| ধরন≠ | Graph partitioning / modularity optimization | Community detection / graph partitioning |
| মৌলিক উৎস≠ | Leicht, E. A. & Newman, M. E. J. (2008). Community structure in directed networks. Physical Review Letters, 100(11), 118703. DOI ↗ | Newman, M. E. J., & Girvan, M. (2004). Finding and evaluating community structure in networks. Physical Review E, 69(2), 026113. DOI ↗ |
| অপর নাম | directed graph clustering, community detection in digraphs, directed modularity optimization, directed network partitioning | Q-modularity, community structure detection, network modularity optimization, graph partitioning by modularity |
| সম্পর্কিত≠ | 6 | 5 |
| সারসংক্ষেপ≠ | Directed community detection identifies densely interconnected groups of nodes in a directed network, accounting for the asymmetry of edges (e.g., A follows B does not imply B follows A). Adapting modularity or flow-based criteria to directed graphs reveals clusters that undirected methods systematically miss, making it essential for citation networks, follower graphs, and biological regulatory pathways. | Modularity analysis is a network science method, formalized by Newman and Girvan in 2004, that detects community structure in graphs by measuring whether edges are more concentrated within groups than expected by chance. Its scalar quality index Q guides algorithms that partition nodes into cohesive clusters, making it the most widely adopted framework for community detection in social, biological, and technological networks. |
| ScholarGateডেটাসেট ↗ |
|
|