Powiadomienia systemowe
- Sesja wygasła!
- Sesja wygasła!
Tytuł artykułu
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
Concept learning in description logics (DLs) is similar to binary classification in traditional machine learning. The difference is that in DLs objects are described not only by attributes but also by binary relationships between objects. In this paper, we develop the first bisimulation-based method of concept learning in DLs for the following setting: given a knowledge base KB in a DL, a set of objects standing for positive examples and a set of objects standing for negative examples, learn a concept C in that DL such that the positive examples are instances of C w.r.t. KB, while the negative examples are not instances of C w.r.t. KB. We also prove soundness of our method and investigate its C-learnability.
Słowa kluczowe
Wydawca
Czasopismo
Rocznik
Tom
Strony
287--303
Opis fizyczny
Bibliogr. 18 poz., rys.
Twórcy
autor
- Faculty of Information Technology, College of Sciences, Hue University, 77 Nguyen Hue, Hue city, Vietnam
autor
- Faculty of Information Technology, VNU University of Engineering and Technology, 144 Xuan Thuy, Hanoi, Vietnam
autor
- Faculty of Information Technology, College of Sciences, Hue University, 77 Nguyen Hue, Hue city, Vietnam
autor
- Institute of Informatics University of Warsaw, Banacha 2, 02-097 Warsaw, Poland
autor
- Institute of Mathematics University of Warsaw, Banacha 2, 02-097 Warsaw, Poland
Bibliografia
- [1] Badea, L., Nienhuys-Cheng, S.-H.: A Refinement Operator for Description Logics, Proceedings of ILP’2000, 1866, Springer, 2000.
- [2] Baldoni, M., Giordano, L., Martelli, A.: A Tableau for Multimodal Logics and Some (Un)Decidability Results, Proceedings of TABLEAUX’1998, 1397, Springer, 1998.
- [3] Cohen, W., Hirsh, H.: Learning the Classic Description Logic: Theoretical and Experimental Results, Proceedings of KR’1994.
- [4] Divroodi, A., Ha, Q.-T., Nguyen, L., Nguyen, H.: On C-Learnability in Description Logics, Proceedings of ICCCI’2012 (1), 7653, Springer, 2012.
- [5] Divroodi, A., Nguyen, L.: On Bisimulations for Description Logics, Proceedings of CS&P’2011.
- [6] Fanizzi, N., d’Amato, C., Esposito, F.: DL-FOIL Concept Learning in Description Logics, Proc. of ILP’2008, 5194, Springer, 2008.
- [7] Ha, Q.-T., Hoang, T.-L.-G., Nguyen, L., Nguyen, H., Szałas, A., Tran, T.-L.: A Bisimulation-Based Method of Concept Learning for Knowledge Bases in Description Logics, Proceedings of SoICT’2012, ACM, 2012.
- [8] Iannone, L., Palmisano, I., Fanizzi, N.: An algorithm based on counterfactuals for concept learning in the Semantic Web, Appl. Intell., 26(2), 2007, 139–159.
- [9] Lambrix, P., Larocchia, P.: Learning Composite Concepts, Proc. of DL’1998.
- [10] Lehmann, J., Hitzler, P.: Concept learning in description logics using refinement operators, Machine Learning, 78(1-2), 2010, 203–250.
- [11] Nguyen, L.: An Efficient Tableau Prover using Global Caching for the Description Logic ALC, Fundamenta Informaticae, 93(1-3), 2009, 273–288.
- [12] Nguyen, L., Nguyen, T.-B.-L., Szałas, A.: Horn-DL: An Expressive Horn Description Logic with PTime Data Complexity, Proceedings of RR’2013, 7994, Springer, 2013.
- [13] Nguyen, L., Szałas, A.: Logic-based Roughification, in: Rough Sets and Intelligent Systems (To the Memory of Professor Zdzisław Pawlak), Vol. 1 (A. Skowron, Z. Suraj, Eds.), Springer, 2012, 529–556.
- [14] Pawlak, Z.: Rough Sets. Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, Dordrecht, 1991.
- [15] Pawlak, Z., Skowron, A.: Rudiments of rough sets, Inf. Sci., 177(1), 2007, 3–27.
- [16] Tran, T.-L., Ha, Q.-T., Hoang, T.-L.-G., Nguyen, L., Nguyen, H.: Bisimulation-Based Concept Learning in Description Logics, Proceedings of CS&P’2013, CEUR-WS.org, 2013.
- [17] Tran, T.-L., Ha, Q.-T., Hoang, T.-L.-G., Nguyen, L., Nguyen, H., Szałas, A.: Concept Learning for Description Logic-Based Information Systems, Proceedings of KSE’2012, IEEE Computer Society, 2012.
- [18] Tran, T.-L., Nguyen, L., Hoang, T.-L.-G.: A Domain Partitioning Method for Bisimulation-Based Concept Learning in Description Logics, Proceedings of ICCSAMA’2014, 282, Springer, 2014.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-d1ae6572-7b45-4c90-8fbe-05346be94d70