{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T01:34:48Z","timestamp":1774316088435,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319058092","type":"print"},{"value":"9783319058108","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-05810-8_23","type":"book-chapter","created":{"date-parts":[[2014,4,16]],"date-time":"2014-04-16T03:31:25Z","timestamp":1397619085000},"page":"342-356","source":"Crossref","is-referenced-by-count":4,"title":["On Mining Proportional Fault-Tolerant Frequent Itemsets"],"prefix":"10.1007","author":[{"given":"Shengxin","family":"Liu","sequence":"first","affiliation":[]},{"given":"Chung Keung","family":"Poon","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications. In: SIGMOD 1998, pp. 94\u2013105 (1998)","DOI":"10.1145\/276305.276314"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. In: SIGMOD 1993, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"23_CR3","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB 1994, pp. 487\u2013499 (1994)"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/11733492_4","volume-title":"Knowledge Discovery in Inductive Databases","author":"J. Besson","year":"2006","unstructured":"Besson, J., Pensa, R.G., Robardet, C., Boulicaut, J.-F.: Constraint-based mining of fault-tolerant patterns from boolean data. In: Bonchi, F., Boulicaut, J.-F. (eds.) KDID 2005. LNCS, vol.\u00a03933, pp. 55\u201371. Springer, Heidelberg (2006)"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Cheng, H., Yu, P.S., Han, J.: Approximate frequent itemset mining in the presence of random noise. In: Soft Computing for Knowledge Discovery and Data Mining, pp. 363\u2013389 (2008)","DOI":"10.1007\/978-0-387-69935-6_15"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Cong, G., Tung, K., Anthony, Xu, X., Pan, F., Yang, J.: FARMER: finding interesting rule groups in microarray datasets. In: SIGMOD 2004, pp. 143\u2013154 (2004)","DOI":"10.1145\/1007568.1007587"},{"issue":"2","key":"23_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1513876.1513879","volume":"3","author":"Y. Dourisboure","year":"2009","unstructured":"Dourisboure, Y., Geraci, F., Pellegrini, M.: Extraction and classification of dense implicit communities in the web graph. ACM Trans. Web 3(2), 7:1\u20137:36 (2009)","journal-title":"ACM Trans. Web"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Gupta, R., Fang, G., Field, B., Steinbach, M., Kumar, V.: Quantitative evaluation of approximate frequent pattern mining algorithms. In: KDD 2008, pp. 301\u2013309 (2008)","DOI":"10.1145\/1401890.1401930"},{"issue":"1","key":"23_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J. Han","year":"2007","unstructured":"Han, J., Cheng, H., Xin, D., Yan, X.: Frequent pattern mining: current status and future directions. Data Mining and Knowledge Discovery\u00a015(1), 55\u201386 (2007)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD 2000, pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/11408079_51","volume-title":"Database Systems for Advanced Applications","author":"J.-L. Koh","year":"2005","unstructured":"Koh, J.-L., Yo, P.-W.: An efficient approach for mining fault-tolerant frequent patterns based on bit vector representations. In: Zhou, L.-z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol.\u00a03453, pp. 568\u2013575. Springer, Heidelberg (2005)"},{"issue":"1","key":"23_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1497577.1497578","volume":"3","author":"H.-P. Kriegel","year":"2009","unstructured":"Kriegel, H.-P., Kr\u00f6ger, P., Zimek, A.: Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering. TKDD 3(1), 1:1\u20131:58 (2009)","journal-title":"TKDD"},{"issue":"4","key":"23_CR13","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10796-009-9158-z","volume":"11","author":"G. Lee","year":"2009","unstructured":"Lee, G., Peng, S.-L., Lin, Y.-T.: Proportional fault-tolerant data mining with applications to bioinformatics. Information Systems Frontiers\u00a011(4), 461\u2013469 (2009)","journal-title":"Information Systems Frontiers"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Liu, J., Paulsen, S., Sun, X., Wang, W., Nobel, A., Prins, J.: Mining approximate frequent itemsets in the presence of noise: algorithm and analysis. In: SDM 2006, pp. 405\u2013416 (2006)","DOI":"10.1137\/1.9781611972764.36"},{"key":"23_CR15","unstructured":"Pei, J., Tung, A.K.H., Han, J.: Fault-tolerant frequent pattern mining: Problems and challenges. In: DMKD 2001, pp. 7\u201312 (2001)"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Poernomo, A.K., Gopalkrishnan, V.: Mining statistical information of frequent fault-tolerant patterns in transactional databases. In: ICDM 2007, pp. 272\u2013281 (2007)","DOI":"10.1109\/ICDM.2007.48"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Poernomo, A.K., Gopalkrishnan, V.: Towards efficient mining of proportional fault-tolerant frequent itemsets. In: KDD 2009, pp. 697\u2013706 (2009)","DOI":"10.1145\/1557019.1557097"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Sepp\u00e4nen, J.K., Mannila, H.: Dense itemsets. In: KDD 2004, pp. 683\u2013688 (2004)","DOI":"10.1145\/1014052.1014140"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Sim, K., Li, J., Gopalkrishnan, V., Liu, G.: Mining maximal quasi-bicliques to co-cluster stocks and financial ratios for value investment. In: ICDM 2006, pp. 1059\u20131063 (2006)","DOI":"10.1109\/ICDM.2006.111"},{"key":"23_CR20","unstructured":"Wang, X., Borgelt, C., Kruse, R.: Fuzzy frequent pattern discovering based on recursive elimination. In: ICMLA 2005, pp. 391\u2013396 (2005)"},{"key":"23_CR21","unstructured":"Wang, S.-S., Lee, S.-Y.: Mining fault-tolerant frequent patterns in large databases. In: International Computer Symposium 2002 (2002)"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Yang, C., Fayyad, U., Bradley, P.S.: Efficient discovery of error-tolerant frequent itemsets in high dimensions. In: KDD 2001, pp. 194\u2013203 (2001)","DOI":"10.1145\/502512.502539"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: KDD 1997, pp. 283\u2013286 (1997)","DOI":"10.1007\/978-1-4615-5669-5_1"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Zeng, J.-J., Lee, G., Lee, C.-C.: Mining fault-tolerant frequent patterns efficiently with powerful pruning. In: SAC 2008, pp. 927\u2013931 (2008)","DOI":"10.1145\/1363686.1363898"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-05810-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T15:45:12Z","timestamp":1558885512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-05810-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319058092","9783319058108"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05810-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}