Nearness of Objects: Extension of Approximation Space Model

• Autorzy: Peters J.F. , Skowron A.
• Języki publikacji: EN

Abstrakty

EN

The problem considered in this paper is the extension of an approximation space to include a nearness relation. Approximation spaces were introduced by Zdzisaw Pawlak during the early 1980s as frameworks for classifying objects by means of attributes. Pawlak introduced approximations as a means of approximating one set of objects with another set of objects using an indiscernibility relation that is based on a comparison between the feature values of objects. Until now, the focus has been on the overlap between sets. It is possible to introduce a nearness relation that can be used to determine the "nearness" of sets of objects that are possibly disjoint and, yet, qualitatively near to each other. Several members of a family of nearness relations are introduced in this article. The contribution of this article is the introduction of a nearness relation that makes it possible to extend Pawlak's model for an approximation space and to consider the extension of generalized approximations spaces.

Słowa kluczowe

EN

rough sets; approximation; approximation space; classification; feature; nearness relation; neighbourhood; proximity spaces

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2007
• Tom: Vol. 79, nr 3-4
• Strony: 497--512
• Opis fizyczny: bibliogr. 55 poz., wykr.

Twórcy

autor

Peters J.F.

autor

Skowron A.

• Department of Electrical and Computer Engineering, University of Manitoba, 75 Chancellor's Circle, ENGR E2-390,Winnipeg, Manitoba R3T 5V6, Canada,

Bibliografia

• [1] Düntsch, I., Vakarelov, D.: Region-based theory of discrete spaces: A proximity approach. Discrete Applied Mathematics, 2006, [to appear].
• [2] Efremovič, V.A.: Infinitesimal spaces (in Russian). Dokl. Akad. Nauk SSSR 76 (1951) 341-343.
• [3] Efremovič, V.A.: Geometry of proximities 1 (in Russian). Math. Sb. 31 (73), no. 1 (1952) 189-200.
• [4] Engelking, R.: General Topology. Heldermann Verlag, Lemgo, Germany 1989.
• [5] Galton, A.: The mereotopology of discrete space. COSIT 1999, LNCS 1661, Springer, Heidelberg, 1999, 251-266.
• [6] Gomolińska, A.: Approximation spaces based on similarity and dissimilarity. In: Lindemann, G., Schlingloff, H., Burkhard,H.-D., Czaja, L., Penczek,W., Salwicki, A., Skowron,A., Suraj, Z. (Eds.), Concurrency, Specification and Programming (CS&P'06). Infomatik-Berichte, Nr. 206, 2006, 446-457.
• [7] Gomolińska, A.: Possible rough ingredients of concepts in approximation spaces. Fundamenta Informaticae 72, 2006, 139-154.
• [8] Gomolińska, A.: Satisfiability and meaning of formulas and sets of formulas in approximation spaces. Fundamenta Informaticae 67 (1-3), 2005, 77-92.
• [9] Gomolińska, A.: Rough validity, confidence, and coverage of rules in approximation spaces. Transactions on Rough Sets III, LNCS 3400, Springer, Heidelberg, 2005, 57-81.
• [10] Gomolińska, A.: Satisfiability and meaning in approximation spaces. In: Lindemann, G., Burkhard, H.-D., Czaja, L., Skowron, A., Schlingloff, H., Suraj, Z. (Eds.), Concurrency, Specification and Programming (CS&P'2004). Infomatik-Berichte, Nr. 170, ISSN 0863-095X, Humboldt-Universitt zu Berlin, 2004, 229-240.
• [11] Hazelwinkel, M. (Ed.): Encyclopaedia of Mathematics. Kluwer Academic Publishers, Dordrecht, 1995, 213.
• [12] Henry, C., Peters, J.F.: Image pattern recognition using near sets. 2007 Joint Rough Set Symposium (JRS07), LNCS, 14-16 May (2007), in press.
• [13] Herrlich, H.: A concept of nearness. General Topology and Applications 4, 1974, 191-212.
• [14] Herrlich, H.: Topological structures. Math. Centre Tracts 52, 1974, 59-122.
• [15] Marek, W., Pawlak, Z.: Information storage and retrieval systems: Mathematical foundations. Theoretical Computer Science 1, 1976, 331-354.
• [16] Naimpally, S.A., Warrack, B.D.: Proximity Spaces. Cambridge University Press, London, 1970.
• [17] Mitchell, M.: Analogy-Making as Perception: A Computer Model. MIT Press, Cambridge, MA, 1993.
• [18] Mitchell, M.: Analogy-making as a complex adaptive system. In: L. E. Segel and I. R. Cohen (Eds.), Design Principles for the Immune System and Other Distributed Autonomous Systems, Oxford University Press, New York, 2001, 335-360.
• [19] Pawlak, Z.: Mathematical foundations of information retrieval, Proceedings of SymposiumofMathematical Foundations of Computer Science, September 3-8, 1973, High Tartras, 135-136; see also: Mathematical Foundations of Information Retrieval, Computation Center, Polish Academy of Sciences, Research Report CC PAS Report 101, 1973.
• [20] Pawlak, Z.: Classification of objects by means of attributes, Research Report PAS 429, Institute of Computer Science, Polish Academy of Sciences, ISSN 138-0648, January 1981.
• [21] Pawlak, Z.: Rough Sets, Research Report PAS 431, Institute of Computer Science, Polish Academy of Sciences, 1981.
• [22] Pawlak, Z.: Rough sets. International Journal of Computer and Information Sciences 11, 1982, 341-356.
• [23] Pawlak, Z.: Rough classification. International Journal of Man-Machine Studies 20(5), 1984, 469-483.
• [24] Pawlak, Z.: On conflicts. International Journal of Man-Machine Studies 21, 1984, 127-134.
• [25] Pawlak, Z.: On Conflicts (in Polish), Polish Scientific Publishers, Warsaw, 1987.
• [26] Pawlak, Z.: Rough Sets - Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht, The Netherlands, 1991.
• [27] Pawlak, Z.: Anatomy of conflict. Bulletin of the European Association for Theoretical Computer Science 50, 1993, 234-247.
• [28] Pawlak, Z.: An inquiry into anatomy of conflicts. Journal of Information Sciences 109, 1998, 65-78.
• [29] Pawlak, Z., Skowron, A.: Rudiments of rough sets. Information Sciences. An International Journal. Elsevier, 2007, 177(1), 3-27.
• [30] Pawlak, Z., Skowron, A.: Rough sets: Some extensions. Information Sciences. An International Journal. Elsevier, 2007, 177(1), 28-40.
• [31] Pawlak, Z., Skowron, A.: Rough sets and Boolean reasoning. Information Sciences. An International Journal. Elsevier, 2007, 177(1), 41-73.
• [32] Peters, J.F.: Classification of objects by means of features. In: Fogel, D., Mendel, J., Yao, X., Omori, T. (Eds.), Proc. First IEEE Symposium on Foundations of Computational Intelligence (FOCI'07), 1-5 April 2007, in press.
• [33] Peters, J.F.: Near sets. Special theory about nearness of objects, Fundamenta Informaticae, vol. 75(1-4), 2007, 407-433.
• [34] Peters, J.F.: Near sets. Toward approximation space-based object recognition. 2007 Joint Rough Set Symposium (JRS07), LNCS, 14-16 May (2007), in press.
• [35] Peters, J.F., Henry, C.: Approximation spaces in off-policyMonte Carlo learning, Engineering Applications of Artificial Intelligence, 2007, in press.
• [36] Peters, J.F.: Approximation space for intelligent system design patterns. Engineering Applications of Artificial Intelligence, 17(4), 2004, 1-8.
• [37] Peters, J.F.: Approximation spaces for hierarchical intelligent behavioral system models. In: B.D.-Keplic¸z, A. Jankowski, A. Skowron, M. Szczuka (Eds.), Monitoring, Security and Rescue Techniques in Multiagent Systems, Advances in Soft Computing, Physica-Verlag, Heidelberg, 2004, 13-30.
• [38] Peters, J.F., Henry, C.: Reinforcement learning with approximation spaces. Fundamenta Informaticae 71 (2-3), 2006, 323-349.
• [39] Polkowski, L.: Rough Sets: Mathematical Foundations. Advances in Soft Computing, Physica-Verlag, Heidelberg, 2002.
• [40] Polkowski, L., Skowron, A.: (Eds.), Rough Sets in Knowledge Discovery 2, Studies in Fuzziness and Soft Computing 19. Springer-Verlag,Heidelberg, 1998.
• [41] Ramanna, S., Peters, J.F., Skowron, A.: Generalized conflict and resolution model with approximation spaces. In: Greco, S., Hata, Y., Hirano, S., Inuiguchi, M., Miyamoto, S., Nguyen, H.S.: Rough Sets and Current Trends in Computing (RSCTC'2006), LNAI 4259. Springer, Berlin, Heidelberg, New York, 2006, 274-283.
• [42] Riesz, F.: Stetigkeitsbegriff und abstrakte Menge. Internat. Congress Mathematicians IV, Rome, vol. 2, R. Accad. Lincei Rome (1909) 18-24.
• [43] Russell, B., Whitehead, A.N.: Principia Mathematica, 3 Vols. Cambridge University Press, Cambridge, UK (1927).
• [44] Simons, P: Parts. A Study of Ontology. Clarendon Press, Oxford, 1987.
• [45] Skowron, A., Stepaniuk, J.: Generalized approximation spaces. In: Lin, T.Y.,Wildberger, A.M. (Eds.), Soft Computing, Simulation Councils, San Diego, 1995, 18-21.
• [46] Skowron, A., Swiniarski, R., Synak, P.: Approximation spaces and information granulation, Transactions on Rough Sets III, LNCS 3400, Springer, Heidelberg, 2005, 175-189.
• [47] Skowron, A., Stepaniuk, J., Peters, J.F., Swiniarski, R.: Calculi of approximation spaces, Fundamenta Informaticae, 72(1-3), 2006, 363-378.
• [48] Stanfil, C.,Waltz, D.: Toward memory-based reasoning, Communications of the ACM 29, 1986, 1213-1228.
• [49] Stepaniuk, J.: Approximation spaces, reducts and representatives, in [40], 1998, 109-126.
• [50] Skowron, A., Swiniarski, R., Synak, P: Approximation spaces and information granulation. Transactions on Rough Sets III: LNCS Journal Subline, LNCS 3400, Springer, Heidelberg, 2005, 175-189.
• [51] Vakarelov, D., Düntsch, I., Bennet, B.: A note on proximity spaces and connection based mereology. In: Welty, C., Smith, B. (Eds.), Proc. 2nd Int. Conf. on Formal Ontology in Information Systems (FOIS'01), 2001, 139-150.
• [52] Wolski, M.: Similarity as nearness: Information quanta, approximation spaces and nearness structures. In: Lindemann, G., Schlingloff, H., Burkhard, H.-D., Czaja, L., Penczek,W., Salwicki, A., Skowron, A., Suraj, Z. (Eds.), Concurrency, Specification and Programming (CS&P'06). Infomatik-Berichte, Nr. 206, 2006, 424-433.
• [53] Ziarko, W.: Variable precision rough sets model. Journal of Computer and Systems Sciences 46(1), 1993, 39-59.
• [54] Ziarko,W.: Probabilistic rough sets. RSFDGrC 2005, LNAI 3641, 2005, 283-293.
• [55] Ziarko,W.: Stochastic approach to rough set theory. RSCTC 2006, LNAI 4259, 2006, 38-48.