{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:40:29Z","timestamp":1750308029266,"version":"3.41.0"},"reference-count":35,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T00:00:00Z","timestamp":1196467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2007,12]]},"abstract":"<jats:p>Using frequent patterns to analyze data has been one of the fundamental approaches in many data mining applications. Research in frequent pattern mining has so far mostly focused on developing efficient algorithms to discover various kinds of frequent patterns, but little attention has been paid to the important next step\u2014interpreting the discovered frequent patterns. Although the compression and summarization of frequent patterns has been studied in some recent work, the proposed techniques there can only annotate a frequent pattern with nonsemantical information (e.g., support), which provides only limited help for a user to understand the patterns.<\/jats:p>\n          <jats:p>In this article, we study the novel problem of generating semantic annotations for frequent patterns. The goal is to discover the hidden meanings of a frequent pattern by annotating it with in-depth, concise, and structured information. We propose a general approach to generate such an annotation for a frequent pattern by constructing its context model, selecting informative context indicators, and extracting representative transactions and semantically similar patterns. This general approach can well incorporate the user's prior knowledge, and has potentially many applications, such as generating a dictionary-like description for a pattern, finding synonym patterns, discovering semantic relations, and summarizing semantic classes of a set of frequent patterns. Experiments on different datasets show that our approach is effective in generating semantic pattern annotations.<\/jats:p>","DOI":"10.1145\/1297332.1297335","type":"journal-article","created":{"date-parts":[[2007,12,7]],"date-time":"2007-12-07T19:19:01Z","timestamp":1197055141000},"page":"11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Semantic annotation of frequent patterns"],"prefix":"10.1145","volume":"1","author":[{"given":"Qiaozhu","family":"Mei","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong","family":"Xin","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Cheng","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiawei","family":"Han","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengxiang","family":"Zhai","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014057"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"volume-title":"Proceedings of the 11th International Conference on Data Engineering, 3--14","author":"Agrawal R.","key":"e_1_2_1_3_1","unstructured":"Agrawal , R. and Srikant , R . 1995. Mining sequential patterns . In Proceedings of the 11th International Conference on Data Engineering, 3--14 . Agrawal, R. and Srikant, R. 1995. Mining sequential patterns. In Proceedings of the 11th International Conference on Data Engineering, 3--14."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276313"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253327"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/89086.89095"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Cover T. M. and Thomas J. A. 1991. Elements of Information Theory. Wiley.   Cover T. M. and Thomas J. A. 1991. Elements of Information Theory. Wiley.","DOI":"10.1002\/0471200611"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Croft W. B. and Lafferty J. 2003. Language Modeling for Information Retrieval. Kluwer.   Croft W. B. and Lafferty J. 2003. Language Modeling for Information Retrieval. Kluwer.","DOI":"10.1007\/978-94-017-0171-6"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9"},{"volume-title":"Proceedings of the International Conference on Information and Data Management (ICDM), 35","author":"Deshpande M.","key":"e_1_2_1_11_1","unstructured":"Deshpande , M. , Kuramochi , M. , and Karypis , G . 2003. Frequent sub-structure-based approaches for classifying chemical compounds . In Proceedings of the International Conference on Information and Data Management (ICDM), 35 . Deshpande, M., Kuramochi, M., and Karypis, G. 2003. Frequent sub-structure-based approaches for classifying chemical compounds. In Proceedings of the International Conference on Information and Data Management (ICDM), 35."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502526"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008992.1009004"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150424"},{"volume-title":"FIMI'03 Workshop on Frequent Itemset Mining Implementations.","author":"Grahne G.","key":"e_1_2_1_15_1","unstructured":"Grahne , G. and Zhu , J . 2003. Efficiently using prefix-trees in mining frequent itemsets . In FIMI'03 Workshop on Frequent Itemset Mining Implementations. Grahne, G. and Zhu, J. 2003. Efficiently using prefix-trees in mining frequent itemsets. In FIMI'03 Workshop on Frequent Itemset Mining Implementations."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"volume-title":"Proceedings of the IEEE International Conference on Data Mining (ICDM).","author":"Han J.","key":"e_1_2_1_17_1","unstructured":"Han , J. , Wang , J. , Lu , Y. , and Tzvetkov , P . 2002. Mining top-k frequent closed patterns without minimum support . In Proceedings of the IEEE International Conference on Data Mining (ICDM). Han, J., Wang, J., Lu, Y., and Tzvetkov, P. 2002. Mining top-k frequent closed patterns without minimum support. In Proceedings of the IEEE International Conference on Data Mining (ICDM)."},{"key":"e_1_2_1_18_1","first-page":"223C","article-title":"Nouvelles recherches sur la distribution florale","volume":"44","author":"Jaccard P.","year":"1908","unstructured":"Jaccard , P. 1908 . Nouvelles recherches sur la distribution florale . Bull. Soc. Vaudoise Sci. Nat. 44 , 223C - 2270 . Jaccard, P. 1908. Nouvelles recherches sur la distribution florale. Bull. Soc. Vaudoise Sci. Nat. 44, 223C-270.","journal-title":"Bull. Soc. Vaudoise Sci. Nat."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009902609570"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/160688.160718"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502558"},{"volume-title":"Proceedings of the Pacific Symposium on Biocomputing, 40--51","author":"Ling X.","key":"e_1_2_1_24_1","unstructured":"Ling , X. , Jiang , J. , He , X. , Mei , Q. , Zhai , C. , and Schatz , B . 2006. Automatically generating gene summaries from biomedical literature . In Proceedings of the Pacific Symposium on Biocomputing, 40--51 . Ling, X., Jiang, J., He, X., Mei, Q., Zhai, C., and Schatz, B. 2006. Automatically generating gene summaries from biomedical literature. In Proceedings of the Pacific Symposium on Biocomputing, 40--51."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775138"},{"volume-title":"Proceeding of the 7th International Conference on Database Theory, 398--416","author":"Pasquier N.","key":"e_1_2_1_26_1","unstructured":"Pasquier , N. , Bastide , Y. , Taouil , R. , and Lakhal , L . 1999. Discovering frequent closed itemsets for association rules . In Proceeding of the 7th International Conference on Database Theory, 398--416 . Pasquier, N., Bastide, Y., Taouil, R., and Lakhal, L. 1999. Discovering frequent closed itemsets for association rules. In Proceeding of the 7th International Conference on Database Theory, 398--416."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/361219.361220"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.2165\/00822942-200403020-00006"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/321796.321811"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/319950.320054"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5006-x"},{"volume-title":"Proceedings of VLDB International Conference on Very Large Databases, 709--720","author":"Xin D.","key":"e_1_2_1_32_1","unstructured":"Xin , D. , Han , J. , Yan , X. , and Cheng , H . 2005. Mining compressed frequent-pattern sets . In Proceedings of VLDB International Conference on Very Large Databases, 709--720 . Xin, D., Han, J., Yan, X., and Cheng, H. 2005. Mining compressed frequent-pattern sets. In Proceedings of VLDB International Conference on Very Large Databases, 709--720."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081907"},{"volume-title":"Proceedings of the IEEE International Conference on Data Mining (ICDM), 721--724","author":"Yan X.","key":"e_1_2_1_34_1","unstructured":"Yan , X. and Han , J . 2002. gspan: Graph-Based substructure pattern mining . In Proceedings of the IEEE International Conference on Data Mining (ICDM), 721--724 . Yan, X. and Han, J. 2002. gspan: Graph-Based substructure pattern mining. In Proceedings of the IEEE International Conference on Data Mining (ICDM), 721--724."},{"volume-title":"Proceedings of the 3rd SIAM International Conference on Data Mining (SDM), 166--177","author":"Yan X.","key":"e_1_2_1_35_1","unstructured":"Yan , X. , Han , J. , and Afshar , R . 2003. Clospan: Mining closed sequential patterns in large datasets . In Proceedings of the 3rd SIAM International Conference on Data Mining (SDM), 166--177 . Yan, X., Han, J., and Afshar, R. 2003. Clospan: Mining closed sequential patterns in large datasets. In Proceedings of the 3rd SIAM International Conference on Data Mining (SDM), 166--177."}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1297332.1297335","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1297332.1297335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:14:02Z","timestamp":1750259642000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1297332.1297335"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["10.1145\/1297332.1297335"],"URL":"https:\/\/doi.org\/10.1145\/1297332.1297335","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2007,12]]},"assertion":[{"value":"2007-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}