{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:57:03Z","timestamp":1773482223774,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T00:00:00Z","timestamp":1766361600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T00:00:00Z","timestamp":1766361600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002386","name":"Cairo University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002386","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2026,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Community search is currently attracting a lot of attention. The problem of a community search in a node-attributed graph is to locate a meaningful community that satisfies certain query parameters. It has piqued the interest of both industry and academia. Most research on finding communities in graphs focuses on either the link weight or the node attributes. This can be inefficient when you need to find communities that are both weighted and share similar characteristics. To address this, this paper proposes two approaches:\n                    <jats:italic>Bottom-Up and Top-Down<\/jats:italic>\n                    . Both approaches use link weight and node attributes to identify the top-r-weighted and attributed k-core communities, where r denotes the number of top-ranked communities. The\n                    <jats:italic>Bottom-Up approach<\/jats:italic>\n                    utilizes the global search paradigm to find communities, while\n                    <jats:italic>Top-Down method<\/jats:italic>\n                    utilizes a local search to efficiently find the top-weighted and attributed communities. To achieve this efficient local search, the\n                    <jats:italic>Top-Down method<\/jats:italic>\n                    leverages two special indexes:\n                    <jats:italic>a simple index and a matrix-based index<\/jats:italic>\n                    . The study compared all methods with several real-world data sets and found that\n                    <jats:italic>Top-Down method<\/jats:italic>\n                    that leverages\n                    <jats:italic>matrix-based index<\/jats:italic>\n                    was the most effective and efficient.\n                  <\/jats:p>","DOI":"10.1007\/s41060-025-00944-3","type":"journal-article","created":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T08:26:59Z","timestamp":1766392019000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Discovering weighted and attributed communities from social graphs"],"prefix":"10.1007","volume":"21","author":[{"given":"Zeinab A.","family":"Fareed","sequence":"first","affiliation":[]},{"given":"Wafaa M. A.","family":"Habib","sequence":"additional","affiliation":[]},{"given":"Neamat","family":"ElTazi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,22]]},"reference":[{"key":"944_CR1","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00778-019-00556-x","volume":"29","author":"Y Fang","year":"2020","unstructured":"Fang, Y., Huang, X., Qin, L., Zhang, Y., Zhang, W., Cheng, R., Lin, X.: A survey of community search over big graphs. VLDB J. 29, 353\u2013392 (2020)","journal-title":"VLDB J."},{"key":"944_CR2","doi-asserted-by":"crossref","unstructured":"Li, J., Wang, X., Deng, K., Yang, X., Sellis, T., Yu, J.X.: Most influential community search over large social networks. In: 2017 IEEE 33rd International Conference on Data Engineering (ICDE), pp. 871\u2013882. IEEE (2017)","DOI":"10.1109\/ICDE.2017.136"},{"key":"944_CR3","doi-asserted-by":"crossref","unstructured":"Fang, Y., Cheng, C., Luo, S., Hu, J.: Effective community search for large attributed graphs. In: Proceedings of the VLDB Endowment (2016)","DOI":"10.14778\/2994509.2994538"},{"key":"944_CR4","doi-asserted-by":"publisher","first-page":"3613","DOI":"10.1007\/s00521-017-2946-3","volume":"30","author":"Y Zhang","year":"2018","unstructured":"Zhang, Y., Zhang, Y., Chen, Q., Ai, Z., Gong, Z.: True-link clustering through signaling process and subcommunity merge in overlapping community detection. Neural Comput. Appl. 30, 3613\u20133621 (2018)","journal-title":"Neural Comput. Appl."},{"issue":"1","key":"944_CR5","first-page":"36","volume":"4","author":"A Maria Fiscarelli","year":"2020","unstructured":"Maria Fiscarelli, A., Brust, M.R., Danoy, G., Bouvry, P.: A vertex-similarity clustering algorithm for community detection. J. Inf. Telecommun. 4(1), 36\u201350 (2020)","journal-title":"J. Inf. Telecommun."},{"key":"944_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.ins.2019.10.076","volume":"513","author":"J Zhu","year":"2020","unstructured":"Zhu, J., Chen, B., Zeng, Y.: Community detection based on modularity and k-plexes. Inf. Sci. 513, 127\u2013142 (2020)","journal-title":"Inf. Sci."},{"key":"944_CR7","doi-asserted-by":"publisher","first-page":"57943","DOI":"10.1109\/ACCESS.2019.2912182","volume":"7","author":"Z Liu","year":"2019","unstructured":"Liu, Z., Xiang, B., Guo, W., Chen, Y., Guo, K., Zheng, J.: Overlapping community detection algorithm based on coarsening and local overlapping modularity. IEEE Access 7, 57943\u201357955 (2019)","journal-title":"IEEE Access"},{"issue":"6","key":"944_CR8","doi-asserted-by":"publisher","first-page":"854","DOI":"10.14778\/3380750.3380756","volume":"13","author":"Y Fang","year":"2020","unstructured":"Fang, Y., Yang, Y., Zhang, W., Lin, X., Cao, X.: Effective and efficient community search over large heterogeneous information networks. Proc. VLDB Endow. 13(6), 854\u2013867 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"944_CR9","doi-asserted-by":"publisher","first-page":"93976","DOI":"10.1109\/ACCESS.2021.3093368","volume":"9","author":"BC Das","year":"2021","unstructured":"Das, B.C., Anwar, M.M., Bhuiyan, M.A.-A., Sarker, I.H., Alyami, S.A., Moni, M.A.: Attribute driven temporal active online community search. IEEE Access 9, 93976\u201393989 (2021)","journal-title":"IEEE Access"},{"issue":"1","key":"944_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1186\/s40537-019-0243-y","volume":"6","author":"S Chobe","year":"2019","unstructured":"Chobe, S., Zhan, J.: Advancing community detection using keyword attribute search. J. Big Data 6(1), 83 (2019)","journal-title":"J. Big Data"},{"key":"944_CR11","doi-asserted-by":"crossref","unstructured":"Guo, F., Yuan, Y., Wang, G., Zhao, X., Sun, H.: Multi-attributed community search in road-social networks. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp. 109\u2013120. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00017"},{"issue":"4","key":"944_CR12","first-page":"1","volume":"1","author":"J Wang","year":"2024","unstructured":"Wang, J., Wang, K., Lin, X., Zhang, W., Zhang, Y.: Neural attributed community search at billion scale. Proc. ACM Manag. Data 1(4), 1\u201325 (2024)","journal-title":"Proc. ACM Manag. Data"},{"issue":"10","key":"944_CR13","doi-asserted-by":"publisher","first-page":"2576","DOI":"10.14778\/3675034.3675048","volume":"17","author":"S Fang","year":"2024","unstructured":"Fang, S., Zhao, K., Rong, Y., Li, Z., Yu, J.X.: Inductive attributed community search: to learn communities across graphs. Proc. VLDB Endow. 17(10), 2576\u20132589 (2024)","journal-title":"Proc. VLDB Endow."},{"key":"944_CR14","doi-asserted-by":"publisher","first-page":"148841","DOI":"10.1109\/ACCESS.2020.3016214","volume":"8","author":"WM Habib","year":"2020","unstructured":"Habib, W.M., Mokhtar, H.M., El-Sharkawi, M.E.: Weight-based k-truss community search via edge attachment. IEEE Access 8, 148841\u2013148852 (2020)","journal-title":"IEEE Access"},{"issue":"1","key":"944_CR15","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1186\/s40537-022-00588-1","volume":"9","author":"WM Habib","year":"2022","unstructured":"Habib, W.M., Mokhtar, H.M., El-Sharkawi, M.E.: Discovering top-weighted k-truss communities in large graphs. J. Big Data 9(1), 36 (2022)","journal-title":"J. Big Data"},{"key":"944_CR16","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.ins.2017.07.012","volume":"417","author":"Z Zheng","year":"2017","unstructured":"Zheng, Z., Ye, F., Li, R.-H., Ling, G., Jin, T.: Finding weighted k-truss communities in large networks. Inf. Sci. 417, 344\u2013360 (2017)","journal-title":"Inf. Sci."},{"issue":"4","key":"944_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2043652.2043654","volume":"36","author":"J Cheng","year":"2011","unstructured":"Cheng, J., Ke, Y., Fu, A.W.-C., Yu, J.X., Zhu, L.: Finding maximal cliques in massive networks. ACM Trans. Database Syst. (TODS) 36(4), 1\u201334 (2011)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"944_CR18","doi-asserted-by":"crossref","unstructured":"Cheng, J., Zhu, L., Ke, Y., Chu, S.: Fast algorithms for maximal clique enumeration with limited memory. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1240\u20131248 (2012)","DOI":"10.1145\/2339530.2339724"},{"key":"944_CR19","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C., Bonchi, F., Gionis, A., Gullo, F., Tsiarli, M.: Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 104\u2013112 (2013)","DOI":"10.1145\/2487575.2487645"},{"key":"944_CR20","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Chu, S., \u00d6zsu, M.T.: Efficient core decomposition in massive networks. In: 2011 IEEE 27th International Conference on Data Engineering, pp. 51\u201362. IEEE (2011)","DOI":"10.1109\/ICDE.2011.5767911"},{"issue":"1","key":"944_CR21","doi-asserted-by":"publisher","first-page":"13","DOI":"10.14778\/2850469.2850471","volume":"9","author":"W Khaouid","year":"2015","unstructured":"Khaouid, W., Barsky, M., Srinivasan, V., Thomo, A.: K-core decomposition of large networks on a single pc. Proc. VLDB Endow. 9(1), 13\u201323 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"944_CR22","doi-asserted-by":"crossref","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: International Workshop on Approximation Algorithms for Combinatorial Optimization, pp. 84\u201395. Springer (2000)","DOI":"10.1007\/3-540-44436-X_10"},{"key":"944_CR23","unstructured":"Goldberg, A.V.: Finding a maximum density subgraph (1984)"},{"key":"944_CR24","doi-asserted-by":"crossref","unstructured":"Chang, L., Yu, J.X., Qin, L., Lin, X., Liu, C., Liang, W.: Efficiently computing k-edge connected components via graph decomposition. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp. 205\u2013216 (2013)","DOI":"10.1145\/2463676.2465323"},{"key":"944_CR25","doi-asserted-by":"crossref","unstructured":"Zhou, R., Liu, C., Yu, J.X., Liang, W., Chen, B., Li, J.: Finding maximal k-edge-connected subgraphs from a large graph. In: Proceedings of the 15th International Conference on Extending Database Technology, pp. 480\u2013491 (2012)","DOI":"10.1145\/2247596.2247652"},{"key":"944_CR26","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.is.2019.03.014","volume":"83","author":"M Alemi","year":"2019","unstructured":"Alemi, M., Haghighi, H.: Ktminer: distributed k-truss detection in big graphs. Inf. Syst. 83, 195\u2013216 (2019)","journal-title":"Inf. Syst."},{"key":"944_CR27","doi-asserted-by":"publisher","first-page":"8493","DOI":"10.1007\/s13369-021-05514-w","volume":"46","author":"MA Midoun","year":"2021","unstructured":"Midoun, M.A., Wang, X., Talhaoui, M.Z.: A jungle community detection algorithm based on new weighted similarity. Arab. J. Sci. Eng. 46, 8493\u20138507 (2021)","journal-title":"Arab. J. Sci. Eng."},{"issue":"10","key":"944_CR28","doi-asserted-by":"publisher","first-page":"9111","DOI":"10.1007\/s12652-020-02608-5","volume":"12","author":"MA Midoun","year":"2021","unstructured":"Midoun, M.A., Wang, X., Talhaoui, M.Z.: A pyramidal community detection algorithm based on a generalization of the clustering coefficient. J. Ambient. Intell. Humaniz. Comput. 12(10), 9111\u20139125 (2021)","journal-title":"J. Ambient. Intell. Humaniz. Comput."},{"issue":"13","key":"944_CR29","doi-asserted-by":"publisher","first-page":"1950166","DOI":"10.1142\/S0217984919501665","volume":"33","author":"MA Midoun","year":"2019","unstructured":"Midoun, M.A., Wang, X.: New magnetic algorithm to detect community structure based on the magnets\u2019 approach. Mod. Phys. Lett. B 33(13), 1950166 (2019)","journal-title":"Mod. Phys. Lett. B"},{"key":"944_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.06.030","volume":"187","author":"X You","year":"2020","unstructured":"You, X., Ma, Y., Liu, Z.: A three-stage algorithm on community detection in social networks. Knowl.-Based Syst. 187, 104822 (2020)","journal-title":"Knowl.-Based Syst."},{"key":"944_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.123633","volume":"545","author":"F Hu","year":"2020","unstructured":"Hu, F., Liu, J., Li, L., Liang, J.: Community detection in complex networks using node2vec with spectral clustering. Phys. A 545, 123633 (2020)","journal-title":"Phys. A"},{"key":"944_CR32","doi-asserted-by":"crossref","unstructured":"Grover, A., Leskovec, J.: node2vec: Scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 855\u2013864 (2016)","DOI":"10.1145\/2939672.2939754"},{"key":"944_CR33","doi-asserted-by":"crossref","unstructured":"Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 1311\u20131322 (2014)","DOI":"10.1145\/2588555.2610495"},{"issue":"5","key":"944_CR34","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1109\/TKDE.2017.2783933","volume":"30","author":"L Yuan","year":"2017","unstructured":"Yuan, L., Qin, L., Zhang, W., Chang, L., Yang, J.: Index-based densest clique percolation community search in networks. IEEE Trans. Knowl. Data Eng. 30(5), 922\u2013935 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"944_CR35","doi-asserted-by":"publisher","first-page":"1406","DOI":"10.1007\/s10618-015-0422-1","volume":"29","author":"N Barbieri","year":"2015","unstructured":"Barbieri, N., Bonchi, F., Galimberti, E., Gullo, F.: Efficient and effective community search. Data Min. Knowl. Disc. 29, 1406\u20131433 (2015)","journal-title":"Data Min. Knowl. Disc."},{"key":"944_CR36","doi-asserted-by":"crossref","unstructured":"Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 939\u2013948 (2010)","DOI":"10.1145\/1835804.1835923"},{"key":"944_CR37","doi-asserted-by":"crossref","unstructured":"Li, R.-H., Qin, L., Ye, F., Yu, J.X., Xiao, X., Xiao, N., Zheng, Z.: Skyline community search in multi-valued networks. In: Proceedings of the 2018 International Conference on Management of Data, pp. 457\u2013472 (2018)","DOI":"10.1145\/3183713.3183736"},{"key":"944_CR38","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/s00778-017-0482-5","volume":"26","author":"Y Fang","year":"2017","unstructured":"Fang, Y., Cheng, R., Chen, Y., Luo, S., Hu, J.: Effective and efficient attributed community search. VLDB J. 26, 803\u2013828 (2017)","journal-title":"VLDB J."},{"key":"944_CR39","doi-asserted-by":"crossref","unstructured":"Chen, L., Liu, C., Zhou, R., Li, J., Yang, X., Wang, B.: Maximum co-located community search in large scale social networks. Proc. VLDB Endow. 11(10), 1233\u20131246 (2018)","DOI":"10.14778\/3231751.3231755"},{"key":"944_CR40","doi-asserted-by":"crossref","unstructured":"Zhu, W., Chen, C., Wang, X., Lin, X.: K-core minimization: An edge manipulation approach. In: Proceedings of the 27th ACM International Conference on Information and Knowledge Management, pp. 1667\u20131670 (2018)","DOI":"10.1145\/3269206.3269254"}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-025-00944-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41060-025-00944-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-025-00944-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:36:18Z","timestamp":1773480978000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41060-025-00944-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,22]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["944"],"URL":"https:\/\/doi.org\/10.1007\/s41060-025-00944-3","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"value":"2364-415X","type":"print"},{"value":"2364-4168","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,22]]},"assertion":[{"value":"29 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"80"}}