From Data to Pattern Structures : Near Set Approach

• Autorzy: Wolski Marcin , Gomolińska Anna

Identyfikatory

DOI

10.3233/FI-2019-1790

• Języki publikacji: EN

Abstrakty

EN

Pattern structures were introduced by Ganter and Kuznetsov in the framework of formal concept analysis (FCA) as a mean to direct analysis of objects having complex descriptions, e.g., descriptions presented in the form of graphs instead of a set of properties. Pattern structures actually generalise/replace the original FCA representation of the initial information about objects, that is, formal contexts (which form a special type of data tables); as a consequence, pattern structures are regarded in FCA as given (in some sense a priori to the analysis) rather than built (a posteriori) from data. The main goal of this paper is twofold: firstly, we would like to export the idea of pattern structures to and consistently with the framework/methodology of rough set theory (RST); secondly, we want to derive pattern structures from simple data tables rather than to regard them as the initial information about objects. To this end we present and discuss two methods of generating non-trivial pattern structures from simple information systems/tables. Both methods are inspired by near set theory, which is a methodology theoretically close to rough set theory, but developed in the topological settings of (descriptive) nearness of sets. Interestingly, these methods bear formal connections to other ideas from RST such as generalised decisions or symbolic value grouping.

Słowa kluczowe

EN

formal concept analysis; near set theory; pattern structures; rough set theory

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2019
• Tom: Vol. 165, nr 3-4
• Strony: 363--380
• Opis fizyczny: Bibliogr. 28 poz., rys., tab., wykr.

Twórcy

autor

Wolski Marcin

• Maria Curie-Skłodowska University, Department of Logic and Cognitive Science, Maria Curie-Skłodowska Sq. 4, 20-031 Lublin, Poland

autor

Gomolińska Anna

• University of Białystok, Faculty of Mathematics and Informatics, Konstantego Ciołkowskiego 1M, 15-245 Białystok, Poland

Bibliografia

• [1] Ganter B, Kuznetsov S. Pattern structures and their projections. In: Delugach H, Stumme G (eds.), Conceptual Structures: Broadening the Base, volume 2120 of Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, 2001 pp. 129-142. doi:10.1007/3-540-44583-8_10.
• [2] Ganter B, Wille R. Formal Concept Analysis. Mathematical Foundations. Springer, Berlin, Heidelberg, 1999. ISBN: 978-3-642-59830-2.
• [3] Wille R. Concept lattices and conceptual knowledge systems. Computers and Mathematics with Applications, 1992;23:493-515. doi:10.1016/0898-1221(92)90120-7.
• [4] Peters J. Near sets. General theory about nearness of objects. Applied Mathematical Sciences, 2007; 1(53):2609-2029. URL http://www.m-hikari.com/ams/ams-password-2007/ams-password53-56-2007/petersAMS53-56-2007.pdf.
• [5] Peters J. Near sets. Special theory about nearness of objects. Fundamenta Informaticae, 2007;75(1-4):407-433. URL http://content.iospress.com/articles/fundamenta-informaticae/fi75-1-4-24.
• [6] Peters J, Skowron A, Stepaniuk J. Nearness in approximation spaces. In: Lindemann G, Schlingloff H (eds.), Concurrency, Specification & Programming (CS&P’2006). Proceedings, volume 206 of Informatik-Berichte, Humboldt Universität, Berlin, 2006 pp. 435-445.
• [7] Pawlak Z. Systemy Informacyjne. Podstawy Teoretyczne. WNT, Warszawa, 1983. ISBN:83-204-0520-3.
• [8] Wille R. Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival I (ed.), Ordered Sets, volume 83 of NATO Advanced Study Institutes Series (Series C - Mathematical and Physical Sciences), Springer, Dordrecht. 1982 pp. 445-470. ISBN: 978-94-009-7800-3. doi:10.1007/978-94-009-7798-3_15.
• [9] Riesz F. Stetigkeitsbegriff und abstrakte Mengenlehre. In: Castelnuovo G (ed.), Atti del IV Congresso Internazionale dei Matematici II, Roma, Italy, 6-11 April 1908, Tip. della R. Accademia dei Lincei, Roma, 1909 pp. 18-24.
• [10] Čech E. Topological Spaces. John Wiley & Sons Ltd., London, 1966. URL https://www.sciencedirect.com/journal/general-topology-and-its-applications/vol/4/issue/3.
• [11] Efremovič V. The geometry of proximity I. Matematicheskii Sbornik (N.S.), 1952;31 (73):189-200. URL http://mi.mathnet.ru/msb5526.
• [12] Naimpally S, Peters J. Topology with Applications. Topological Spaces via Near and Far. World Scientific, Singapore, 2013. ISBN-10:9789814407656, 13:978-9814407656. URL https://doi.org/10.1142/8501.
• [13] Peters J, Naimpally S. Applications of near sets. American Mathematical Society Notices, 2012; 59(4):536-542. doi:10.1090/noti817.
• [14] Wolski M, Gomolińska A. Rough and near: modal history of two theories. In: Polkowski L, Yao Y, Artiemjew P, Ciucci D, Liu D, Ślęzak D, Zielosko B (eds.), Rough Sets - International Joint Conference, IJCRS 2017, Olsztyn, Poland, July 3-7, 2017, Proceedings, Part I, volume 10313 of Lecture Notes in Computer Science, Springer, Cham, 2017 pp. 109-122. doi:10.1007/978-3-319-60837-2_9.
• [15] Orłowska E, Pawlak Z. Representation of nondeterministic information. Theoretical Computer Science, 1984;29(1-2):27-39. doi:10.1016/0304-3975(84)90010-0.
• [16] Pawlak Z. Classification of Objects by Means of Attributes. Technical report, Institute of Computer Science, 1981.
• [17] Pawlak Z. Rough sets. International Journal of Computer and Information Science, 1982;11:341-356. URL https://link.springer.com/content/pdf/10.1007%2FBF01001956.pdf.
• [18] Pratt V. Chu spaces and their interpretation as concurrent objects. In: van Leeuwen J (ed.), Computer Science Today. Recent Trends and Developments, volume 1000 of Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, 1995 pp. 392-405. doi:10.1007/BFb0015256.
• [19] Pawlak Z. Rough sets and decision tables. In: Skowron A (ed.), Computation Theory. SCT 1984, volume 208 of Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, 1985 pp. 186-196. doi:10.1007/3-540-16066-3_18.
• [20] Pawlak Z. Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publisher, Dordrecht, 1991. doi:10.1007/978-94-011-3534-4.
• [21] Naimpally S. Proximity Approach to General Topology. Lakehead University, 1974. ASIN:B0007AFCYC.
• [22] Adámek J, Herrlich H, Strecker G. Abstract and Concrete Categories. Wiley-Interscience Publication, London, 1990. URL http://katmat.math.uni-bremen.de/acc.
• [23] Herrlich H. A concept of nearness. General Topology and its Applications, 1974;4:191-212. URL https://www.sciencedirect.com/journal/general-topology-and-its-applications/vol/4/issue/3.
• [24] Kuznetsov S. Pattern structures for analyzing complex data. In: Sakai H, Chakraborty M, Hassanien A, Ślęzak D, Zhu W(eds.), Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, 12th International Conference, RSFDGrC 2009, Delhi, India, December 15-18, 2009. Proceedings, volume 5908 of Lecture Notes in Computer Science, Springer, Berlin, Heidelberg. 2009 pp. 33-44. ISBN: 978-3-642-10645-3. doi:10.1007/978-3-642-10646-0_4.
• [25] Pawlak Z, Skowron A. Rough sets and boolean reasoning. Information Sciences, 2007;177(1):41-73. doi:10.1016/j.ins.2006.06.007.
• [26] Pawlak Z, Skowron A. Rudiments of rough sets. Information Sciences, 2007;177(1):3-27. doi:10.1016/j.ins.2006.06.003.
• [27] Ślęzak D. On generalized decision functions: reducts, networks and ensembles. In: Yao Y, Hu Q, Yu H, Grzymała-Busse J (eds.), Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - 15th International Conference, RSFDGrC 2015, Tianjin, China, November 20-23, 2015. Proceedings, volume 9437 of Lecture Notes in Computer Science, Springer, Berlin, Heidelberg. 2015 pp. 13-23. ISBN: 978-3-319-25782-2. doi:10.1007/978-3-319-25783-9_2.
• [28] Nguyen S, Nguyen H. Pattern extraction from data. Fundamenta Informaticae, 1998;34:129-144. doi:10.3233/FI-1998-341205.

Uwagi

Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2019).