{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T06:11:27Z","timestamp":1774591887955,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319937007","type":"print"},{"value":"9783319937014","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-93701-4_13","type":"book-chapter","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T11:49:52Z","timestamp":1528717792000},"page":"171-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On Two Kinds of Dataset Decomposition"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8747-0600","authenticated-orcid":false,"given":"Pavel","family":"Emelyanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"issue":"1\u20133","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2003.12.010","volume":"149","author":"JC Bioch","year":"2005","unstructured":"Bioch, J.C.: The complexity of modular decomposition of boolean functions. Discrete Appl. Math. 149(1\u20133), 1\u201313 (2005)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0167-9236(02)00148-3","volume":"36","author":"M Bohanec","year":"2004","unstructured":"Bohanec, M., Zupan, B.: A function-decomposition method for development of hierarchical multi-attribute decision models. Decis. Support Syst. 36(3), 215\u2013233 (2004)","journal-title":"Decis. Support Syst."},{"key":"13_CR3","unstructured":"Emelyanov, P.: Cartesian decomposition of tables. Transact SQL. http:\/\/algo.nsu.ru\/CartesianDecomposition.sql"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-319-29221-2_14","volume-title":"Algorithms and Discrete Applied Mathematics","author":"P Emelyanov","year":"2016","unstructured":"Emelyanov, P.: AND\u2013decomposition of boolean polynomials with prescribed shared variables. In: Govindarajan, S., Maheshwari, A. (eds.) CALDAM 2016. LNCS, vol. 9602, pp. 164\u2013175. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29221-2_14"},{"issue":"3","key":"13_CR5","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1134\/S0361768815030032","volume":"41","author":"P Emelyanov","year":"2015","unstructured":"Emelyanov, P., Ponomaryov, D.: Algorithmic issues of conjunctive decomposition of boolean formulas. Program. Comput. Softw. 41(3), 162\u2013169 (2015)","journal-title":"Program. Comput. Softw."},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-662-46823-4_8","volume-title":"Perspectives of System Informatics","author":"P Emelyanov","year":"2015","unstructured":"Emelyanov, P., Ponomaryov, D.: On tractability of disjoint AND-decomposition of boolean formulas. In: Voronkov, A., Virbitskaite, I. (eds.) PSI 2014. LNCS, vol. 8974, pp. 92\u2013101. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46823-4_8"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Emelyanov, P., Ponomaryov, D.: Cartesian decomposition in data analysis. In: Proceedings of the Siberian Symposium on Data Science and Engineering (SSDSE 2017), pp. 55\u201360 (2017)","DOI":"10.1109\/SSDSE.2017.8071964"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Fagin, R., Vardi, M.: The theory of data dependencies: a survey. In: Mathematics of Information Processing: Proceedings of Symposia in Applied Mathematics, vol. 34, pp. 19\u201371. AMS, Providence (1986)","DOI":"10.1090\/psapm\/034\/846853"},{"issue":"3","key":"13_CR9","first-page":"37","volume":"17","author":"U Fayyad","year":"1996","unstructured":"Fayyad, U., Piatetsky-Shapiro, G., Smyth, P.: From data mining to knowledge discovery in databases. AI Mag. 17(3), 37\u201354 (1996)","journal-title":"AI Mag."},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1109\/TKDE.2010.197","volume":"24","author":"J Liu","year":"2012","unstructured":"Liu, J., Li, J., Liu, C., Chen, Y.: Discover dependencies from data - a review. IEEE Trans. Knowl. Data Eng. 24(2), 251\u2013264 (2012)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"13_CR11","unstructured":"Mankowski, M., \u0141uba, T., Jankowski, C.: Evaluation of decision table decomposition using dynamic programming classifiers. In: Suraj, Z., Czaja, L. (eds.) Proceedings of the 24$$^{th}$$ International Workshop on Concurrency, Specification and Programming (CS&P 2015), pp. 34\u201343 (2015)"},{"issue":"10","key":"13_CR12","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.14778\/2794367.2794377","volume":"8","author":"T Papenbrock","year":"2015","unstructured":"Papenbrock, T., Ehrlich, J., Marten, J., Neubert, T., Rudolph, J., Schoenberg, M., Zwiener, J., Naumann, F.: Functional dependency discovery: an experimental evaluation of seven algorithms. Proc. VLDB Endowment 8(10), 1082\u20131093 (2015)","journal-title":"Proc. VLDB Endowment"},{"issue":"3\u20134","key":"13_CR13","doi-asserted-by":"crossref","first-page":"195","DOI":"10.3233\/IDA-2000-43-403","volume":"4","author":"I Savnik","year":"2000","unstructured":"Savnik, I., Flach, P.: Discovery of multivalued dependencies from relations. Intell. Data Anal. 4(3\u20134), 195\u2013211 (2000)","journal-title":"Intell. Data Anal."},{"key":"13_CR14","unstructured":"Thalheim, B.: An overview on semantical constraints for database models. In: Proceedings of the 6th International Conference on Intellectual Systems and Computer Science, pp. 81\u2013102 (1996)"},{"key":"13_CR15","unstructured":"Vanthienen, J.: Rules as data: decision tables and relational databases. Bus. Rules J. 11(1) (2010). http:\/\/www.brcommunity.com\/a2010\/b516.html"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Yan, M., Fu, A.W.: Algorithm for discovering multivalued dependencies. In: Proceedings of the $$10^{th}$$ International Conference on Information and Knowledge Management (CIKM 2001), pp. 556\u2013558. ACM, New York (2001)","DOI":"10.1145\/502585.502688"},{"key":"13_CR17","first-page":"207","volume":"22","author":"B Zupan","year":"1998","unstructured":"Zupan, B., Bohanec, M.: Experimental evaluation of three partition selection criteria for decision table decomposition. Informatica 22, 207\u2013217 (1998)","journal-title":"Informatica"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93701-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,11]],"date-time":"2022-06-11T00:11:25Z","timestamp":1654906285000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-93701-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319937007","9783319937014"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93701-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"12 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuxi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"406","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"148","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}