{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:32:59Z","timestamp":1760239979609,"version":"build-2065373602"},"reference-count":45,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2019,2,12]],"date-time":"2019-02-12T00:00:00Z","timestamp":1549929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>Network structures, consisting of nodes and edges, have applications in almost all subjects. A set of nodes is called a community if the nodes have strong interrelations. Industries (including cell phone carriers and online social media companies) need community structures to allocate network resources and provide proper and accurate services. However, most detection algorithms are derived independently, which is arduous and even unnecessary. Although recent research shows that a general detection method that serves all purposes does not exist, we believe that there is some general procedure of deriving detection algorithms. In this paper, we represent such a general scheme. We mainly focus on two types of networks: transmission networks and similarity networks. We reduce them to a unified graph model, based on which we propose a method to define and detect community structures. Finally, we also give a demonstration to show how our design scheme works.<\/jats:p>","DOI":"10.3390\/fi11020041","type":"journal-article","created":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T02:49:44Z","timestamp":1550026184000},"page":"41","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Scheme to Design Community Detection Algorithms in Various Networks"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0933-2370","authenticated-orcid":false,"given":"Haoye","family":"Lu","sequence":"first","affiliation":[{"name":"School of Electrical Engineering and Computer Science, University of Ottawa, Ottawa, ON K1N 6N5, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4605-0500","authenticated-orcid":false,"given":"Amiya","family":"Nayak","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Computer Science, University of Ottawa, Ottawa, ON K1N 6N5, Canada"}]}],"member":"1968","published-online":{"date-parts":[[2019,2,12]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","article-title":"Community detection in graphs","volume":"486","author":"Fortunato","year":"2010","journal-title":"Phys. Rep."},{"key":"ref_2","first-page":"1082","article-title":"Communities in networks","volume":"56","author":"Porter","year":"2009","journal-title":"Not. Am. Math. Soc."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1038\/nphys2162","article-title":"Communities, modules and large-scale structure in networks","volume":"8","author":"Newman","year":"2012","journal-title":"Nat. Phys."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An Efficient Heuristic Procedure for Partitioning Graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell Syst. Tech. J."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Hastie, T., Tibshirani, R., and Friedman, J. (2009). The Elements of Statistical Learning, Springer. [2nd ed.].","DOI":"10.1007\/978-0-387-84858-7"},{"key":"ref_6","first-page":"158","article-title":"A direct approach to graph clustering","volume":"4","author":"Hlaoui","year":"2004","journal-title":"Neural Netw. Comput. Intell."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Rattigan, M.J., Maier, M., and Jensen, D. (2007, January 20\u201324). Graph Clustering with Network Structure Indices. Proceedings of the 24th International Conference on Machine Learning, Corvallis, OR, USA.","DOI":"10.1145\/1273496.1273595"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Barnes, E.R. (1982, January 16\u201318). An Algorithm for Partitioning the Nodes of a Graph. Proceedings of the 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes, San Diego, CA, USA.","DOI":"10.1109\/CDC.1981.269534"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","article-title":"A Tutorial on Spectral Clustering","volume":"17","author":"Luxburg","year":"2007","journal-title":"Stat. Comput."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3211872","article-title":"Local Spectral Clustering for Overlapping Community Detection","volume":"12","author":"Li","year":"2018","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"5982","DOI":"10.1038\/s41598-018-23932-z","article-title":"Community Detection in Complex Networks via Clique Conductance","volume":"8","author":"Lu","year":"2018","journal-title":"Sci. Rep."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","article-title":"Fast algorithm for detecting community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Phys. Rev. E"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/TCSS.2014.2307458","article-title":"Community Detection via Maximization of Modularity and Its Variants","volume":"1","author":"Chen","year":"2014","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Kaur, M., and Mahajan, A. (2016). Community Detection in Complex Networks: A Novel Approach Based on Ant Lion Optimizer. Proceedings of the International Conference on Soft Computing for Problem Solving, Springer.","DOI":"10.1007\/978-981-10-3322-3_3"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"218701","DOI":"10.1103\/PhysRevLett.93.218701","article-title":"Detecting Fuzzy Community Structures in Complex Networks with a Potts Model","volume":"93","author":"Reichardt","year":"2004","journal-title":"Phys. Rev. Lett."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Wan, C., Peng, S., Wang, C., and Yuan, Y. (2016, January 13\u201316). Communities Detection Algorithm Based on General Stochastic Block Model in Mobile Social Networks. Proceedings of the 2016 International Conference on Advanced Cloud and Big Data (CBD), Chengdu, China.","DOI":"10.1109\/CBD.2016.040"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"21068","DOI":"10.1073\/pnas.0907096106","article-title":"A nonparametric view of network models and Newman-Girvan and other modularities","volume":"106","author":"Bickel","year":"2009","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_18","unstructured":"Airoldi, E.M., Blei, D.M., Fienberg, S.E., and Xing, E.P. (2008, January 8\u201310). Mixed Membership Stochastic Blockmodels. Proceedings of the International Conference on Neural Information Processing Systems (NIPS), Vancouver, BC, Canada."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"3234","DOI":"10.1109\/TSP.2017.2691667","article-title":"The \u03b2-Model\u2013Maximum Likelihood, Cramer\u2013Rao Bounds, and Hypothesis Testing","volume":"65","author":"Wahlstrom","year":"2017","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1126\/science.298.5594.824","article-title":"Network Motifs: Simple Building Blocks of Complex Networks","volume":"298","author":"Milo","year":"2002","journal-title":"Science"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"4547","DOI":"10.1038\/srep04547","article-title":"Revealing the Hidden Language of Complex Networks","volume":"4","author":"Davis","year":"2014","journal-title":"Sci. Rep."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1126\/science.aad9029","article-title":"Higher-order organization of complex networks","volume":"353","author":"Benson","year":"2016","journal-title":"Science"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/TCYB.2017.2772880","article-title":"Dynamic Cluster Formation Game for Attributed Graph Clustering","volume":"49","author":"Bu","year":"2019","journal-title":"IEEE Trans. Cybern."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"052315","DOI":"10.1103\/PhysRevE.94.052315","article-title":"Equivalence between modularity optimization and maximum likelihood methods for community detection","volume":"94","author":"Newman","year":"2016","journal-title":"Phys. Rev. E"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"2349","DOI":"10.1109\/TKDE.2016.2563425","article-title":"Fast and Accurate Mining the Community Structure: Integrating Center Locating and Membership Optimization","volume":"28","author":"Li","year":"2016","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.chaos.2018.02.009","article-title":"Evolving the attribute flow for dynamical clustering in signed networks","volume":"110","author":"Li","year":"2018","journal-title":"Chaos Solitons Fractals"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1109\/TETCI.2018.2829906","article-title":"Enhance the Performance of Network Computation by a Tunable Weighting Strategy","volume":"2","author":"Li","year":"2018","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"e1602548","DOI":"10.1126\/sciadv.1602548","article-title":"The ground truth about metadata and community detection in networks","volume":"3","author":"Peel","year":"2017","journal-title":"Sci. Adv."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"7794","DOI":"10.1073\/pnas.0407994102","article-title":"The worldwide air transportation network: Anomalous centrality, community structure, and cities\u2019 global roles","volume":"102","author":"Guimera","year":"2005","journal-title":"PNAS"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"2283","DOI":"10.1093\/bioinformatics\/btl370","article-title":"Detecting Functional Modules in the Yeast Protein\u2013protein Interaction Network","volume":"22","author":"Chen","year":"2006","journal-title":"Bioinformatics"},{"key":"ref_31","unstructured":"Scholkopf, B., Platt, J., and Hofmann, T. (2007, January 3\u20136). Fundamental Limitations of Spectral Clustering. Proceedings of the International Conference on Neural Information Processing Systems (NIPS), Vancouver, BC, Canada."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"012801","DOI":"10.1103\/PhysRevE.91.012801","article-title":"Social significance of community structure: Statistical view","volume":"91","author":"Li","year":"2015","journal-title":"Phys. Rev. E"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","article-title":"Finding All Cliques of an Undirected Graph","volume":"16","author":"Bron","year":"1973","journal-title":"Commun. ACM"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Eppstein, D., L\u00f6ffler, M., and Strash, D. (2010). Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time. Algorithms and Computation, Springer.","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","article-title":"An information flow model for conflict and fission in small groups","volume":"33","author":"Zachary","year":"1977","journal-title":"J. Anthropol. Res."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01164627","article-title":"Resistance distance","volume":"12","author":"Klein","year":"1993","journal-title":"J. Math. Chem."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","article-title":"Benchmark graphs for testing community detection algorithms","volume":"78","author":"Lancichinetti","year":"2008","journal-title":"Phys. Rev. E"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"176","DOI":"10.2307\/3617889","article-title":"Generalised Inverses as Linear Transformations","volume":"63","author":"Wong","year":"1979","journal-title":"Math. Gaz."},{"key":"ref_39","unstructured":"Yang, T., Jin, R., Chi, Y., and Zhu, S. (July, January 28). Combining link and content for community detection: A discriminative approach. Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"103018","DOI":"10.1088\/1367-2630\/12\/10\/103018","article-title":"Finding overlapping communities in networks by label propagation","volume":"12","author":"Gregory","year":"2010","journal-title":"New J. Phys."},{"key":"ref_41","unstructured":"Baumes, J., Goldberg, M.K., Krishnamoorthy, M., Magdon-Ismail, M., and Preston, N. (2005, January 22\u201325). Finding communities by clustering a graph into overlapping subgraphs. Proceedings of the IADIS International Conference on Applied Computing, Algarve, Portugal."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1093\/bioinformatics\/btl039","article-title":"CFinder: Locating Cliques and Overlapping Modules in Biological Networks","volume":"22","author":"Adamcsek","year":"2006","journal-title":"Bioinformatics"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1038\/nature09182","article-title":"Link communities reveal multiscale complexity in networks","volume":"466","author":"Ahn","year":"2010","journal-title":"Nature"},{"key":"ref_44","unstructured":"Lee, C., Reid, F., McDaid, A.F., and Hurley, N.J. (2010, January 25\u201328). Detecting highly overlapping community structure by greedy clique expansion. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA."},{"key":"ref_45","first-page":"25","article-title":"Towards Linear Time Overlapping Community Detection in Social Networks","volume":"7302","author":"Xie","year":"2012","journal-title":"Adv. Knowl. Discov. Data Min."}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/11\/2\/41\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:31:23Z","timestamp":1760185883000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/11\/2\/41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,12]]},"references-count":45,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2019,2]]}},"alternative-id":["fi11020041"],"URL":"https:\/\/doi.org\/10.3390\/fi11020041","relation":{},"ISSN":["1999-5903"],"issn-type":[{"type":"electronic","value":"1999-5903"}],"subject":[],"published":{"date-parts":[[2019,2,12]]}}}