{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T07:51:26Z","timestamp":1770277886473,"version":"3.49.0"},"reference-count":39,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T00:00:00Z","timestamp":1534723200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2019,4,11]]},"abstract":"<jats:p>\n                    A graph is a network that can represent the communication between a variety of data elements. The data can have uncertainty, primarily due to the heterogeneity of data sources. Moreover, it is sometimes difficult to assure the existence of a link between data elements; compelling to consider the data as a probabilistic entity. Extracting densely connected regions from a graph is a key task of the intelligent systems. The enumeration of dense substructures in a graph can help to identify important patterns. This can have many applications in medical image processing, accident analysis, and surveillance, to name a few. One such dense substructure is a clique, where all nodes are directly connected to each other. An\n                    <jats:italic>\u03b1<\/jats:italic>\n                    -maximal clique in an uncertain graph is a clique with a minimum probability\n                    <jats:italic>\u03b1<\/jats:italic>\n                    , such that it is not a subset of any other clique of the same weight. Extracting all\n                    <jats:italic>\u03b1<\/jats:italic>\n                    -maximal cliques is an NP-Complete problem. This work focuses on reducing the time consumed to enumerate all\n                    <jats:italic>\u03b1<\/jats:italic>\n                    -maximal cliques in a graph. Another focus of this work is to reduce the CPU (Central Processing Unit) cycles for efficient enumeration of all\n                    <jats:italic>\u03b1<\/jats:italic>\n                    -maximal cliques. An algorithm is proposed that computes all weighted maximal cliques in an uncertain graph. The worst-case asymptotic time complexity of the algorithm is\n                    <jats:italic>\n                      O(n2\n                      <jats:sup>\n                        <jats:italic>n<\/jats:italic>\n                      <\/jats:sup>\n                      )\n                    <\/jats:italic>\n                    . The proposed algorithm utilizes the\n                    <jats:italic>h<\/jats:italic>\n                    -index concept to form cliques with vertex degree greater than\n                    <jats:italic>h<\/jats:italic>\n                    . The algorithm builds cliques at two levels of enumeration. The first level finds the\n                    <jats:italic>\u03b1<\/jats:italic>\n                    -maximal cliques with a descending order in sizes. On each successive\n                    <jats:italic>\u03b1<\/jats:italic>\n                    -maximal clique iteration of the first level, the second level tracks and deletes all subsets of the clique. The second level is to ensure the fact that all subsets of an\n                    <jats:italic>\u03b1<\/jats:italic>\n                    -maximal clique are cliques. The proposed algorithm is compared with two recent maximal clique enumeration algorithms, namely: MULE (Maximal Uncertain Clique Enumeration) and LMC (Listing all maximal cliques in large sparse real-world graphs). Real-world benchmark uncertain graphs are utilized for the experimental evaluation. The results suggest better performance of the proposed approach in terms of the time consumption.\n                  <\/jats:p>","DOI":"10.3233\/jifs-18263","type":"journal-article","created":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T15:55:02Z","timestamp":1534866902000},"page":"3129-3141","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":6,"title":["A top down approach to enumerate\n                    <i>\u03b1<\/i>\n                    -maximal cliques in uncertain graphs"],"prefix":"10.1177","volume":"36","author":[{"given":"Ahmar","family":"Rashid","sequence":"first","affiliation":[{"name":"Faculty of Computer Science and Engineering, Ghulam Ishaq Khan Institute of Engineering Sciences and Technology, Topi, Pakistan"}]},{"given":"Muhammad","family":"Kamran","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Khwaja Fareed University of Engineering and Information Technology, Rahim Yar Khan, Pakistan"}]},{"given":"Zahid","family":"Halim","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science and Engineering, Ghulam Ishaq Khan Institute of Engineering Sciences and Technology, Topi, Pakistan"}]}],"member":"179","published-online":{"date-parts":[[2018,8,20]]},"reference":[{"key":"e_1_3_1_2_2","first-page":"243","article-title":"Mining maximal cliques from an uncertain graph","volume":"2015","author":"Mukherjee A.P.","unstructured":"A.P.Mukherjee, P.Xu, and S.Tirthapura, Mining maximal cliques from an uncertain graph, In 2015 IEEE 31st International Conference on Data Engineering, 2015, pp. 243\u2013254.","journal-title":"In 2015 IEEE 31st International Conference on Data Engineering"},{"key":"e_1_3_1_3_2","first-page":"45","article-title":"A distributed algorithm to enumerate all maximal cliques in MapReduce","volume":"2009","author":"Wu B.","unstructured":"B.Wu, S.Yang, H.Zhao and B.Wang, A distributed algorithm to enumerate all maximal cliques in MapReduce, In Frontier of Computer Science and Technology, 2009, pp. 45\u201351.","journal-title":"In Frontier of Computer Science and Technology"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.12.024"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)90121-X"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.12.1198"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/11823728_42"},{"issue":"1","key":"e_1_3_1_10_2","first-page":"11","volume":"145","author":"Alexe G.","year":"2004","unstructured":"G.Alexe, S.Alexe, Y.Crama, S.Foldes, P.L.Hammer and B.Simeone, Consensus algorithms for the generation of all maximal bicliques, Discrete Applied Mathematics145(1) (2004), 11\u201321.","journal-title":"Consensus algorithms for the generation of all maximal bicliques, Discrete Applied Mathematics"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190660"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"key":"e_1_3_1_13_2","first-page":"1320","article-title":"dmaximalcliques: A distributed algorithm for enumerating all maximal cliques and maximal clique distribution","volume":"2010","author":"Lu L.","unstructured":"L.Lu, Y.Gu and R.Grossman, dmaximalcliques: A distributed algorithm for enumerating all maximal cliques and maximal clique distribution, In IEEE International Conference on Data Mining Workshops (ICDMW), 2010, pp. 1320\u20131327.","journal-title":"In IEEE International Conference on Data Mining Workshops (ICDMW)"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2009.01.003"},{"key":"e_1_3_1_15_2","first-page":"320","article-title":"A parallel algorithm for enumerating all maximal cliques in a complex network","volume":"2006","author":"Du N.","unstructured":"N.Du, B.Wu, L.Xu, B.Wang and X.Pei, A parallel algorithm for enumerating all maximal cliques in a complex network, In ICDM Data Mining Workshops, 2006, pp. 320\u2013324.","journal-title":"In ICDM Data Mining Workshops"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.orgel.2012.03.007"},{"key":"e_1_3_1_17_2","first-page":"403","article-title":"Propagation of trust and distrust","volume":"2004","author":"Guha R.","unstructured":"R.Guha, R.Kumar, P.Raghavan and A.Tomkins, Propagation of trust and distrust, In Proceedings of the 13th International Conference on World Wide Web, 2004, pp. 403\u2013412.","journal-title":"In Proceedings of the 13th International Conference on World Wide Web"},{"key":"e_1_3_1_18_2","first-page":"651","volume":"131","author":"Peeters R.","year":"2003","unstructured":"R.Peeters, The maximum edge biclique problem is np-complete, Discrete Applied Mathematics131 (2003), 651\u2013654.","journal-title":"The maximum edge biclique problem is np-complete, Discrete Applied Mathematics"},{"issue":"3","key":"e_1_3_1_19_2","first-page":"105","article-title":"Parallel mining of the major maximal bicliques using order preserving generators","volume":"8","author":"Nataraj R.V.","year":"2009","unstructured":"R.V.Nataraj and S.Selvan, Parallel mining of the major maximal bicliques using order preserving generators, International Journal of Computing8(3) (2009), 105\u2013113.","journal-title":"International Journal of Computing"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1137\/0206036"},{"key":"e_1_3_1_21_2","first-page":"1","author":"Blasius T.","year":"2017","unstructured":"T.Blasius, T.Friedrich and A.Krohmer, Cliques in hyperbolic random graphs, Algorithmica (2017), 1\u201321.","journal-title":"Cliques in hyperbolic random graphs, Algorithmica"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2017.11.002"},{"key":"e_1_3_1_23_2","article-title":"Lcm ver.2: Efficient mining algorithms for frequent\/closed\/maximal itemsets","author":"Uno T.","unstructured":"T.Uno, M.Kiyomi and H.Arimura, Lcm ver.2: Efficient mining algorithms for frequent\/closed\/maximal itemsets, In IEEE International Conference Data Mining Workshop Frequent ItensetMiing Implementations, 2004.","journal-title":"In IEEE International Conference Data Mining Workshop Frequent ItensetMiing Implementations"},{"key":"e_1_3_1_24_2","first-page":"303","article-title":"A survey of algorithms for dense subgraph discovery","volume":"40","author":"Lee V.","year":"2010","unstructured":"V.Lee, N.Ruan, R.Jin and C.Aggarwal, A survey of algorithms for dense subgraph discovery, In Managing and Mining Graph Data40 (2010), 303\u2013336.","journal-title":"In Managing and Mining Graph Data"},{"key":"e_1_3_1_25_2","first-page":"1","article-title":"Climate change and tourism: A scientometric analysis using Cite Space","author":"Fang Y.","year":"2017","unstructured":"Y.Fang, J.Yin and B.Wu, Climate change and tourism: A scientometric analysis using Cite Space, Journal of Sustain-able Tourism (2017), 1\u201319.","journal-title":"Journal of Sustain-able Tourism"},{"key":"e_1_3_1_26_2","first-page":"12","article-title":"Genome scale computational approaches to memory-intensive applications in systems biology","volume":"2005","author":"Zhang Y.","unstructured":"Y.Zhang, F.Abu-Khzam, N.Baldwin, E.Chesler, M.Langston and N.Samatova, Genome scale computational approaches to memory-intensive applications in systems biology, Proceedings of the ACM\/IEEE SC 2005 Conference, 2005, pp. 12\u201312.","journal-title":"Proceedings of the ACM\/IEEE SC 2005 Conference"},{"key":"e_1_3_1_27_2","first-page":"473","article-title":"On finding bicliques in bipartite graphs: A novel algorithm with application to the integration of diverse biological data types","author":"Zhang Y.","year":"2008","unstructured":"Y.Zhang, E.J.Chesler and M.A.Langston, On finding bicliques in bipartite graphs: A novel algorithm with application to the integration of diverse biological data types, Hawaii International Conference on System Sciences, 2008, pp. 473.","journal-title":"Hawaii International Conference on System Sciences"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.04.043"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2017.07.013"},{"key":"e_1_3_1_30_2","first-page":"649","article-title":"Finding top-k maximal cliques in an uncertain graph.","volume":"2010","author":"Zou Z.","unstructured":"Z.Zou, J.Li, H.Gao and S.Zhang, Finding top-k maximal cliques in an uncertain graph.In IEEE 26th International Conference on Data Engineering (ICDE), 2010, pp. 649\u2013652.","journal-title":"In IEEE 26th International Conference on Data Engineering (ICDE)"},{"key":"e_1_3_1_31_2","first-page":"1","volume":"2018","author":"Halim Z.","unstructured":"Z.Halim and Uzma, Optimizing the minimum spanning tree-based extracted clusters using evolution strategy, Cluster Computing, 2018, pp. 1\u201315.","journal-title":"Optimizing the minimum spanning tree-based extracted clusters using evolution strategy, Cluster Computing"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-017-0455-0"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.2197\/ipsjjip.25.667"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.12.006"},{"key":"e_1_3_1_35_2","first-page":"1","article-title":"On Maximal Cliques with Connectivity Constraints in Directed Graphs","volume":"92","author":"Conte A.","year":"2017","unstructured":"A.Conte, M.M.Kante, T.Uno and K.Wasa, On Maximal Cliques with Connectivity Constraints in Directed Graphs. In LIPIcs-Leibniz International Proceedings in Informatics, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 92, 2017, pp. 1\u201313.","journal-title":"In LIPIcs-Leibniz International Proceedings in Informatics, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik"},{"issue":"1","key":"e_1_3_1_36_2","first-page":"197","article-title":"A note on \"Regular bipolar fuzzy graphs\"","volume":"21","author":"Ghorai G.","year":"2012","unstructured":"G.Ghorai and M.Pal, A note on \"Regular bipolar fuzzy graphs\", Neural Computing and Applications21(1)(2012) 197\u2013205. Neural Computing and Applications, 2016, pp. 1\u20134.","journal-title":"Neural Computing and Applications"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1186\/s40064-016-3783-z"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-16433"},{"key":"e_1_3_1_39_2","first-page":"1","article-title":"Genus value of m-polar fuzzy graphs","author":"Mandal S.","year":"2018","unstructured":"S.Mandal, S.Sahoo, G.Ghorai and M.Pal, Genus value of m-polar fuzzy graphs, Journal of Intelligent & Fuzzy Systems (2018), 1\u201311.","journal-title":"Journal of Intelligent & Fuzzy Systems"},{"key":"e_1_3_1_40_2","first-page":"1","article-title":"Density-based clustering of big probabilistic graphs","author":"Halim Z.","year":"2018","unstructured":"Z.Halim and J.H.Khattak, Density-based clustering of big probabilistic graphs, Evolving Systems (2018), 1\u201318.","journal-title":"Evolving Systems"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-18263","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-18263","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-18263","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T18:54:58Z","timestamp":1770231298000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-18263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,20]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,4,11]]}},"alternative-id":["10.3233\/JIFS-18263"],"URL":"https:\/\/doi.org\/10.3233\/jifs-18263","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,20]]}}}