{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T14:35:00Z","timestamp":1759588500211,"version":"3.41.0"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2008,8,1]],"date-time":"2008-08-01T00:00:00Z","timestamp":1217548800000},"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. Database Syst."],"published-print":{"date-parts":[[2008,8]]},"abstract":"<jats:p>\n            We study mining correlations from quantitative databases and show that this is a more effective approach than mining associations to discover useful patterns. We propose the novel notion of\n            <jats:italic>quantitative correlated pattern<\/jats:italic>\n            (QCP), which is founded on two formal concepts, mutual information and all-confidence. We first devise a normalization on mutual information and apply it to the problem of QCP mining to capture the dependency between the attributes. We further adopt all-confidence as a quality measure to ensure, at a finer granularity, the dependency between the attributes with specific quantitative intervals. We also propose an effective supervised method that combines the consecutive intervals of the quantitative attributes based on mutual information, such that the interval-combining is guided by the dependency between the attributes. We develop an algorithm,\n            <jats:italic>QCoMine<\/jats:italic>\n            , to mine QCPs efficiently by utilizing normalized mutual information and all-confidence to perform bilevel pruning. We also identify the redundancy existing in the set of QCPs and propose effective techniques to eliminate the redundancy. Our extensive experiments on both real and synthetic datasets verify the efficiency of\n            <jats:italic>QCoMine<\/jats:italic>\n            and the quality of the QCPs. The experimental results also justify the effectiveness of our proposed techniques for redundancy elimination. To further demonstrate the usefulness and the quality of QCPs, we study an application of QCPs to classification. We demonstrate that the classifier built on the QCPs achieves higher classification accuracy than the state-of-the-art classifiers built on association rules.\n          <\/jats:p>","DOI":"10.1145\/1386118.1386120","type":"journal-article","created":{"date-parts":[[2008,9,4]],"date-time":"2008-09-04T12:51:35Z","timestamp":1220532695000},"page":"1-45","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Correlated pattern mining in quantitative databases"],"prefix":"10.1145","volume":"33","author":[{"given":"Yiping","family":"Ke","sequence":"first","affiliation":[{"name":"The Hong Kong University of Science and Technology, Kowloon, Hong Kong"}]},{"given":"James","family":"Cheng","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology, Kowloon, Hong Kong"}]},{"given":"Wilfred","family":"Ng","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology, Kowloon, Hong Kong"}]}],"member":"320","published-online":{"date-parts":[[2008,9,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.250074"},{"key":"e_1_2_1_3_1","unstructured":"Asuncion A. and Newman D. 2007. UCI machine learning repository. University of California Irvine CA. http:\/\/www.uci.edu-mlearn\/MLRepository.html.  Asuncion A. and Newman D. 2007. UCI machine learning repository. University of California Irvine CA. http:\/\/www.uci.edu-mlearn\/MLRepository.html."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022812808206"},{"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\/312129.312217"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/PDCAT.2005.192"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1534"},{"key":"e_1_2_1_9_1","unstructured":"Cormen T. H. Leiserson C. E. Rivest R. L. and Stein C. 2001. Introduction to Algorithms. The MIT Press Cambridge MA.   Cormen T. H. Leiserson C. E. Rivest R. L. and Stein C. 2001. Introduction to Algorithms. The MIT Press Cambridge MA."},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Cover T. M. and Thomas J. A. 1991. Elements of Information Theory. Wiley New York NY.   Cover T. M. and Thomas J. A. 1991. Elements of Information Theory. Wiley New York NY.","DOI":"10.1002\/0471200611"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/383891.383893"},{"volume-title":"Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing (RSFDGrC'99)","author":"Hu K.","key":"e_1_2_1_12_1"},{"key":"e_1_2_1_13_1","unstructured":"IBM Quest. IBM Quest synthetic data generation code for classification. http:\/\/www.almaden.ibm.com\/cs\/projects\/iis\/hdb\/Projects\/data_mining\/mining.shtml.  IBM Quest. IBM Quest synthetic data generation code for classification. http:\/\/www.almaden.ibm.com\/cs\/projects\/iis\/hdb\/Projects\/data_mining\/mining.shtml."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.94"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150430"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281236"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0104-4"},{"volume-title":"Proceedings of the 8th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining (PAKDD'04)","author":"Kim W.-Y.","key":"e_1_2_1_18_1"},{"volume-title":"Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM'03)","author":"Lee Y.-K.","key":"e_1_2_1_19_1"},{"volume-title":"Proceedings of the IEEE International Conference on Data Mining (ICDM'01)","author":"Li W.","key":"e_1_2_1_20_1"},{"volume-title":"Proceedings of the IEEE International Conference on Data Mining (ICDM'01)","author":"Ma S.","key":"e_1_2_1_21_1"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.908981"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30549-1_47"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1161582"},{"key":"e_1_2_1_25_1","unstructured":"Pearson K.\n     1904.\n      \n  \n   \n  On the theory of contingency and its relation to association and normal correlation. Drapers' Company Research Memoirs Biometric Series I\n  .  Pearson K. 1904. On the theory of contingency and its relation to association and normal correlation. Drapers' Company Research Memoirs Biometric Series I."},{"volume-title":"Knowledge Discovery in Databases","author":"Piatetsky-Shapiro G.","key":"e_1_2_1_26_1"},{"key":"e_1_2_1_27_1","unstructured":"Quinlan J. R. 1993. C4.5: Programs for Machine Learning. Morgan Kaufmann.   Quinlan J. R. 1993. C4.5: Programs for Machine Learning. Morgan Kaufmann."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.979971"},{"volume-title":"Proceedings of the 4th IEEE International Conference on Data Mining (ICDM'04)","author":"Ruckert U.","key":"e_1_2_1_29_1"},{"key":"e_1_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Shannon C. 1948. A mathematical theory of communication. Bell System Technical J. (Parts i and ii) 379--423 623--656.  Shannon C. 1948. A mathematical theory of communication. Bell System Technical J. (Parts i and ii) 379--423 623--656.","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233311"},{"key":"e_1_2_1_32_1","unstructured":"Strehl A. 2002. Relationship-based clustering and cluster ensembles for high-dimensional data mining. Ph.D. dissertation The University of Texas at Austin.   Strehl A. 2002. Relationship-based clustering and cluster ensembles for high-dimensional data mining. Ph.D. dissertation The University of Texas at Austin."},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Studholme C. Hawkes D. and Hill D. 1999. An overlap invariant entropy measure of 3d medical image alignment. Patt. Recog. 71--86.  Studholme C. Hawkes D. and Hill D. 1999. An overlap invariant entropy measure of 3d medical image alignment. Patt. Recog. 71--86.","DOI":"10.1016\/S0031-3203(98)00091-0"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775053"},{"volume-title":"Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'98)","author":"Wang K.","key":"e_1_2_1_35_1"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502569"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.68"},{"volume-title":"Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM'03)","author":"Xiong H.","key":"e_1_2_1_38_1"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-006-0043-9"},{"volume-title":"Proceedings of the 3rd SIAM International Conference on Data Mining (SDM'03)","author":"Yin X.","key":"e_1_2_1_40_1"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956788"},{"volume-title":"Proceedings of the 2nd SIAM International Conference on Data Mining (SDM'02)","author":"Zaki M. J.","key":"e_1_2_1_42_1"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014094"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183640"}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1386118.1386120","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1386118.1386120","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:47Z","timestamp":1750255067000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1386118.1386120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["10.1145\/1386118.1386120"],"URL":"https:\/\/doi.org\/10.1145\/1386118.1386120","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"type":"print","value":"0362-5915"},{"type":"electronic","value":"1557-4644"}],"subject":[],"published":{"date-parts":[[2008,8]]},"assertion":[{"value":"2007-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-09-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}