{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:58:01Z","timestamp":1725512281759},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540711988"},{"type":"electronic","value":"9783540712008"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71200-8_17","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T13:30:21Z","timestamp":1179754221000},"page":"308-328","source":"Crossref","is-referenced-by-count":1,"title":["Discovering Association Rules in Incomplete Transactional Databases"],"prefix":"10.1007","author":[{"given":"Grzegorz","family":"Protaziuk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henryk","family":"Rybinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","first-page":"207","volume-title":"Proc. of the ACM SIGMOD Conference on Management of Data","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining Associations Rules between Sets of Items in Large Databases. In: Proc. of the ACM SIGMOD Conference on Management of Data, Washington, USA, pp. 207\u2013216. ACM Press, New York (1993)"},{"key":"17_CR2","first-page":"487","volume-title":"Proc. of the 20th International Conference on Very Large Databases Conference (VLDB)","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. of the 20th International Conference on Very Large Databases Conference (VLDB), Santiago, Chile, pp. 487\u2013499. Morgan Kaufmann, San Francisco (1994)"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/312129.312219","volume-title":"Proc. of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD)","author":"R.J. Bayardo","year":"1999","unstructured":"Bayardo, R.J., Agrawal, R.: Mining the Most Interesting Rules. In: Proc. of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), San Diego, CA, USA, pp. 145\u2013154. ACM Press, New York (1999)"},{"issue":"2\/3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1009895914772","volume":"4","author":"R.J. Bayardo","year":"2000","unstructured":"Bayardo, R.J., Agrawal, R., Gunopulos, D.: Constraint-Based Rule Mining in Large, Dense Databases. Data Mining and Knowledge Discovery\u00a04(2\/3), 217\u2013240 (2000)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"17_CR5","volume-title":"Proceedings of ACM SIGMOD International Conference on Management of Data, Seattle","author":"R.J. Bayardo Jr.","year":"1998","unstructured":"Bayardo Jr., R.J.: Efficiently Mining Long Patterns from Databases. In: Proceedings of ACM SIGMOD International Conference on Management of Data, Seattle, ACM Press, New York (1998)"},{"key":"17_CR6","volume-title":"Classification and regression trees","author":"L. Breiman","year":"1984","unstructured":"Breiman, L., et al.: Classification and regression trees. Wadsworth, Belmont (1984)"},{"key":"17_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45681-3_7","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"T. Calders","year":"2002","unstructured":"Calders, T., Goethals, B.: Mining All Non-derivable Frequent Item Sets. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol.\u00a02431, Springer, Heidelberg (2002)"},{"key":"17_CR8","unstructured":"Dardzi\u0144ska-G\u0142e\u0327bocka, A.: Chase Method Based on Dynamic Knowledge Discovery for Prediction Values in Incomplete Information Systems. PhD thesis, Warsaw (2004)"},{"key":"17_CR9","unstructured":"Friedman, H.F., Kohavi, R., Yun, Y.: Lazy decision trees. In: Proceedings of the 13th National Conference on Artificial Intelligence, Portland, Oregon (1996)"},{"key":"17_CR10","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Rough Sets and Current Trends in Computing","author":"J.W. Grzymala-Busse","year":"2004","unstructured":"Grzymala-Busse, J.W.: Characteristic Relations for Incomplete Data: A Generalization of the Indiscernibility Relation. In: Tsumoto, S., et al. (eds.) RSCTC 2004. LNCS (LNAI), vol.\u00a03066, Springer, Heidelberg (2004)"},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J. Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proc. Of the 2000 ACM SIGMOD International Conference on Management of Data, Dallas, Texas, USA, 2000. SIGMOD Record\u00a029(2), 1\u201312 (2000)","journal-title":"SIGMOD Record"},{"key":"17_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/3-540-39963-1_53","volume-title":"Foundations of Intelligent Systems","author":"M. Kryszkiewicz","year":"2000","unstructured":"Kryszkiewicz, M., Rybinski, H.: Legitimate Approach to Association Rules under Incompleteness. In: Ohsuga, S., Ra\u015b, Z.W. (eds.) ISMIS 2000. LNCS (LNAI), vol.\u00a01932, pp. 505\u2013514. Springer, Heidelberg (2000)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45151-X_12","volume-title":"Web-Age Information Management","author":"M. Kryszkiewicz","year":"2000","unstructured":"Kryszkiewicz, M.: Probabilistic Approach to Association Rules in Incomplete Databases. In: Lu, H., Zhou, A. (eds.) WAIM 2000. LNCS, vol.\u00a01846, Springer, Heidelberg (2000)"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/ICDM.2001.989533","volume-title":"Proc. of the 2001 IEEE International Conference on Data Mining (ICDM)","author":"M. Kryszkiewicz","year":"2001","unstructured":"Kryszkiewicz, M.: Concise Representation of Frequent Patterns based on Disjunction-Free Generators. In: Proc. of the 2001 IEEE International Conference on Data Mining (ICDM), San Jose, California, USA, pp. 305\u2013312. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/3-540-64383-4_17","volume-title":"Research and Development in Knowledge Discovery and Data Mining","author":"M. Kryszkiewicz","year":"1998","unstructured":"Kryszkiewicz, M.: Representative Association Rules. In: Wu, X., Kotagiri, R., Korb, K.B. (eds.) PAKDD 1998. LNCS, vol.\u00a01394, pp. 198\u2013209. Springer, Heidelberg (1998)"},{"key":"17_CR16","unstructured":"Kryszkiewicz, M.: Concise Representations of Frequent Patterns and Association Rules. Habilitation Thesis, Warsaw University of Technology (2002)"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0052824","volume-title":"Advances in Intelligent Data Analysis. Reasoning about Data","author":"W.Z. Liu","year":"1997","unstructured":"Liu, W.Z., et al.: Techniques for Dealing with Missing Values in Classification. In: Liu, X., Cohen, P.R., Berthold, M.R. (eds.) Advances in Intelligent Data Analysis. Reasoning about Data. LNCS, vol.\u00a01280, Springer, Heidelberg (1997)"},{"key":"17_CR18","unstructured":"Nayak, J.R., Cook, D.J.: Approximate Association Rule Mining. In: Proceedings of the Fourteenth International Artificial Intelligence Research Society Conference, Key West, Florida (2001)"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Parsons, S.: Current Approach to Handling Imperfect Information in Data and Knowledge Bases. IEEE Transaction on knowledge and data engineering\u00a08 (1996)","DOI":"10.1109\/69.506705"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z. Pawlak","year":"1982","unstructured":"Pawlak, Z.: Rough Sets. International Journal of Information and Computer Sciences\u00a011, 341\u2013356 (1982)","journal-title":"International Journal of Information and Computer Sciences"},{"key":"17_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-3534-4","volume-title":"Rough Sets: Theoretical Aspects of Reasoning about Data, vol. 9","author":"Z. Pawlak","year":"1991","unstructured":"Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data, vol. 9. Kluwer Academic Publishers, Dordrecht (1991)"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT\u201999","author":"N. Pasquier","year":"1998","unstructured":"Pasquier, N., et al.: Discovering Frequent Closed Itemsets for Association Rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 398\u2013416. Springer, Heidelberg (1998)"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Protaziuk, G., Soldacki, P., Gancarz, L.: Discovering interesting rules in dense data. In: The Eleventh International Symposium on Intelligent Information Systems, Sopot (2002)","DOI":"10.1007\/978-3-7908-1777-5_9"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Bastide, Y., et al.: Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets. In: Comp. Logic, pp. 972\u2013986 (2000)","DOI":"10.1007\/3-540-44957-4_65"},{"key":"17_CR25","volume-title":"C4.5 Programs for Machine Learning","author":"J.R. Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5 Programs for Machine Learning. Morgan Kaufmann, San Mateo (1993)"},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/3-540-64383-4_22","volume-title":"Research and Development in Knowledge Discovery and Data Mining","author":"A. Ragel","year":"1998","unstructured":"Ragel, A., Cremilleux, B.: Treatment of Missing Values for Association Rules. In: Wu, X., Kotagiri, R., Korb, K.B. (eds.) PAKDD 1998. LNCS, vol.\u00a01394, pp. 258\u2013270. Springer, Heidelberg (1998)"},{"key":"17_CR27","first-page":"67","volume-title":"Proc. Of the Third International Conference on Knowledge Discovery and Data Mining (KDD)","author":"R. Srikant","year":"1997","unstructured":"Srikant, R., Vu, Q., Agrawal, R.: Mining Association Rules with Item Constraints. In: Proc. Of the Third International Conference on Knowledge Discovery and Data Mining (KDD), Newport Beach, California, USA, pp. 67\u201373. AAAI Press, Menlo Park (1997)"},{"issue":"3","key":"17_CR28","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1111\/0824-7935.00162","volume":"17","author":"J. Stefanowski","year":"2001","unstructured":"Stefanowski, J., Tsoukias, A.: Incomplete Information Tables and Rough Classification. Int. Journal of Computational Intelligence\u00a017(3), 545\u2013566 (2001)","journal-title":"Int. Journal of Computational Intelligence"},{"key":"17_CR29","unstructured":"Stefanowski, J.: Algorytmy indukcji regu decyzyjnych w odkrywaniu wiedzy (Algorithms of Rule Induction for Knowledge Discovery). Habilitation Thesis, Poznan University of Technology, No. 361 (2001)"},{"key":"17_CR30","volume-title":"Proceedings of the 2002 IEEE International Conf. on Fuzzy Systems, Honolulu","author":"G. Wang","year":"2002","unstructured":"Wang, G.: Extension of Rough Set under Incomplete Information Systems. In: Proceedings of the 2002 IEEE International Conf. on Fuzzy Systems, Honolulu, IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"17_CR31","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/347090.347101","volume-title":"Proc. of 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Boston, MA","author":"M.J. Zaki","year":"2000","unstructured":"Zaki, M.J.: Generating Non-Redundant Association Rules. In: Proc. of 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Boston, MA, pp. 34\u201343. ACM Press, New York (2000)"},{"key":"17_CR32","unstructured":"Zhang, J., Honavar, V.: Learning Decision Tree Classifiers from Attribute Value Taxonomies and Partially Specified Data. In: Proceedings of the Twentieth International Conference (ICML 2003), Washington, DC (2003)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Rough Sets VI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71200-8_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:16:31Z","timestamp":1605762991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71200-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540711988","9783540712008"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71200-8_17","relation":{},"subject":[]}}