{"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":1774316088450,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,2,19]],"date-time":"2009-02-19T00:00:00Z","timestamp":1235001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,2,19]],"date-time":"2009-02-19T00:00:00Z","timestamp":1235001600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Inf Syst Front"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s10796-009-9158-z","type":"journal-article","created":{"date-parts":[[2009,2,18]],"date-time":"2009-02-18T09:52:43Z","timestamp":1234950763000},"page":"461-469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Proportional fault-tolerant data mining with applications to bioinformatics"],"prefix":"10.1007","volume":"11","author":[{"given":"Guanling","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng-Lung","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuh-Tzu","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,2,19]]},"reference":[{"key":"9158_CR1","unstructured":"Agrawal, R., & Srikant, R. (1994). \u201cFast Algorithm for Mining Association Rules.\u201d In Proceedings of Int. Conf. Very Large Data Bases (VLDB\u201994), pp. 487\u2013499, Santiago, Chile."},{"key":"9158_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., & Swami, A. (1993). \u201cMining Association Rules between Sets of Items in Large Databases.\u201d In Proceedings of ACM-SIGMOD International Conference Management of Data (SIGMOD\u201993), pp. 207\u2013216, Washington, DC.","DOI":"10.1145\/170036.170072"},{"key":"9158_CR3","doi-asserted-by":"crossref","unstructured":"Antonie, M., Za\u00efane, O. R. (2004). \u201cMining Positive and Negative Association Rules: An Approach for Confined Rules,\u201d European Conference on Principles of Data Mining and Knowledge Discovery (PKDD).","DOI":"10.1007\/978-3-540-30116-5_6"},{"key":"9158_CR4","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Ullman, J. D., & Tsur, S. (1997). \u201cDynamic Itemset Counting and Implication Rules for Market Basket Analysis,\u201d In Proceedings of ACM-SIGMOD International Conference Management of Data (SIGMOD\u201997), pp. 255\u2013264, Tucson, AZ.","DOI":"10.1145\/253260.253325"},{"key":"9158_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/b138246","volume-title":"Bioinformatics Technologies","author":"Y. P. P. Chen","year":"2005","unstructured":"Chen, Y. P. P. (2005). Bioinformatics Technologies. Berlin: Springer."},{"key":"9158_CR6","doi-asserted-by":"crossref","unstructured":"Chen, Y. - L., & Ho, C. - Y. (2005). A Sampling-Based Method for Mining Frequent Patterns from Databases. In FSKD 2005, Changsha, China, pp 536\u2013545.","DOI":"10.1007\/11540007_65"},{"key":"9158_CR7","doi-asserted-by":"crossref","unstructured":"Chen, B., Haas, P., & Scheuermann, P. (2002). \u201cA New Two-Phase Sampling Based Algorithm for Discovering Association Rules.\u201d In Proceedings of the 8th ACM SIGKDD International Conference Knowledge Discovery and Data Mining (SIGKDD\u201902), Alberta, Canada.","DOI":"10.1145\/775107.775114"},{"key":"9158_CR8","doi-asserted-by":"crossref","unstructured":"Chen, L., Bhowmick, S. S., & Li, J. (2006). Mining Temporal Indirect Associations.\u201d In Proceedings of 10th International Conference Pacific-Asia Conference (PAKDD 2006), Singapore, pp. 425\u2013434.","DOI":"10.1007\/11731139_49"},{"key":"9158_CR9","doi-asserted-by":"crossref","unstructured":"Chu, T. - P., Wu, F., & Chiang, S. - W. (2005). \u201cMining Frequent Pattern Using Item-Transformation Method.\u201d In Proceedings of 4th Annual ACIS International Conference on Computer and Information Science (ICIS 2005), South Korea, pp. 698\u2013706.","DOI":"10.1109\/ICIS.2005.87"},{"key":"9158_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D. (1997). Algorithms on Strings, Trees, and Sequences. Cambridge: Cambridge University Press."},{"key":"9158_CR11","unstructured":"Han, J., & Fu, Y. (1995). \u201cDiscovery of Multiple-level Association Rules from Large Databases.\u201d In Proceedings of International Conference Very Large Data Bases (VLDB\u201995), pp. 420\u2013431, Zurich, Switzerland."},{"key":"9158_CR12","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., & Yin, Y. (2000). \u201cMining Frequent Patterns Without Candidate Generation.\u201d. In Proceedings of 2000 ACM SIGMOD International Conference on Management of data. ACM SIGMOD Record.","DOI":"10.1145\/342009.335372"},{"key":"9158_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. E. Knuth","year":"1977","unstructured":"Knuth, D. E., Morris, J. H., & Pratt, V. B. (1977). Fast Pattern Matching in Strings. SIAM Journal on Computing, 6, 323\u2013350.","journal-title":"SIAM Journal on Computing"},{"key":"9158_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10796-005-6102-8","volume":"8","author":"M. Kotlyar","year":"2006","unstructured":"Kotlyar, M., & Jurisica, I. (2006). Predicting protein\u2013protein interactions by association mining. Information Systems Frontiers, 8, 37\u201347.","journal-title":"Information Systems Frontiers"},{"key":"9158_CR15","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10796-006-8777-x","volume":"8","author":"C. F. Lee","year":"2006","unstructured":"Lee, C. F., Changchien, S. W., Wang, W. T., & Shen, J. J. (2006). A data mining approach to database compression. Information Systems Frontiers, 8, 147\u2013161.","journal-title":"Information Systems Frontiers"},{"key":"9158_CR16","volume-title":"Janeway\u2019s immuno biology","author":"K. Murphy","year":"2008","unstructured":"Murphy, K., Travers, P., & Walport, M. (2008). Janeway\u2019s immuno biology (7th ed.). London: Garland Science.","edition":"7"},{"key":"9158_CR17","doi-asserted-by":"crossref","unstructured":"Park, J. S., Chen, M. S., & Yu, P. S. (1995). An Efficient Hash-based Algorithm for Mining Association Rules.\u201d In Proceedings of ACM-SIGMOD International Conference Management of Data (SIGMOD\u201995), pp. 175\u2013186, San Jose, CA.","DOI":"10.1145\/223784.223813"},{"key":"9158_CR18","first-page":"75","volume-title":"Matrix Apriori: Speeding Up the Search for Frequent Patterns","author":"J. Pavon","year":"2006","unstructured":"Pavon, J., Viana, S., & Gomez, S. (2006). Matrix Apriori: Speeding Up the Search for Frequent Patterns pp. 75\u201382. Austria: Databases and Applications."},{"key":"9158_CR19","unstructured":"Pei, J., Tung, A. K. H., & Han, J. (2001). Fault-Tolerant Frequent Pattern Mining: Problems and Challenges. DMKD\u201901, Santa Barbara, CA."},{"key":"9158_CR20","doi-asserted-by":"publisher","first-page":"1394","DOI":"10.1126\/science.1085952","volume":"300","author":"P. A. Rota","year":"2003","unstructured":"Rota, P. A., et al. (2003). Characterization of a novel Coronavirus associated with Severe Acute Respiratory Syndrome. Science, 300, 1394\u20131399.","journal-title":"Science"},{"issue":"1","key":"9158_CR21","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1186\/1471-2164-6-79","volume":"6","author":"S. Saha","year":"2005","unstructured":"Saha, S., Bhasin, M., & Raghava, G. P. S. (2005). Bcipep:A database of B-cell epitopes. BMC Genomics, 6(1), 79.","journal-title":"BMC Genomics"},{"key":"9158_CR22","unstructured":"Savasere, A., Omiecinski, E., & Navathe, S. (1995). An Efficient Algorithm for Mining Association Rules in Large Databases. In Proceedings of International Conference Very Large Data Bases (VLDB\u201995), pp. 432\u2013443, Zurich, Switzerland."},{"key":"9158_CR23","doi-asserted-by":"crossref","unstructured":"Thiruvady, D. R., & Webb, G. I. (2004). Mining Negative Rules using GRD. In Proceedings of PAKDD.","DOI":"10.1007\/978-3-540-24775-3_20"},{"key":"9158_CR24","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E. (1995). On-line Construction of Suffix-trees. Algorithmica, 14, 249\u2013260.","journal-title":"Algorithmica"},{"key":"9158_CR25","unstructured":"Wang, S. - S., & Lee, S. - Y. (2002). Mining Fault-Tolerant Frequent Patterns in Large Database. Proceedings of International Computer Symposium."},{"key":"9158_CR26","doi-asserted-by":"crossref","unstructured":"Yang, C., Fayyad, U., & Bradley, P. S. (2001). Efficient discovery of error-tolerant frequent itemsets in high dimensions.\u201d In Proceedings of the seventh ACM SIGKDD International Conference on Knowledge discovery and data mining.","DOI":"10.1145\/502512.502539"},{"key":"9158_CR27","doi-asserted-by":"crossref","unstructured":"Zaki, M. J. (2000). Scalable Algorithms for Association Mining. IEEE Transaction on Knowledge and Information Engineering, 12(3).","DOI":"10.1109\/69.846291"},{"key":"9158_CR28","unstructured":"Zhang, C., & Zhang, S. (2004). Efficient Mining of Both Positive and Negative Association Rules: generate both positive and negative association rules. ACM Transactions on Information Systems."}],"container-title":["Information Systems Frontiers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10796-009-9158-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10796-009-9158-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10796-009-9158-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10796-009-9158-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T01:28:55Z","timestamp":1744162135000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10796-009-9158-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,19]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["9158"],"URL":"https:\/\/doi.org\/10.1007\/s10796-009-9158-z","relation":{},"ISSN":["1387-3326","1572-9419"],"issn-type":[{"value":"1387-3326","type":"print"},{"value":"1572-9419","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,19]]},"assertion":[{"value":"19 February 2009","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}