{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T01:21:47Z","timestamp":1772846507588,"version":"3.50.1"},"reference-count":40,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T00:00:00Z","timestamp":1697414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ICT Division, Government of the People\u2019s Republic of Bangladesh"},{"name":"Centennial Research Grant, University of Dhaka"},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100010318","name":"University of Manitoba","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100010318","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2024,1,31]]},"abstract":"<jats:p>A hypergraph is a complex data structure capable of expressing associations among any number of data entities. Overcoming the limitations of traditional graphs, hypergraphs are useful to model real-life problems. Frequent pattern mining is one of the most popular problems in data mining with a lot of applications. To the best of our knowledge, there exists no flexible pattern mining framework for hypergraph databases decomposing associations among data entities. In this article, we propose a flexible and complete framework for mining frequent patterns from a collection of hypergraphs. To discover more interesting patterns beyond the traditional frequent patterns, we propose frameworks for weighted and uncertain hypergraph mining also. We develop three algorithms for mining frequent, weighted, and uncertain hypergraph patterns efficiently by introducing a canonical labeling technique for isomorphic hypergraphs. Extensive experiments have been conducted on real-life hypergraph databases to show both the effectiveness and efficiency of our proposed frameworks and algorithms.<\/jats:p>","DOI":"10.1145\/3622940","type":"journal-article","created":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T11:07:51Z","timestamp":1694084871000},"page":"1-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Discovering Interesting Patterns from Hypergraphs"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9543-4503","authenticated-orcid":false,"given":"Md. Tanvir","family":"Alam","sequence":"first","affiliation":[{"name":"University of Dhaka, Bangladesh"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6101-4591","authenticated-orcid":false,"given":"Chowdhury Farhan","family":"Ahmed","sequence":"additional","affiliation":[{"name":"University of Dhaka, Bangladesh"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8212-1938","authenticated-orcid":false,"given":"Md.","family":"Samiullah","sequence":"additional","affiliation":[{"name":"University of Dhaka, Bangladesh"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7541-9127","authenticated-orcid":false,"given":"Carson Kai-Sang","family":"Leung","sequence":"additional","affiliation":[{"name":"University of Manitoba, Canada"}]}],"member":"320","published-online":{"date-parts":[[2023,10,16]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/978-3-030-75765-6_2","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Alam Md. Tanvir","year":"2021","unstructured":"Md. Tanvir Alam, Chowdhury Farhan Ahmed, Md. Samiullah, and Carson K. Leung. 2021. Discriminating frequent pattern based supervised graph embedding for classification. In Advances in Knowledge Discovery and Data Mining. Springer, 16\u201328."},{"key":"e_1_3_1_3_2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-030-75765-6_1","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Alam Md. Tanvir","year":"2021","unstructured":"Md. Tanvir Alam, Chowdhury Farhan Ahmed, Md. Samiullah, and Carson K. Leung. 2021. Mining frequent patterns from hypergraph databases. In Advances in Knowledge Discovery and Data Mining. Springer, 3\u201315."},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-022-03385-8"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICETT.2016.7873705"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/int.22269"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2019.2956387"},{"key":"e_1_3_1_8_2","article-title":"Hypergraph theory","author":"Bretto Alain","year":"2013","unstructured":"Alain Bretto. 2013. Hypergraph theory. An Introduction. Mathematical Engineering. Cham: Springer (2013).","journal-title":"An Introduction. Mathematical Engineering. Cham: Springer"},{"key":"e_1_3_1_9_2","first-page":"1","volume-title":"Graph-Based Representations in Pattern Recognition","author":"Bretto Alain","year":"2005","unstructured":"Alain Bretto and Luc Gillibert. 2005. Hypergraph-based image representation. In Graph-Based Representations in Pattern Recognition. Springer, 1\u201311."},{"key":"e_1_3_1_10_2","unstructured":"Chun Hing Cai Ada Wai-Chee Fu Chun Hung Cheng and Wang Wai Kwong. 1998. Mining association rules with weighted items. In Proceedings of the 1998 International Database Engineering and Applications Symposium (IDEAS\u201998) . IEEE 68\u201377."},{"key":"e_1_3_1_11_2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/978-3-540-71701-0_8","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Chui Chun-Kit","year":"2007","unstructured":"Chun-Kit Chui, Ben Kao, and Edward Hung. 2007. Mining frequent itemsets from uncertain data. In Advances in Knowledge Discovery and Data Mining. Springer, 47\u201358."},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.127"},{"key":"e_1_3_1_13_2","first-page":"1","volume-title":"ACM SIGMOD Record","author":"Han Jiawei","year":"2000","unstructured":"Jiawei Han, Jian Pei, and Yiwen Yin. 2000. Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29, 2 (2000), 1\u201312."},{"key":"e_1_3_1_14_2","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/978-3-540-73847-3_26","volume-title":"Inductive Logic Programming","author":"Horv\u00e1th Tam\u00e1s","year":"2007","unstructured":"Tam\u00e1s Horv\u00e1th, Bj\u00f6rn Bringmann, and Luc De Raedt. 2007. Frequent hypergraph mining. In Inductive Logic Programming. Springer, 244\u2013259."},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/974614.974655"},{"key":"e_1_3_1_16_2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"Inokuchi Akihiro","year":"2000","unstructured":"Akihiro Inokuchi, Takashi Washio, and Hiroshi Motoda. 2000. An apriori-based algorithm for mining frequent substructures from graph data. In Principles of Data Mining and Knowledge Discovery. Springer, 13\u201323."},{"key":"e_1_3_1_17_2","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1007\/978-3-319-93040-4_52","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Islam Md. Ashraful","year":"2018","unstructured":"Md. Ashraful Islam, Chowdhury Farhan Ahmed, Carson K. Leung, and Calvin S. H. Hoi. 2018. WFSM-MaxPWS: An efficient approach for mining weighted frequent subgraphs from edge-weighted graph databases. In Advances in Knowledge Discovery and Data Mining. Springer, 664\u2013676."},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15105-7_7"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/1460797.1460799"},{"key":"e_1_3_1_20_2","first-page":"1","volume-title":"Algorithms and Models for the Web-Graph","author":"Joslyn Cliff A.","year":"2020","unstructured":"Cliff A. Joslyn, Sinan Aksoy, Dustin Arendt, Jesun Firoz, Louis Jenkins, Brenda Praggastis, Emilie Purvine, and Marcin Zalewski. 2020. Hypergraph analytics of domain name system relationships. In Algorithms and Models for the Web-Graph. Springer, 1\u201315."},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth919"},{"key":"e_1_3_1_22_2","unstructured":"Michihiro Kuramochi and George Karypis. 2001. Frequent subgraph discovery. In Proceedings of the 2001 IEEE International Conference on Data Mining . 313\u2013320."},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108134"},{"key":"e_1_3_1_24_2","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1007\/978-3-540-68125-0_61","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Leung Carson K.","year":"2008","unstructured":"Carson K. Leung, Mark Anthony F. Mateo, and Dale A. Brajczuk. 2008. A tree-based approach for frequent pattern mining from uncertain data. In Advances in Knowledge Discovery and Data Mining. Springer, 653\u2013661."},{"key":"e_1_3_1_25_2","doi-asserted-by":"crossref","unstructured":"Carson K. Leung and Syed Khairuzzaman Tanbeer. 2013. PUF-tree: A compact tree structure for frequent pattern mining of uncertain data. In Advances in Knowledge Discovery and Data Mining . Springer 13\u201325.","DOI":"10.1007\/978-3-642-37453-1_2"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.113087"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442590"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975321.35"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/1951365.1951408"},{"key":"e_1_3_1_30_2","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1109\/ICDE.2001.914830","volume-title":"Proceedings of the 17th International Conference on Data Engineering","author":"Pei Jian","year":"2001","unstructured":"Jian Pei, Jiawei Han, B. Mortazavi-Asl, H. Pinto, Qiming Chen, U. Dayal, and Mei-Chun Hsu. 2001. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In Proceedings of the 17th International Conference on Data Engineering. IEEE, 215\u2013224."},{"key":"e_1_3_1_31_2","doi-asserted-by":"crossref","unstructured":"Fran\u00e7ois Rousseau Emmanouil Kiagias and Michalis Vazirgiannis. 2015. Text categorization as a graph classification problem. In Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (ACL-IJCNLP\u201915). 1702\u20131712.","DOI":"10.3115\/v1\/P15-1164"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2009.12"},{"key":"e_1_3_1_33_2","first-page":"1","volume-title":"Advances in Database Technology (EDBT\u201996)","author":"Srikant Ramakrishnan","year":"1996","unstructured":"Ramakrishnan Srikant and Rakesh Agrawal. 1996. Mining sequential patterns: Generalizations and performance improvements. In Advances in Database Technology (EDBT\u201996). Springer, 1\u201317."},{"key":"e_1_3_1_34_2","unstructured":"Ramakrishnan Srikant Quoc Vu and Rakesh Agrawal. 1997. Mining association rules with item constraints. In Proceedings of the Third International Conference on Knowledge Discovery and Data Mining . AAAI Press 67\u201373."},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1402008"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/1839490.1839491"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014088"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/3494567"},{"key":"e_1_3_1_39_2","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/ICDM.2002.1184038","volume-title":"Proceedings of the 2002 IEEE International Conference on Data Mining, 2002.","author":"Yan Xifeng","year":"2002","unstructured":"Xifeng Yan and Jiawei Han. 2002. gSpan: Graph-based substructure pattern mining. In Proceedings of the 2002 IEEE International Conference on Data Mining, 2002.721\u2013724."},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.124"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646028"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3622940","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3622940","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:57:28Z","timestamp":1750298248000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3622940"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,16]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1,31]]}},"alternative-id":["10.1145\/3622940"],"URL":"https:\/\/doi.org\/10.1145\/3622940","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,16]]},"assertion":[{"value":"2022-08-09","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-08-17","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-10-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}