{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:12:16Z","timestamp":1761808336470,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,12]],"date-time":"2019-11-12T00:00:00Z","timestamp":1573516800000},"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":[],"published-print":{"date-parts":[[2019,11,12]]},"DOI":"10.1145\/3297662.3365790","type":"proceedings-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T06:07:56Z","timestamp":1578722876000},"page":"181-186","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Concise Description of Telecom Service Use Through Concept Chains"],"prefix":"10.1145","author":[{"given":"Ants","family":"Torim","sequence":"first","affiliation":[{"name":"Tallinn University of Technology, Department of Software Science, Tallinn, Estonia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sadok","family":"Ben Yahia","sequence":"additional","affiliation":[{"name":"Tallinn University of Technology, Department of Software Science, Tallinn, Estonia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristo","family":"Raun","sequence":"additional","affiliation":[{"name":"Tallinn University of Technology, Department of Software Science, Tallinn, Estonia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,1,10]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Relation Binaire: Application Aux Bases De Donn\u00e9es Documentaires: INFOR: Information Systems and Operational Research: Vol 32, No 1. INFOR 1","author":"Belkhiter N.","year":"1994","unstructured":"N. Belkhiter , C. Bourhfir , M. Gammoudi , A. Jaoua , N. I. Thanh , and M. Reguig . 1994 . D\u00e9composition Rectangulaire Optimale D\u00e2\u0102 &Zacute;une Relation Binaire: Application Aux Bases De Donn\u00e9es Documentaires: INFOR: Information Systems and Operational Research: Vol 32, No 1. INFOR 1 (1994), 33--54. https:\/\/www.tandfon-line.com\/doi\/abs\/10.1080\/03155986.1994.11732236 N. Belkhiter, C. Bourhfir, M. Gammoudi, A. Jaoua, N. I. Thanh, and M. Reguig. 1994. D\u00e9composition Rectangulaire Optimale D\u00e2\u0102&Zacute;une Relation Binaire: Application Aux Bases De Donn\u00e9es Documentaires: INFOR: Information Systems and Operational Research: Vol 32, No 1. INFOR 1 (1994), 33--54. https:\/\/www.tandfon-line.com\/doi\/abs\/10.1080\/03155986.1994.11732236"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2015.06.002"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2009.05.001"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"B. A. Davey and H. A. Priestley. 2002. Introduction to lattices and order (2nd ed ed.). Cambridge University Press Cambridge UK; New York NY.  B. A. Davey and H. A. Priestley. 2002. Introduction to lattices and order (2nd ed ed.). Cambridge University Press Cambridge UK; New York NY.","DOI":"10.1017\/CBO9780511809088"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.2307\/1969503"},{"key":"e_1_3_2_1_6_1","unstructured":"Dheeru Dua and Casey Graff. 2017. UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml  Dheeru Dua and Casey Graff. 2017. UCI Machine Learning Repository. http:\/\/archive.ics.uci.edu\/ml"},{"volume-title":"Formal Concept Analysis: Foundations and Applications","author":"Ganter Bernhard","key":"e_1_3_2_1_7_1","unstructured":"Bernhard Ganter , Gerd Stumme , and Rudolf Wille . 2005. Formal Concept Analysis: Foundations and Applications . Springer. Google-Books-ID : oyb6BwAAQBAJ. Bernhard Ganter, Gerd Stumme, and Rudolf Wille. 2005. Formal Concept Analysis: Foundations and Applications. Springer. Google-Books-ID: oyb6BwAAQBAJ."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/nimg.1998.0391"},{"key":"e_1_3_2_1_9_1","unstructured":"Rein Kuusik. 1989. Application of Theory of Monotone Systems for Decision Trees. Number 705. 72 in Transactions of Tallinn Technical University. Tallinna Tehnika\u00fclikool Tallinn.  Rein Kuusik. 1989. Application of Theory of Monotone Systems for Decision Trees. Number 705. 72 in Transactions of Tallinn Technical University. Tallinna Tehnika\u00fclikool Tallinn."},{"key":"e_1_3_2_1_10_1","volume-title":"QualityCover: Efficient binary relation coverage guided by induced knowledge quality. Information Sciences 355--356 (Aug","author":"Mouakher Amira","year":"2016","unstructured":"Amira Mouakher and Sadok Ben Yahia . 2016. QualityCover: Efficient binary relation coverage guided by induced knowledge quality. Information Sciences 355--356 (Aug . 2016 ), 58--73. https:\/\/doi.org\/10.1016\/j.ins.2016.03.009 10.1016\/j.ins.2016.03.009 Amira Mouakher and Sadok Ben Yahia. 2016. QualityCover: Efficient binary relation coverage guided by induced knowledge quality. Information Sciences 355--356 (Aug. 2016), 58--73. https:\/\/doi.org\/10.1016\/j.ins.2016.03.009"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.08.056"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/03081079.2018.1543666"},{"key":"#cr-split#-e_1_3_2_1_13_1.1","doi-asserted-by":"crossref","unstructured":"Oystein Ore. 1943. Chains in partially ordered sets. In Bulletin of the American Mathematical Society 49 (8). https:\/\/doi.org\/10.1090\/S0002-9904-1943-07970-0 10.1090\/S0002-9904-1943-07970-0","DOI":"10.1090\/S0002-9904-1943-07970-0"},{"key":"#cr-split#-e_1_3_2_1_13_1.2","doi-asserted-by":"crossref","unstructured":"Oystein Ore. 1943. Chains in partially ordered sets. In Bulletin of the American Mathematical Society 49 (8). https:\/\/doi.org\/10.1090\/S0002-9904-1943-07970-0","DOI":"10.1090\/S0002-9904-1943-07970-0"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1981094.1981127"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Ants Torim Marko Mets and Kristo Raun. 2019. Covering Concept Lattices with Concept Chains. (2019).  Ants Torim Marko Mets and Kristo Raun. 2019. Covering Concept Lattices with Concept Chains. (2019).","DOI":"10.1007\/978-3-030-23182-8_14"},{"key":"e_1_3_2_1_16_1","unstructured":"Leo V\u00f5handu Rein Kuusik Ants Torim Eik Aab and Grete Lind. 2006. Some algorithms for data table (re)ordering using Monotone Systems. (2006) 7.  Leo V\u00f5handu Rein Kuusik Ants Torim Eik Aab and Grete Lind. 2006. Some algorithms for data table (re)ordering using Monotone Systems. (2006) 7."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1266840.1266870"},{"volume-title":"Formal Concept Analysis (Lecture Notes in Computer Science), S\u00e9bastien Ferr\u00e9 and Sebastian Rudolph (Eds.)","author":"Wille Rudolf","key":"e_1_3_2_1_18_1","unstructured":"Rudolf Wille . 2009. Restructuring Lattice Theory: an Approach Based on Hierarchies of Concepts . In Formal Concept Analysis (Lecture Notes in Computer Science), S\u00e9bastien Ferr\u00e9 and Sebastian Rudolph (Eds.) . Springer Berlin Heidelberg , 314--339. Rudolf Wille. 2009. Restructuring Lattice Theory: an Approach Based on Hierarchies of Concepts. In Formal Concept Analysis (Lecture Notes in Computer Science), S\u00e9bastien Ferr\u00e9 and Sebastian Rudolph (Eds.). Springer Berlin Heidelberg, 314--339."}],"event":{"name":"MEDES '19: 11th International Conference on Management of Digital EcoSystems","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Limassol Cyprus","acronym":"MEDES '19"},"container-title":["Proceedings of the 11th International Conference on Management of Digital EcoSystems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297662.3365790","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3297662.3365790","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:09Z","timestamp":1750204449000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297662.3365790"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,12]]},"references-count":19,"alternative-id":["10.1145\/3297662.3365790","10.1145\/3297662"],"URL":"https:\/\/doi.org\/10.1145\/3297662.3365790","relation":{},"subject":[],"published":{"date-parts":[[2019,11,12]]},"assertion":[{"value":"2020-01-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}